Schrödinger-Heisenberg Variational Quantum Algorithms

Abstract

Recent breakthroughs have opened the possibility to intermediate-scale quantum computing with tens to hundreds of qubits, and shown the potential for solving classical challenging problems, such as in chemistry and condensed matter physics. However, the extremely high accuracy needed to surpass classical computers poses a critical demand to the circuit depth, which is severely limited by the non-negligible gate infidelity, currently around 0.1-1%. Here, by incorporating a virtual Heisenberg circuit, which acts effectively on the measurement observables, to a real shallow Schrödinger circuit, which is implemented realistically on the quantum hardware, we propose a paradigm of Schrödinger-Heisenberg variational quantum algorithms to resolve this problem. We choose a Clifford virtual circuit, whose effect on the Hamiltonian can be efficiently and classically implemented according to the Gottesman-Knill theorem. Yet, it greatly enlarges the state expressivity, realizing much larger unitary t-designs. Our method enables accurate quantum simulation and computation that otherwise is only achievable with much deeper and more accurate circuits conventionally. This has been verified in our numerical experiments for a better approximation of random states and a higher-fidelity solution to the ground state energy of the XXZ model. Together with effective quantum error mitigation, our work paves the way for realizing accurate quantum computing algorithms with near-term quantum devices.

5 pages, 4 figures

References in corpus (8)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum computational advantage using photons
• Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
• Strong quantum computational advantage using a superconducting quantum processor
• Lieb-Robinson bounds and the generation of correlations and topological quantum order
• Hybrid quantum-classical algorithms and quantum error mitigation
• Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
• Variational Quantum-Neural Hybrid Eigensolver

Cited by in corpus (11)

• A Hybrid Quantum Computing Pipeline for Real World Drug Discovery
• Tensor-network-assisted variational quantum algorithm
• Reducing Entanglement With Physically-Inspired Fermion-To-Qubit Mappings
• Stabilizer ground states for simulating quantum many-body physics: theory, algorithms, and applications
• Multireference error mitigation for quantum computation of chemistry
• Quantum Machine Learning of Molecular Energies with Hybrid Quantum-Neural Wavefunction
• Boson sampling enhanced quantum chemistry
• Cheaper and more noise-resilient quantum state preparation using eigenvector continuation
• The Dual Role of Low-Weight Pauli Propagation: A Flawed Simulator but a Powerful Initializer for Variational Quantum Algorithms
• Interpolation-based coordinate descent method for parameterized quantum circuits
• Extended parameter shift rules with minimal derivative variance for parameterized quantum circuits