Quantifying the effect of gate errors on variational quantum eigensolvers for quantum chemistry
arXiv:2211.04505 · doi:10.1038/s41534-024-00808-x
Abstract
Variational quantum eigensolvers (VQEs) are leading candidates to demonstrate near-term quantum advantage. Here, we conduct density-matrix simulations of leading gate-based VQEs for a range of molecules. We numerically quantify their level of tolerable depolarizing gate-errors. We find that: (i) The best-performing VQEs require gate-error probabilities between and ( and with error mitigation) to predict, within chemical accuracy, ground-state energies of small molecules with orbitals. (ii) ADAPT-VQEs that construct ansatz circuits iteratively outperform fixed-circuit VQEs. (iii) ADAPT-VQEs perform better with circuits constructed from gate-efficient rather than physically-motivated elements. (iv) The maximally-allowed gate-error probability, , for any VQE to achieve chemical accuracy decreases with the number $\ncx$ of noisy two-qubit gates as $p_c\approxprop\ncx^{-1}$. Additionally, decreases with system size, even with error mitigation, implying that larger molecules require even lower gate-errors. Thus, quantum advantage via gate-based VQEs is unlikely unless gate-error probabilities are decreased by orders of magnitude.
25 pages, 8 figures
References in corpus (5)
- Surface codes: Towards practical large-scale quantum computation
- Quantum Error Mitigation
- The Future of Quantum Computing with Superconducting Qubits
- Surface code with decoherence: An analysis of three superconducting architectures
- Overlap-ADAPT-VQE: Practical Quantum Chemistry on Quantum Computers via Overlap-Guided Compact Ansätze
Cited by in corpus (22)
- Experimental quantum computational chemistry with optimised unitary coupled cluster ansatz
- Stabilizer Tensor Networks: universal quantum simulator on a basis of stabilizer states
- Overcoming the Coherence Time Barrier in Quantum Machine Learning on Temporal Data
- Compact quantum algorithms for time-dependent differential equations
- A Perspective on Quantum Computing Applications in Quantum Chemistry using 25--100 Logical Qubits
- Dynamic-ADAPT-QAOA: An algorithm with shallow and noise-resilient circuits
- Reducing the Resources Required by ADAPT-VQE Using Coupled Exchange Operators and Improved Subroutines
- Spin coupling is all you need: Encoding strong electron correlation in molecules on quantum computers
- Robustness of Variational Quantum Algorithms against stochastic parameter perturbation
- Layering and subpool exploration for adaptive Variational Quantum Eigensolvers: Reducing circuit depth, runtime, and susceptibility to noise
- State preparation of lattice field theories using quantum optimal control
- Greedy Gradient-free Adaptive Variational Quantum Algorithms on a Noisy Intermediate Scale Quantum Computer
- Size-consistency and orbital-invariance issues revealed by VQE-UCCSD calculations with the FMO scheme
- SHARC-VQE: Simplified Hamiltonian Approach with Refinement and Correction enabled Variational Quantum Eigensolver for Molecular Simulation
- Mitigating Quantum Gate Errors for Variational Eigensolvers Using Hardware-Inspired Zero-Noise Extrapolation
- Simulating Chemistry with Fermionic Optical Superlattices
- Machine learning of quantum channels on NISQ devices
- Minimal evolution times for fast, pulse-based state preparation in silicon spin qubits
- Resource-Efficient Cross-Platform Verification with Modular Superconducting Devices
- Measuring Correlation and Entanglement between Molecular Orbitals on a Trapped-Ion Quantum Computer
- Feasibility of performing quantum chemistry calculations on quantum computers
- High-fidelity initialization a logical qubit with multiple injections