Cost function dependent barren plateaus in shallow parametrized quantum circuits.
Ontology highlight
ABSTRACT: 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.
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.
Project description:Variational Quantum Algorithms (VQAs) may be a path to quantum advantage on Noisy Intermediate-Scale Quantum (NISQ) computers. A natural question is whether noise on NISQ devices places fundamental limitations on VQA performance. We rigorously prove a serious limitation for noisy VQAs, in that the noise causes the training landscape to have a barren plateau (i.e., vanishing gradient). Specifically, for the local Pauli noise considered, we prove that the gradient vanishes exponentially in the number of qubits n if the depth of the ansatz grows linearly with n. These noise-induced barren plateaus (NIBPs) are conceptually different from noise-free barren plateaus, which are linked to random parameter initialization. Our result is formulated for a generic ansatz that includes as special cases the Quantum Alternating Operator Ansatz and the Unitary Coupled Cluster Ansatz, among others. For the former, our numerical heuristics demonstrate the NIBP phenomenon for a realistic hardware noise model.
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.
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.
Project description: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.
Project description:Uncovering topologically nontrivial states in nature is an intriguing and important issue in recent years. While most studies are based on the topological band insulators, the topological state in strongly correlated low-dimensional systems has not been extensively explored due to the failure of direct explanation from the topological band insulator theory on such systems and the origin of the topological property is unclear. Here we report the theoretical discovery of strongly correlated topological states in quasi-periodic Heisenberg spin chain systems corresponding to a series of incommensurate magnetization plateaus under the presence of the magnetic field, which are uniquely determined by the quasi-periodic structure of exchange couplings. The topological features of plateau states are demonstrated by the existence of non-trivial spin-flip edge excitations, which can be well characterized by nonzero topological invariants defined in a two-dimensional parameter space. Furthermore, we demonstrate that the topological invariant of the plateau state can be read out from a generalized Streda formula and the spin-flip excitation spectrum exhibits a similar structure of the Hofstadter's butterfly spectrum for the two-dimensional quantum Hall system on a lattice.
Project description:Memristors are resistive elements retaining information of their past dynamics. They have garnered substantial interest due to their potential for representing a paradigm change in electronics, information processing and unconventional computing. Given the advent of quantum technologies, a design for a quantum memristor with superconducting circuits may be envisaged. Along these lines, we introduce such a quantum device whose memristive behavior arises from quasiparticle-induced tunneling when supercurrents are cancelled. For realistic parameters, we find that the relevant hysteretic behavior may be observed using current state-of-the-art measurements of the phase-driven tunneling current. Finally, we develop suitable methods to quantify memory retention in the system.
Project description:The scaling of many photonic quantum information processing systems is ultimately limited by the flux of quantum light throughout an integrated photonic circuit. Source brightness and waveguide loss set basic limits on the on-chip photon flux. While substantial progress has been made, separately, towards ultra-low loss chip-scale photonic circuits and high brightness single-photon sources, integration of these technologies has remained elusive. Here, we report the integration of a quantum emitter single-photon source with a wafer-scale, ultra-low loss silicon nitride photonic circuit. We demonstrate triggered and pure single-photon emission into a Si3N4 photonic circuit with ≈ 1 dB/m propagation loss at a wavelength of ≈ 930 nm. We also observe resonance fluorescence in the strong drive regime, showing promise towards coherent control of quantum emitters. These results are a step forward towards scaled chip-integrated photonic quantum information systems in which storing, time-demultiplexing or buffering of deterministically generated single-photons is critical.
Project description:In one-dimensional conductors, interactions result in correlated electronic systems. At low energy, a hallmark signature of the so-called Tomonaga-Luttinger liquids is the universal conductance curve predicted in presence of an impurity. A seemingly different topic is the quantum laws of electricity, when distinct quantum conductors are assembled in a circuit. In particular, the conductances are suppressed at low energy, a phenomenon called dynamical Coulomb blockade. Here we investigate the conductance of mesoscopic circuits constituted by a short single-channel quantum conductor in series with a resistance, and demonstrate a proposed link to Tomonaga-Luttinger physics. We reformulate and establish experimentally a recently derived phenomenological expression for the conductance using a wide range of circuits, including carbon nanotube data obtained elsewhere. By confronting both conductance data and phenomenological expression with the universal Tomonaga-Luttinger conductance curve, we demonstrate experimentally the predicted mapping between dynamical Coulomb blockade and the transport across a Tomonaga-Luttinger liquid with an impurity.
Project description:It is often said that the transition from quantum to classical worlds is caused by decoherence originated from an interaction between a system of interest and its surrounding environment. Here we establish a computational quantum-classical boundary from the viewpoint of classical simulatability of a quantum system under decoherence. Specifically, we consider commuting quantum circuits being subject to decoherence. Or equivalently, we can regard them as measurement-based quantum computation on decohered weighted graph states. To show intractability of classical simulation in the quantum side, we utilize the postselection argument and crucially strengthen it by taking noise effect into account. Classical simulatability in the classical side is also shown constructively by using both separable criteria in a projected-entangled-pair-state picture and the Gottesman-Knill theorem for mixed state Clifford circuits. We found that when each qubit is subject to a single-qubit complete-positive-trace-preserving noise, the computational quantum-classical boundary is sharply given by the noise rate required for the distillability of a magic state. The obtained quantum-classical boundary of noisy quantum dynamics reveals a complexity landscape of controlled quantum systems. This paves a way to an experimentally feasible verification of quantum mechanics in a high complexity limit beyond classically simulatable region.