Noise-induced barren plateaus in variational quantum algorithms.
Ontology highlight
ABSTRACT:
SUBMITTER: Wang S
PROVIDER: S-EPMC8630047 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Many experimental proposals for noisy intermediate scale quantum devices involve training a parameterized quantum circuit with a classical optimization loop. Such hybrid quantum-classical algorithms are popular for applications in quantum simulation, optimization, and machine learning. Due to its simplicity and hardware efficiency, random circuits are often proposed as initial guesses for exploring the space of quantum states. We show that the exponential dimension of Hilbert space and the gradient estimation complexity make this choice unsuitable for hybrid quantum-classical algorithms run on more than a few qubits. Specifically, we show that for a wide class of reasonable parameterized quantum circuits, the probability that the gradient along any reasonable direction is non-zero to some fixed precision is exponentially small as a function of the number of qubits. We argue that this is related to the 2-design characteristic of random circuits, and that solutions to this problem must be studied.
| S-EPMC6240101 | biostudies-literature
Project description:Variational quantum algorithms (VQAs) optimize the parameters θ of a parametrized quantum circuit V(θ) to minimize a cost function C. While VQAs may enable practical applications of noisy quantum computers, they are nevertheless heuristic methods with unproven scaling. Here, we rigorously prove two results, assuming V(θ) is an alternating layered ansatz composed of blocks forming local 2-designs. Our first result states that defining C in terms of global observables leads to exponentially vanishing gradients (i.e., barren plateaus) even when V(θ) is shallow. Hence, several VQAs in the literature must revise their proposed costs. On the other hand, our second result states that defining C with local observables leads to at worst a polynomially vanishing gradient, so long as the depth of V(θ) is [Formula: see text]. Our results establish a connection between locality and trainability. We illustrate these ideas with large-scale simulations, up to 100 qubits, of a quantum autoencoder implementation.
| S-EPMC7979934 | biostudies-literature
Project description:Variational quantum algorithms, a popular heuristic for near-term quantum computers, utilize parameterized quantum circuits which naturally express Lie groups. It has been postulated that many properties of variational quantum algorithms can be understood by studying their corresponding groups, chief among them the presence of vanishing gradients or barren plateaus, but a theoretical derivation has been lacking. Using tools from the representation theory of compact Lie groups, we formulate a theory of barren plateaus for parameterized quantum circuits whose observables lie in their dynamical Lie algebra, covering a large variety of commonly used ansätze such as the Hamiltonian Variational Ansatz, Quantum Alternating Operator Ansatz, and many equivariant quantum neural networks. Our theory provides, for the first time, the ability to compute the exact variance of the gradient of the cost function of the quantum compound ansatz, under mixing conditions that we prove are commonplace.
| S-EPMC11341719 | biostudies-literature
Project description:Variational quantum computing schemes train a loss function by sending an initial state through a parametrized quantum circuit, and measuring the expectation value of some operator. Despite their promise, the trainability of these algorithms is hindered by barren plateaus (BPs) induced by the expressiveness of the circuit, the entanglement of the input data, the locality of the observable, or the presence of noise. Up to this point, these sources of BPs have been regarded as independent. In this work, we present a general Lie algebraic theory that provides an exact expression for the variance of the loss function of sufficiently deep parametrized quantum circuits, even in the presence of certain noise models. Our results allow us to understand under one framework all aforementioned sources of BPs. This theoretical leap resolves a standing conjecture about a connection between loss concentration and the dimension of the Lie algebra of the circuit's generators.
| S-EPMC11341959 | biostudies-literature
Project description:Preparing thermal states on a quantum computer can have a variety of applications, from simulating many-body quantum systems to training machine learning models. Variational circuits have been proposed for this task on near-term quantum computers, but several challenges remain, such as finding a scalable cost-function, avoiding the need of purification, and mitigating noise effects. We propose a new algorithm for thermal state preparation that tackles those three challenges by exploiting the noise of quantum circuits. We consider a variational architecture containing a depolarizing channel after each unitary layer, with the ability to directly control the level of noise. We derive a closed-form approximation for the free-energy of such circuit and use it as a cost function for our variational algorithm. By evaluating our method on a variety of Hamiltonians and system sizes, we find several systems for which the thermal state can be approximated with a high fidelity. However, we also show that the ability for our algorithm to learn the thermal state strongly depends on the temperature: while a high fidelity can be obtained for high and low temperatures, we identify a specific range for which the problem becomes more challenging. We hope that this first study on noise-assisted thermal state preparation will inspire future research on exploiting noise in variational algorithms.
| S-EPMC8907242 | biostudies-literature
Project description:One of the most important properties of classical neural networks is how surprisingly trainable they are, though their training algorithms typically rely on optimizing complicated, nonconvex loss functions. Previous results have shown that unlike the case in classical neural networks, variational quantum models are often not trainable. The most studied phenomenon is the onset of barren plateaus in the training landscape of these quantum models, typically when the models are very deep. This focus on barren plateaus has made the phenomenon almost synonymous with the trainability of quantum models. Here, we show that barren plateaus are only a part of the story. We prove that a wide class of variational quantum models-which are shallow, and exhibit no barren plateaus-have only a superpolynomially small fraction of local minima within any constant energy from the global minimum, rendering these models untrainable if no good initial guess of the optimal parameters is known. We also study the trainability of variational quantum algorithms from a statistical query framework, and show that noisy optimization of a wide variety of quantum models is impossible with a sub-exponential number of queries. Finally, we numerically confirm our results on a variety of problem instances. Though we exclude a wide variety of quantum algorithms here, we give reason for optimism for certain classes of variational algorithms and discuss potential ways forward in showing the practical utility of such algorithms.
| S-EPMC9755303 | biostudies-literature
Project description:We present a hybrid quantum-classical variational scheme to enhance precision in quantum metrology. In the scheme, both the initial state and the measurement basis in the quantum part are parameterized and optimized via the classical part. It enables the maximization of information gained about the measured quantity. We discuss specific applications to 3D magnetic field sensing under several dephasing noise models. Indeed, we demonstrate its ability to simultaneously estimate all parameters and surpass the standard quantum limit, making it a powerful tool for metrological applications.
| S-EPMC10584960 | biostudies-literature
Project description:Quantum sensing protocols that exploit the dephasing of a probe qubit are powerful and ubiquitous methods for interrogating an unknown environment. They have a variety of applications, ranging from noise mitigation in quantum processors, to the study of correlated electron states. Here, we discuss a simple strategy for enhancing these methods, based on the fact that they often give rise to an inadvertent quench of the probed system: there is an effective sudden change in the environmental Hamiltonian at the start of the sensing protocol. These quenches are extremely sensitive to the initial environmental state, and lead to observable changes in the sensor qubit evolution. We show how these new features give access to environmental response properties. This enables methods for direct measurement of bath temperature, and for detecting non-thermal equilibrium states. We also discuss how to deliberately control and modulate this quench physics, which enables reconstruction of the bath spectral function. Extensions to non-Gaussian quantum baths are also discussed, as is the application of our ideas to a range of sensing platforms (e.g., nitrogen-vacancy (NV) centers in diamond, semiconductor quantum dots, and superconducting circuits).
| S-EPMC8586144 | biostudies-literature
Project description:Variational Bayes (VB) inference algorithm is used widely to estimate both the parameters and the unobserved hidden variables in generative statistical models. The algorithm-inspired by variational methods used in computational physics-is iterative and can get easily stuck in local minima, even when classical techniques, such as deterministic annealing (DA), are used. We study a VB inference algorithm based on a nontraditional quantum annealing approach-referred to as quantum annealing variational Bayes (QAVB) inference-and show that there is indeed a quantum advantage to QAVB over its classical counterparts. In particular, we show that such better performance is rooted in key quantum mechanics concepts: i) The ground state of the Hamiltonian of a quantum system-defined from the given data-corresponds to an optimal solution for the minimization problem of the variational free energy at very low temperatures; ii) such a ground state can be achieved by a technique paralleling the quantum annealing process; and iii) starting from this ground state, the optimal solution to the VB problem can be achieved by increasing the heat bath temperature to unity, and thereby avoiding local minima introduced by spontaneous symmetry breaking observed in classical physics based VB algorithms. We also show that the update equations of QAVB can be potentially implemented using ⌈logK⌉ qubits and 𝒪(K) operations per step, where K is the number of values hidden categorical variables can take. Thus, QAVB can match the time complexity of existing VB algorithms, while delivering higher performance.
| S-EPMC10400996 | biostudies-literature
Project description:Quantum machine learning has made remarkable progress in many important tasks. However, the gate complexity of the initial state preparation is seldom considered in lots of quantum machine learning algorithms, making them non-end-to-end. Herein, we propose a quantum algorithm for the node embedding problem that maps a node graph's topological structure to embedding vectors. The resulting quantum embedding state can be used as an input for other quantum machine learning algorithms. With O(log(N)) qubits to store the information of N nodes, our algorithm will not lose quantum advantage for the subsequent quantum information processing. Moreover, owing to the use of a parameterized quantum circuit with O(poly(log(N))) depth, the resulting state can serve as an efficient quantum database. In addition, we explored the measurement complexity of the quantum node embedding algorithm, which is the main issue in training parameters, and extended the algorithm to capture high-order neighborhood information between nodes. Finally, we experimentally demonstrated our algorithm on an nuclear magnetic resonance quantum processor to solve a graph model.
| S-EPMC11330110 | biostudies-literature