Exploiting subspace constraints and ab initio variational methods for quantum chemistry
arXiv:2206.11246 · doi:10.1088/1367-2630/ace182
Abstract
Variational methods offer a highly promising route to exploiting quantum computers for chemistry tasks. Here we employ methods described in a sister paper to the present report, entitled ab initio machine synthesis of quantum circuits, in order to solve problems using adaptively evolving quantum circuits. Consistent with prior authors we find that this approach can outperform human-designed circuits such as the coupled-cluster or hardware-efficient ansätze, and we make comparisons for larger instances up to 14 qubits. Moreover we introduce a novel approach to constraining the circuit evolution in the physically relevant subspace, finding that this greatly improves performance and compactness of the circuits. We consider both static and dynamics properties of molecular systems. The emulation environments used is QuESTlink; all resources are open source and linked from this paper.
arXiv comment8 pages, 8 figures, 8 pages of appendix, and 12 figures in the appendix
References in corpus (41)
- Quantum Computing in the NISQ era and beyond
- A variational eigenvalue solver on a quantum processor
- Elementary gates for quantum computation
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Barren plateaus in quantum neural network training landscapes
- Quantum computational chemistry
- The Variational Quantum Eigensolver: a review of methods and best practices
- An adaptive variational algorithm for exact molecular simulations on a quantum computer
- Variational ansatz-based quantum simulation of imaginary time evolution
- The Bravyi-Kitaev transformation for quantum computation of electronic structure
- Generalization in quantum machine learning from few training data
- Quantum Natural Gradient
- qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
- Polynomial-time quantum algorithm for the simulation of chemical dynamics
- Quantum-assisted quantum compiling
- QuEST and High Performance Simulation of Quantum Computers
- Variational quantum simulation of general processes
- Tapering off qubits to simulate fermionic Hamiltonians
- Noise Resilience of Variational Quantum Compiling
- Strategies for solving the Fermi-Hubbard model on near-term quantum computers
- Variational algorithms for linear algebra
- Hardware-efficient variational quantum algorithms for time evolution
- Variational Quantum algorithm for Poisson equation
- Fisher Information in Noisy Intermediate-Scale Quantum Applications
- Hardware Efficient Quantum Algorithms for Vibrational Structure Calculations
- Adaptive Variational Quantum Imaginary Time Evolution Approach for Ground State Preparation
- Correlation-Informed Permutation of Qubits for Reducing Ansatz Depth in VQE
- Adaptive pruning-based optimization of parameterized quantum circuits
- Robust quantum compilation and circuit optimisation via energy minimisation
- A Domain-agnostic, Noise-resistant, Hardware-efficient Evolutionary Variational Quantum Eigensolver
- Benchmarking adaptive variational quantum eigensolvers
- Grid-based methods for chemistry simulations on a quantum computer
- MoG-VQE: Multiobjective genetic variational quantum eigensolver
- Variational quantum algorithm for molecular geometry optimization
- QuESTlink -- Mathematica embiggened by a hardware-optimised quantum emulator
- Long-time simulations with high fidelity on quantum hardware
- Variational Quantum Linear Solver with Dynamic Ansatz
- Molecular Excited State Calculations with Adaptive Wavefunctions on a Quantum Eigensolver Emulation: Reducing Circuit Depth and Separating Spin States
- Simulating strongly interacting Hubbard chains with the Variational Hamiltonian Ansatz on a quantum computer
- Exploring ab initio machine synthesis of quantum circuits