Assessment of the variational quantum eigensolver: application to the Heisenberg model
arXiv:2201.05065 · doi:10.3389/fphy.2022.907160
Abstract
We present and analyze large-scale simulation results of a hybrid quantum-classical variational method to calculate the ground state energy of the anti-ferromagnetic Heisenberg model. Using a massively parallel universal quantum computer simulator, we observe that a low-depth-circuit ansatz advantageously exploits the efficiently preparable Néel initial state, avoids potential barren plateaus, and works for both one- and two-dimensional lattices. The analysis reflects the decisive ingredients required for a simulation by comparing different ansätze, initial parameters, and gradient-based versus gradient-free optimizers. Extrapolation to the thermodynamic limit accurately yields the analytical value for the ground state energy, given by the Bethe ansatz. We predict that a fully functional quantum computer with 100 qubits can calculate the ground state energy with a relatively small error.
References in corpus (33)
- A variational eigenvalue solver on a quantum processor
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Barren plateaus in quantum neural network training landscapes
- The theory of variational hybrid quantum-classical algorithms
- Scalable Quantum Simulation of Molecular Energies
- Towards Practical Quantum Variational Algorithms
- Connecting ansatz expressibility to gradient magnitudes and barren plateaus
- Self-Verifying Variational Quantum Simulation of the Lattice Schwinger Model
- Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
- Towards Quantum Machine Learning with Tensor Networks
- Quantum Implementation of Unitary Coupled Cluster for Simulating Molecular Electronic Structure
- Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
- Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
- Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
- Massive Parallel Quantum Computer Simulator
- Structure optimization for parameterized quantum circuits
- Is the Trotterized UCCSD Ansatz chemically well-defined?
- Variational Quantum Eigensolver with Fewer Qubits
- Higher Order Derivatives of Quantum Neural Networks with Barren Plateaus
- Massively parallel quantum computer simulator, eleven years later
- Nearly Optimal Measurement Scheduling for Partial Tomography of Quantum States
- Symmetry-adapted variational quantum eigensolver
- Quantum-optimal-control-inspired ansatz for variational quantum algorithms
- Ordering of Trotterization: Impact on Errors in Quantum Simulation of Electronic Structure
- Abrupt Transitions in Variational Quantum Circuit Training
- Finding the ground state of the Hubbard model by variational methods on a quantum computer with gate errors
- Preparing Bethe Ansatz Eigenstates on a Quantum Computer
- Hamiltonian operator approximation for energy measurement and ground state preparation
- Accelerated variational algorithms for digital quantum simulation of many-body ground states
- Simulating noisy variational quantum eigensolver with local noise models
- A Query-based Quantum Eigensolver
- Deep Variational Quantum Eigensolver: a divide-and-conquer method for solving a larger problem with smaller size quantum computers
- Unitary Block Optimization for Variational Quantum Algorithms
Cited by in corpus (5)
- The Variational Quantum Eigensolver: a review of methods and best practices
- Algebraic Bethe Circuits
- Preparing Valence-Bond-Solid states on noisy intermediate-scale quantum computers
- Improved variational quantum eigensolver via quasi-dynamical evolution
- Characterization of variational quantum algorithms using free fermions