Feasibility of performing quantum chemistry calculations on quantum computers

Abstract

Quantum chemistry is envisioned as an early and disruptive application for quantum computers. Yet, closer scrutiny of the proposed algorithms shows that there are considerable difficulties along the way. Here, we propose two criteria for evaluating two leading quantum approaches for finding the ground state of molecules. The first criterion applies to the variational quantum eigensolver (VQE) algorithm. It sets an upper bound to the level of imprecision/decoherence that can be tolerated in quantum hardware as a function of the targeted precision, the number of gates and the typical energy contribution from states populated by decoherence processes. We find that decoherence is highly detrimental to the accuracy of VQE and performing relevant chemistry calculations would require performances that are expected for fault-tolerant quantum computers, not mere noisy hardware, even with advanced error mitigation techniques. Physically, the sensitivity of VQE to decoherence originates from the fact that, in VQE, the spectrum of the studied molecule has no correlation with the spectrum of the quantum hardware used to perform the computation. The second criterion applies to the quantum phase estimation (QPE) algorithm, which is often presented as the go-to replacement of VQE upon availability of (noiseless) fault-tolerant quantum computers. QPE requires an input state with a large enough overlap with the sought-after ground state. We provide a criterion to estimate quantitatively this overlap based on the energy and the energy variance of said input state. Using input states from a variety of state-of-the-art classical methods, we show that the scaling of this overlap with system size does display the standard orthogonality catastrophe, namely an exponential suppression with system size. This in turns leads to an exponentially reduced QPE success probability.

13 pages, 5 figures, 1 table

References in corpus (60)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A variational eigenvalue solver on a quantum processor
• Quantum Mechanics helps in searching for a needle in a haystack
• Variational Quantum Algorithms
• Barren plateaus in quantum neural network training landscapes
• Quantum computational chemistry
• Simulated Quantum Computation of Molecular Energies
• Error mitigation for short-depth quantum circuits
• Recent developments in the PySCF program package
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Logical quantum processor based on reconfigurable atom arrays
• The Variational Quantum Eigensolver: a review of methods and best practices
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Quantum algorithms for quantum chemistry and quantum materials science
• Elucidating Reaction Mechanisms on Quantum Computers
• Towards Practical Quantum Variational Algorithms
• Quantum error correction below the surface code threshold
• Efficient variational quantum simulator incorporating active error minimisation
• Quantum Error Mitigation
• Self-Verifying Variational Quantum Simulation of the Lattice Schwinger Model
• Practical Quantum Error Mitigation for Near-Future Applications
• Hybrid quantum-classical algorithms and quantum error mitigation
• Probabilistic error cancellation with sparse Pauli-Lindblad models on noisy quantum processors
• Quantum computing enhanced computational catalysis
• Is there evidence for exponential quantum advantage in quantum chemistry?
• Fermionic neural-network states for ab-initio electronic structure
• Barren Plateaus in Variational Quantum Computing
• What limits the simulation of quantum computers?
• Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
• Near-optimal ground state preparation
• Fundamental limits of quantum error mitigation
• The Ground State Electronic Energy of Benzene
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits
• Reliably assessing the electronic structure of cytochrome P450 on today's classical computers and tomorrow's quantum computers
• Ab-initio quantum chemistry with neural-network wavefunctions
• Measurements as a roadblock to near-term practical quantum advantage in chemistry: resource analysis
• Stable Quantum-Correlated Many Body States through Engineered Dissipation
• Chemistry Beyond the Scale of Exact Diagonalization on a Quantum-Centric Supercomputer
• Accuracy and Resource Estimations for Quantum Chemistry on a Near-term Quantum Computer
• A density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity
• Purification-based quantum error mitigation of pair-correlated electron simulations
• Variational Benchmarks for Quantum Many-Body Problems
• Single-ancilla ground state preparation via Lindbladians
• Universal cost bound of quantum error mitigation based on quantum estimation theory
• Quantum computing for chemistry and physics applications from a Monte Carlo perspective
• Quantifying the effect of gate errors on variational quantum eigensolvers for quantum chemistry
• Quantum digital cooling
• Rapid initial state preparation for the quantum simulation of strongly correlated molecules
• Efficiently improving the performance of noisy quantum computers
• Classically estimating observables of noiseless quantum circuits
• Opening the Black Box Inside Grover's Algorithm
• Combining Matrix Product States and Noisy Quantum Computers for Quantum Simulation
• Mitigating crosstalk errors by randomized compiling: Simulation of the BCS model on a superconducting quantum computer
• The Quantum House Of Cards
• Variational wave functions, ground state and their overlap
• Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation
• What determines the ultimate precision of a quantum computer?
• Hubbard physics with Rydberg atoms: using a quantum spin simulator to simulate strong fermionic correlations
• Practicality of quantum adiabatic algorithm for chemistry applications
• Improving Quantum Approximate Optimization by Noise-Directed Adaptive Remapping

Cited by in corpus (1)

• Who can compete with quantum computers? Lecture notes on quantum inspired tensor networks computational techniques