State Preparation Boosters for Early Fault-Tolerant Quantum Computation
arXiv:2202.06978 · doi:10.22331/q-2022-10-06-829
Abstract
Quantum computing is believed to be particularly useful for the simulation of chemistry and materials, among the various applications. In recent years, there have been significant advancements in the development of near-term quantum algorithms for quantum simulation, including VQE and many of its variants. However, for such algorithms to be useful, they need to overcome several critical barriers including the inability to prepare high-quality approximations of the ground state. Current challenges to state preparation, including barren plateaus and the high-dimensionality of the optimization landscape, make state preparation through ansatz optimization unreliable. In this work, we introduce the method of ground state boosting, which uses a limited-depth quantum circuit to reliably increase the overlap with the ground state. This circuit, which we call a booster, can be used to augment an ansatz from VQE or be used as a stand-alone state preparation method. The booster converts circuit depth into ground state overlap in a controllable manner. We numerically demonstrate the capabilities of boosters by simulating the performance of a particular type of booster, namely the Gaussian booster, for preparing the ground state of molecular system. Beyond ground state preparation as a direct objective, many quantum algorithms, such as quantum phase estimation, rely on high-quality state preparation as a subroutine. Therefore, we foresee ground state boosting and similar methods as becoming essential algorithmic components as the field transitions into using early fault-tolerant quantum computers.
arXiv commentComparison with related works and more detailed proofs are added
References in corpus (27)
- A variational eigenvalue solver on a quantum processor
- Barren plateaus in quantum neural network training landscapes
- The theory of variational hybrid quantum-classical algorithms
- Quantum Chemistry in the Age of Quantum Computing
- Simulated Quantum Computation of Molecular Energies
- Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
- Variational ansatz-based quantum simulation of imaginary time evolution
- Variational Quantum Computation of Excited States
- Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
- Polynomial-time quantum algorithm for the simulation of chemical dynamics
- Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
- Subspace-search variational quantum eigensolver for excited states
- Fixed-point quantum search with an optimal number of queries
- Optimal Quantum Measurements of Expectation Values of Observables
- Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
- Near-optimal ground state preparation
- Filtering variational quantum algorithms for combinatorial optimization
- Preparing ground states of quantum many-body systems on a quantum computer
- Minimizing estimation runtime on noisy quantum computers
- A Feasible Approach for Automatically Differentiable Unitary Coupled-Cluster on Quantum Computers
- Adaptive pruning-based optimization of parameterized quantum circuits
- Reducing qubit requirements while maintaining numerical precision for the Variational Quantum Eigensolver: A Basis-Set-Free Approach
- Computing Ground State Properties with Early Fault-Tolerant Quantum Computers
- Optimized Low-Depth Quantum Circuits for Molecular Electronic Structure using a Separable Pair Approximation
- Quantum Gaussian filter for exploring ground-state properties
- Improved approximation algorithms for bounded-degree local Hamiltonians
- Quantum Computation of Eigenvalues within Target Intervals
Cited by in corpus (13)
- Early Fault-Tolerant Quantum Computing
- Quantum algorithm for ground state energy estimation using circuit depth with exponentially improved dependence on precision
- Initial state preparation for quantum chemistry on quantum computers
- Sparse Quantum State Preparation for Strongly Correlated Systems
- Quantum Gaussian filter for exploring ground-state properties
- Optimal scheduling in probabilistic imaginary-time evolution on a quantum computer
- Spin coupling is all you need: Encoding strong electron correlation in molecules on quantum computers
- Option pricing under stochastic volatility on a quantum computer
- On proving the robustness of algorithms for early fault-tolerant quantum computers
- Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation
- Efficient ground-state energy estimation and certification on early fault-tolerant quantum computers
- Error mitigation and circuit division for early fault-tolerant quantum phase estimation
- Quantum phase estimation based filtering: performance analysis and application to low-energy spectral calculation