Stabilizer configuration interaction: Finding molecular subspaces with error detection properties
arXiv:2410.21125 · doi:10.1103/jkcp-6km5
Abstract
In this work, we explore a new approach to designing both algorithms and error detection codes for preparing approximate ground states of molecules. We propose a classical algorithm to find the optimal stabilizer state by using excitations of the Hartree-Fock state, followed by constructing quantum error-detection codes based on this stabilizer state using codeword-stabilized codes. Through various numerical experiments, we confirm that our method finds the best stabilizer approximations to the true ground states of molecules up to 36 qubits in size. Additionally, we construct generalized stabilizer states that offer a better approximation to the true ground states. Furthermore, for a simple noise model, we demonstrate that both the stabilizer and (some) generalized stabilizer states can be prepared with higher fidelity using the error-detection codes we construct. Our work represents a promising step toward designing algorithms for early fault-tolerant quantum computation.
References in corpus (38)
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- Barren plateaus in quantum neural network training landscapes
- The theory of variational hybrid quantum-classical algorithms
- Noisy intermediate-scale quantum (NISQ) algorithms
- Quantum Circuit Learning
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Simulated Quantum Computation of Molecular Energies
- Suppressing quantum errors by scaling a surface code logical qubit
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- Logical quantum processor based on reconfigurable atom arrays
- Evaluating analytic gradients on quantum hardware
- An adaptive variational algorithm for exact molecular simulations on a quantum computer
- Towards Practical Quantum Variational Algorithms
- Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
- Variational ansatz-based quantum simulation of imaginary time evolution
- qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
- Stim: a fast stabilizer circuit simulator
- Repeated Quantum Error Detection in a Surface Code
- Graphical description of the action of local Clifford transformations on graph states
- Demonstration of fault-tolerant universal quantum gate operations
- Stochastic gradient descent for hybrid quantum-classical optimization
- Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
- Reducing T-count with the ZX-calculus
- Performance comparison of optimization methods on variational quantum algorithms
- Early Fault-Tolerant Quantum Computing
- Even shorter quantum circuit for phase estimation on early fault-tolerant quantum computers with applications to ground-state energy estimation
- A Feasible Approach for Automatically Differentiable Unitary Coupled-Cluster on Quantum Computers
- Tequila: A platform for rapid development of quantum algorithms
- Computing Ground State Properties with Early Fault-Tolerant Quantum Computers
- Optimized Low-Depth Quantum Circuits for Molecular Electronic Structure using a Separable Pair Approximation
- Natural Evolutionary Strategies for Variational Quantum Computation
- Local unitary versus local Clifford equivalence of stabilizer and graph states
- Shorter quantum circuits via single-qubit gate approximation
- Partitioning Quantum Chemistry Simulations with Clifford Circuits
- Stabilizer ground states for simulating quantum many-body physics: theory, algorithms, and applications
- Hamiltonian-based graph-state ansatz for variational quantum algorithms
- Leveraging commuting groups for an efficient variational Hamiltonian ansatz