Hybrid Quantum-Classical Approach to Quantum Optimal Control

Self-Consistent Determination of Single-Impurity Anderson Model Using Hybrid Quantum-Classical Approach on a Spin Quantum Simulator

The accurate determination of the electronic structure of strongly correlated materials using first principle methods is of paramount importance in condensed matter physics, computational chemistry, and material science. However, due to the exponential scaling of computational resources, incorporating such materials into classical computation frameworks becomes prohibitively expensive. In 2016, Bauer et al. proposed a hybrid quantum-classical approach to correlated materials [B. Bauer et al., Hybrid quantum-classical approach to correlated materials, Phys. Rev. X 6, 031045 (2016).PRXHAE2160-330810.1103/PhysRevX.6.031045] that can efficiently tackle the electronic structure of complex correlated materials. Here, we experimentally demonstrate that approach to tackle the computational challenges associated with strongly correlated materials. By seamlessly integrating quantum computation into classical computers, we address the most computationally demanding aspect of the calculation, namely the computation of the Green's function, using a spin quantum processor. Furthermore, we realize a self-consistent determination of the single impurity Anderson model through a feedback loop between quantum and classical computations. A quantum phase transition in the Hubbard model from the metallic phase to the Mott insulator is observed as the strength of electron correlation increases. As the number of qubits with high control fidelity continues to grow, our experimental findings pave the way for solving even more complex models, such as strongly correlated crystalline materials or intricate molecules.

Variational Quantum Circuit Decoupling

Decoupling systems into independently evolving components has a long history of simplifying seemingly complex systems. They enable a better understanding of the underlying dynamics and causal structures while providing more efficient means to simulate such processes on a computer. Here we outline a variational decoupling algorithm for decoupling unitary quantum dynamics-allowing us to decompose a given n-qubit unitary gate into multiple independently evolving sub-components. We apply this approach to quantum circuit synthesis-the task of discovering quantum circuit implementations of target unitary dynamics. Our numerical studies illustrate significant benefits, showing that variational decoupling enables us to synthesize general two- and four-qubit gates to fidelity that conventional variational circuits cannot reach.

Fast-forwarding molecular ground state preparation with optimal control on analog quantum simulators

We show that optimal control of the electron dynamics is able to prepare molecular ground states, within chemical accuracy, with evolution times approaching the bounds imposed by quantum mechanics. We propose a specific parameterization of the molecular evolution only in terms of interaction already present in the molecular Hamiltonian. Thus, the proposed method solely utilizes quantum simulation routines, retaining their favorable scalings. Due to the intimate relationships between variational quantum algorithms and optimal control, we compare, when possible, our results with state-of-the-art methods in the literature. We found that the number of parameters needed to reach chemical accuracy and algorithmic scaling is in line with compact adaptive strategies to build variational Ansätze. The algorithm, which is also suitable for quantum simulators, is implemented by emulating a digital quantum processor (up to 16 qubits) and tested on different molecules and geometries spanning different degrees of electron correlation.

Subspace Methods for the Simulation of Molecular Response Properties on a Quantum Computer

We explore Davidson methods for obtaining excitation energies and other linear response properties within the recently developed quantum self-consistent linear response (q-sc-LR) method. Davidson-type methods allow for obtaining only a few selected excitation energies without explicitly constructing the electronic Hessian since they only require the ability to perform Hessian-vector multiplications. We apply the Davidson method to calculate the excitation energies of hydrogen chains (up to H10) and analyze aspects of statistical noise for computing excitation energies on quantum simulators. Additionally, we apply Davidson methods for computing linear response properties such as static polarizabilities for H2, LiH, H2O, OH-, and NH3, and show that unitary coupled cluster outperforms classical projected coupled cluster for molecular systems with strong correlation. Finally, we formulate the Davidson method for damped (complex) linear response, with application to the nitrogen K-edge X-ray absorption of ammonia, and the C6 coefficients of H2, LiH, H2O, OH-, and NH3.

Spatially correlated classical and quantum noise in driven qubits

Correlated noise across multiple qubits poses a significant challenge for achieving scalable and fault-tolerant quantum processors. Despite recent experimental efforts to quantify this noise in various qubit architectures, a comprehensive understanding of its role in qubit dynamics remains elusive. Here, we present an analytical study of the dynamics of driven qubits under spatially correlated noise, including both Markovian and non-Markovian noise. Surprisingly, we find that by operating the qubit system at low temperatures, where correlated quantum noise plays an important role, significant long-lived entanglement between qubits can be generated. Importantly, this generation process can be controlled on-demand by turning the qubit driving on and off. On the other hand, we demonstrate that by operating the system at a higher temperature, the crosstalk between qubits induced by the correlated noise is unexpectedly suppressed. We finally reveal the impact of spatio-temporally correlated 1/f noise on the decoherence rate, and how its temporal correlations restore lost entanglement. Our findings provide critical insights into not only suppressing crosstalk between qubits caused by correlated noise but also in effectively leveraging such noise as a beneficial resource for controlled entanglement generation.

Controlling NMR spin systems for quantum computation

Nuclear magnetic resonance is arguably both the best available quantum technology for implementing simple quantum computing experiments and the worst technology for building large scale quantum computers that has ever been seriously put forward. After a few years of rapid growth, leading to an implementation of Shor's quantum factoring algorithm in a seven-spin system, the field started to reach its natural limits and further progress became challenging. Rather than pursuing more complex algorithms on larger systems, interest has now largely moved into developing techniques for the precise and efficient manipulation of spin states with the aim of developing methods that can be applied in other more scalable technologies and within conventional NMR. However, the user friendliness of NMR implementations means that they remain popular for proof-of-principle demonstrations of simple quantum information protocols.

Synergistic pretraining of parametrized quantum circuits via tensor networks

Parametrized quantum circuits (PQCs) represent a promising framework for using present-day quantum hardware to solve diverse problems in materials science, quantum chemistry, and machine learning. We introduce a "synergistic" approach that addresses two prominent issues with these models: the prevalence of barren plateaus in PQC optimization landscapes, and the difficulty to outperform state-of-the-art classical algorithms. This framework first uses classical resources to compute a tensor network encoding a high-quality solution, and then converts this classical output into a PQC which can be further improved using quantum resources. We provide numerical evidence that this framework effectively mitigates barren plateaus in systems of up to 100 qubits using only moderate classical resources, with overall performance improving as more classical or quantum resources are employed. We believe our results highlight that classical simulation methods are not an obstacle to overcome in demonstrating practically useful quantum advantage, but rather can help quantum methods find their way.

Learning to Learn Variational Quantum Algorithm

Variational quantum algorithms (VQAs) use classical computers as the quantum outer loop optimizer and update the circuit parameters to obtain an approximate ground state. In this article, we present a meta-learning variational quantum algorithm (meta-VQA) by recurrent unit, which uses a technique called "meta-learner." Motivated by the hybrid quantum-classical algorithms, we train classical recurrent units to assist quantum computing, learning to find approximate optima in the parameter landscape. Here, aiming to reduce the sampling number more efficiently, we use the quantum stochastic gradient descent method and introduce the adaptive learning rate. Finally, we deploy on the TensorFlow Quantum processor within approximate quantum optimization for the Ising model and variational quantum eigensolver for molecular hydrogen (H2), lithium hydride (LiH), and helium hydride cation (HeH+). Our algorithm can be expanded to larger system sizes and problem instances, which have higher performance on near-term processors.

Training a quantum measurement device to discriminate unknown non-orthogonal quantum states

Here, we study the problem of decoding information transmitted through unknown quantum states. We assume that Alice encodes an alphabet into a set of orthogonal quantum states, which are then transmitted to Bob. However, the quantum channel that mediates the transmission maps the orthogonal states into non-orthogonal states, possibly mixed. If an accurate model of the channel is unavailable, then the states received by Bob are unknown. In order to decode the transmitted information we propose to train a measurement device to achieve the smallest possible error in the discrimination process. This is achieved by supplementing the quantum channel with a classical one, which allows the transmission of information required for the training, and resorting to a noise-tolerant optimization algorithm. We demonstrate the training method in the case of minimum-error discrimination strategy and show that it achieves error probabilities very close to the optimal one. In particular, in the case of two unknown pure states, our proposal approaches the Helstrom bound. A similar result holds for a larger number of states in higher dimensions. We also show that a reduction of the search space, which is used in the training process, leads to a considerable reduction in the required resources. Finally, we apply our proposal to the case of the phase flip channel reaching an accurate value of the optimal error probability.

99.92%-Fidelity cnot Gates in Solids by Noise Filtering

Inevitable interactions with the reservoir largely degrade the performance of entangling gates, which hinders practical quantum computation from coming into existence. Here, we experimentally demonstrate a 99.920(7)%-fidelity controlled-not gate by suppressing the complicated noise in a solid-state spin system at room temperature. We found that the fidelity limited at 99% in previous works results from considering only static classical noise, and, thus, in this work, a complete noise model is constructed by also considering the time dependence and the quantum nature of the spin bath. All noises in the model are dynamically corrected by an exquisitely designed shaped pulse, giving the resulting error below 10^{-4}. The residual gate error is mainly originated from the longitudinal relaxation and the waveform distortion that can both be further reduced technically. Our noise-resistant method is universal and will benefit other solid-state spin systems.

Biology and medicine in the landscape of quantum advantages

Quantum computing holds substantial potential for applications in biology and medicine, spanning from the simulation of biomolecules to machine learning methods for subtyping cancers on the basis of clinical features. This potential is encapsulated by the concept of a quantum advantage, which is contingent on a reduction in the consumption of a computational resource, such as time, space or data. Here, we distill the concept of a quantum advantage into a simple framework to aid researchers in biology and medicine pursuing the development of quantum applications. We then apply this framework to a wide variety of computational problems relevant to these domains in an effort to (i) assess the potential of practical advantages in specific application areas and (ii) identify gaps that may be addressed with novel quantum approaches. In doing so, we provide an extensive survey of the intersection of biology and medicine with the current landscape of quantum algorithms and their potential advantages. While we endeavour to identify specific computational problems that may admit practical advantages throughout this work, the rapid pace of change in the fields of quantum computing, classical algorithms and biological research implies that this intersection will remain highly dynamic for the foreseeable future.

Experimental quantum adversarial learning with programmable superconducting qubits

Quantum computing promises to enhance machine learning and artificial intelligence. However, recent theoretical works show that, similar to traditional classifiers based on deep classical neural networks, quantum classifiers would suffer from adversarial perturbations as well. Here we report an experimental demonstration of quantum adversarial learning with programmable superconducting qubits. We train quantum classifiers, which are built on variational quantum circuits consisting of ten transmon qubits featuring average lifetimes of 150 μs, and average fidelities of simultaneous single- and two-qubit gates above 99.94% and 99.4%, respectively, with both real-life images (for example, medical magnetic resonance imaging scans) and quantum data. We demonstrate that these well-trained classifiers (with testing accuracy up to 99%) can be practically deceived by small adversarial perturbations, whereas an adversarial training process would substantially enhance their robustness to such perturbations.

Entanglement-Enhanced Quantum Metrology in Colored Noise by Quantum Zeno Effect

In open quantum systems, the precision of metrology inevitably suffers from the noise. In Markovian open quantum dynamics, the precision can not be improved by using entangled probes although the measurement time is effectively shortened. However, it was predicted over one decade ago that in a non-Markovian one, the error can be significantly reduced by the quantum Zeno effect (QZE) [Chin, Huelga, and Plenio, Phys. Rev. Lett. 109, 233601 (2012)PRLTAO0031-900710.1103/PhysRevLett.109.233601]. In this work, we apply a recently developed quantum simulation approach to experimentally verify that entangled probes can improve the precision of metrology by the QZE. Up to n=7 qubits, we demonstrate that the precision has been improved by a factor of n^{1/4}, which is consistent with the theoretical prediction. Our quantum simulation approach may provide an intriguing platform for experimental verification of various quantum metrology schemes.

Simulating the Dicke lattice model and quantum phase transitions using an array of coupled resonators

A proposal for simulating the Dicke-Lattice model in a mechanics-controlled hybrid quantum system is studied here. An array of coupled mechanical resonators (MRs) can homogeneously interact with a group of trapped Bose-Einstein condensates (BECs) via the gradient magnetic field induced by the oscillating resonators. Assisted by the classical dichromatic radio-wave fields, each subsystem with the BEC-MR interaction can mimic the Dicke type spin-phonon interaction, and the whole system is therefore extended to a lattice of Dicke models with the additional adjacent phonon-phonon hopping couplings. In view of this lattice model with theZ₂symmetry, its quantum phase transitions behavior can be controlled by this periodic phonon-phonon interactions in the momentum space. This investigation may be considered as a fresh attempt on manipulating the critical behaviors of the collective spins through the external mechanical method.

Optimal Control of Families of Quantum Gates

Quantum optimal control (QOC) enables the realization of accurate operations, such as quantum gates, and supports the development of quantum technologies. To date, many QOC frameworks have been developed, but those remain only naturally suited to optimize a single targeted operation at a time. We extend this concept to optimal control with a continuous family of targets, and demonstrate that an optimization based on neural networks can find families of time-dependent Hamiltonians realizing desired classes of quantum gates in minimal time.

Variational Quantum-Neural Hybrid Eigensolver

The variational quantum eigensolver (VQE) is one of the most representative quantum algorithms in the noisy intermediate-scale quantum (NISQ) era, and is generally speculated to deliver one of the first quantum advantages for the ground-state simulations of some nontrivial Hamiltonians. However, short quantum coherence time and limited availability of quantum hardware resources in the NISQ hardware strongly restrain the capacity and expressiveness of VQEs. In this Letter, we introduce the variational quantum-neural hybrid eigensolver (VQNHE) in which the shallow-circuit quantum Ansatz can be further enhanced by classical post-processing with neural networks. We show that the VQNHE consistently and significantly outperforms the VQE in simulating ground-state energies of quantum spins and molecules given the same amount of quantum resources. More importantly, we demonstrate that, for arbitrary postprocessing neural functions, the VQNHE only incurs a polynomial overhead of processing time and represents the first scalable method to exponentially accelerate the VQE with nonunitary postprocessing that can be efficiently implemented in the NISQ era.

Qsun: an open-source platform towards practical quantum machine learning applications

Currently, quantum hardware is restrained by noises and qubit numbers. Thus, a quantum virtual machine (QVM) that simulates operations of a quantum computer on classical computers is a vital tool for developing and testing quantum algorithms before deploying them on real quantum computers. Various variational quantum algorithms (VQAs) have been proposed and tested on QVMs to surpass the limitations of quantum hardware. Our goal is to exploit further the VQAs towards practical applications of quantum machine learning (QML) using state-of-the-art quantum computers. In this paper, we first introduce a QVM named Qsun, whose operation is underlined by quantum state wavefunctions. The platform provides native tools supporting VQAs. Especially using the parameter-shift rule, we implement quantum differentiable programming essential for gradient-based optimization. We then report two tests representative of QML: quantum linear regression and quantum neural network.

Algorithmic Primitives for Quantum-Assisted Quantum Control

We present two primitive algorithms to evaluate overlaps and transition matrix time series, which are then used to construct several quantum-assisted quantum control algorithms. Unlike previous approaches, our method bypasses tomographically complete measurements and instead relies solely on single qubit measurements. We analyze circuit complexity of composed algorithms and sources of noise arising from Trotterization and measurement errors.

Low-Depth Gradient Measurements Can Improve Convergence in Variational Hybrid Quantum-Classical Algorithms

Within a natural black-box setting, we exhibit a simple optimization problem for which a quantum variational algorithm that measures analytic gradients of the objective function with a low-depth circuit and performs stochastic gradient descent provably converges to an optimum faster than any algorithm that only measures the objective function itself, settling the question of whether measuring analytic gradients in such algorithms can ever be beneficial. We also derive upper bounds on the cost of gradient-based variational optimization near a local minimum.

Experimental Quantum Principal Component Analysis via Parametrized Quantum Circuits

Principal component analysis (PCA) is a widely applied but rather time-consuming tool in machine learning techniques. In 2014, Lloyd, Mohseni, and Rebentrost proposed a quantum PCA (qPCA) algorithm [Lloyd, Mohseni, and Rebentrost, Nat. Phys. 10, 631 (2014)NPAHAX1745-247310.1038/nphys3029] that still lacks experimental demonstration due to the experimental challenges in preparing multiple quantum state copies and implementing quantum phase estimations. Here, we propose a new qPCA algorithm using the hybrid classical-quantum control, where parameterized quantum circuits are optimized with simple measurement observables, which significantly reduces the experimental complexity. As one important PCA application, we implement a human face recognition process using the images from the Yale Face Dataset. By training our quantum processor, the eigenface information in the training dataset is encoded into the parameterized quantum circuit, and the quantum processor learns to recognize new face images from the test dataset with high fidelities. Our work paves a new avenue toward the study of qPCA applications in theory and experiment.

Solving quantum statistical mechanics with variational autoregressive networks and quantum circuits

We extend the ability of an unitary quantum circuit by interfacing it with a classical autoregressive neural network. The combined model parametrizes a variational density matrix as a classical mixture of quantum pure states, where the autoregressive network generates bitstring samples as input states to the quantum circuit. We devise an efficient variational algorithm to jointly optimize the classical neural network and the quantum circuit to solve quantum statistical mechanics problems. One can obtain thermal observables such as the variational free energy, entropy, and specific heat. As a byproduct, the algorithm also gives access to low energy excitation states. We demonstrate applications of the approach to thermal properties and excitation spectra of the quantum Ising model with resources that are feasible on near-term quantum computers.

Hybrid quantum-classical approach to enhanced quantum metrology

Quantum metrology plays a fundamental role in many scientific areas. However, the complexity of engineering entangled probes and the external noise raise technological barriers for realizing the expected precision of the to-be-estimated parameter with given resources. Here, we address this problem by introducing adjustable controls into the encoding process and then utilizing a hybrid quantum-classical approach to automatically optimize the controls online. Our scheme does not require any complex or intractable off-line design, and it can inherently correct certain unitary errors during the learning procedure. We also report the first experimental demonstration of this promising scheme for the task of finding optimal probes for frequency estimation on a nuclear magnetic resonance (NMR) processor. The proposed scheme paves the way to experimentally auto-search optimal protocol for improving the metrology precision.

Complete Quantum-State Tomography with a Local Random Field

Single-qubit measurements are typically insufficient for inferring arbitrary quantum states of a multiqubit system. We show that, if the system can be fully controlled by driving a single qubit, then utilizing a local random pulse is almost always sufficient for complete quantum-state tomography. Experimental demonstrations of this principle are presented using a nitrogen-vacancy (NV) center in diamond coupled to a nuclear spin, which is not directly accessible. We report the reconstruction of a highly entangled state between the electron and nuclear spin with fidelity above 95% by randomly driving and measuring the NV-center electron spin only. Beyond quantum-state tomography, we outline how this principle can be leveraged to characterize and control quantum processes in cases where the system model is not known.

An improved differential evolution algorithm for learning high-fidelity quantum controls

Precisely and efficiently designing control pulses for the preparation of quantum states and quantum gates are the fundamental tasks for quantum computation. Gradient-based optimal control methods are the routine to design such pulses. However, the gradient information is often difficult to calculate or measure, especially when the system is not well calibrated or in the presence of various uncertainties. Gradient-free evolutionary algorithm is an alternative choice to accomplish this task but usually with low-efficiency. Here, we design an efficient mutation rule by using the information of the current and the former individuals together. This leads to our improved differential evolution algorithm, called daDE. To demonstrate its performance, we numerically benchmark the pulse optimization for quantum states and quantum gates preparations on small-scale NMR system. Further numerical comparisons with conventional differential evolution algorithms show that daDE has great advantages on the convergence speed and robustness to several uncertainties including pulse imperfections and measurement errors.

Quantum generative adversarial learning in a superconducting quantum circuit

Generative adversarial learning is one of the most exciting recent breakthroughs in machine learning. It has shown splendid performance in a variety of challenging tasks such as image and video generation. More recently, a quantum version of generative adversarial learning has been theoretically proposed and shown to have the potential of exhibiting an exponential advantage over its classical counterpart. Here, we report the first proof-of-principle experimental demonstration of quantum generative adversarial learning in a superconducting quantum circuit. We demonstrate that, after several rounds of adversarial learning, a quantum-state generator can be trained to replicate the statistics of the quantum data output from a quantum channel simulator, with a high fidelity (98.8% on average) so that the discriminator cannot distinguish between the true and the generated data. Our results pave the way for experimentally exploring the intriguing long-sought-after quantum advantages in machine learning tasks with noisy intermediate-scale quantum devices.