Efficient Quantum Circuits based on the Quantum Natural Gradient
arXiv:2310.10538 · doi:10.1103/PhysRevResearch.6.043083
Abstract
Efficient preparation of arbitrary entangled quantum states is crucial for quantum computation. This is particularly important for noisy intermediate scale quantum simulators relying on variational hybrid quantum-classical algorithms. To that end, we propose symmetry-conserving modified quantum approximate optimization algorithm~(SCom-QAOA) circuits. The depths of these circuits depend not only on the desired fidelity to the target state, but also on the amount of entanglement the state contains. The parameters of the SCom-QAOA circuits are optimized using the quantum natural gradient method based on the Fubini-Study metric. The SCom-QAOA circuit transforms an unentangled state into a ground state of a gapped one-dimensional Hamiltonian with a circuit-depth that depends not on the system-size, but rather on the finite correlation length. In contrast, the circuit depth grows proportionally to the system size for preparing low-lying states of critical one-dimensional systems. Even in the latter case, SCom-QAOA circuits with depth less than the system-size were sufficient to generate states with fidelity in excess of 99\%, which is relevant for near-term applications. The proposed scheme enlarges the set of the initial states accessible for variational quantum algorithms and widens the scope of investigation of non-equilibrium phenomena in quantum simulators.
11 pages, 7 figures, published version
References in corpus (47)
- Probing many-body dynamics on a 51-atom quantum simulator
- Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
- Evolution of Entanglement Entropy in One-Dimensional Systems
- An Area Law for One Dimensional Quantum Systems
- The Variational Quantum Eigensolver: a review of methods and best practices
- A class of quantum many-body states that can be efficiently simulated
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Efficient variational quantum simulator incorporating active error minimisation
- Quantum Computation as Geometry
- Quantum Natural Gradient
- Efficient numerical simulations with Tensor Networks: Tensor Network Python (TeNPy)
- Entropy scaling and simulability by Matrix Product States
- Training variational quantum algorithms is NP-hard
- Circuit complexity in quantum field theory
- Quantum-state preparation with universal gate decompositions
- Geometry and non-adiabatic response in quantum and classical systems
- Simulating quantum many-body dynamics on a current digital quantum computer
- The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size
- Multimode quantum interference of photons in multiport integrated devices
- Witnessing eigenstates for quantum simulation of Hamiltonian spectra
- Entanglement of low-energy excitations in Conformal Field Theory
- -mixers: analytical and numerical results for QAOA
- A divide-and-conquer algorithm for quantum state preparation
- Quantum circuits for strongly correlated quantum systems
- Quantum circuits with uniformly controlled one-qubit gates
- Classifying and measuring the geometry of the quantum ground state manifold
- Avoiding local minima in variational quantum eigensolvers with the natural gradient optimizer
- Efficient variational simulation of non-trivial quantum states
- Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem
- Parameter Concentration in Quantum Approximate Optimization
- Preparation of matrix product states with log-depth quantum circuits
- Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut
- Lattice supersymmetry and order-disorder coexistence in the tricritical Ising model
- On the Universality of the Quantum Approximate Optimization Algorithm
- Compression of Correlation Matrices and an Efficient Method for Forming Matrix Product States of Fermionic Gaussian States
- Confinement and Entanglement Dynamics on a Digital Quantum Computer
- Entanglement spreading in non-equilibrium integrable systems
- Constrained mixers for the quantum approximate optimization algorithm
- Alignment between Initial State and Mixer Improves QAOA Performance for Constrained Optimization
- Quantum Circuits for Sparse Isometries
- Complexity of mixed Gaussian states from Fisher information geometry
- Low-rank quantum state preparation
- QGOpt: Riemannian optimization for quantum technologies
- Integrability and complexity in quantum spin chains
- Mixer-Phaser Ansätze for Quantum Optimization with Hard Constraints
- Preparation and verification of tensor network states
- Ising Meson Spectroscopy on a Noisy Digital Quantum Simulator