A Quantum Algorithmic Approach to Multiconfigurational Valence Bond Theory: Insights from Interpretable Circuit Design
arXiv:2302.10660 · doi:10.1021/acs.jctc.3c00565
Abstract
Efficient ways to prepare fermionic ground states on quantum computers are in high demand and different techniques have been developed over the last years. Despite having a vast set of methods, it is still unclear which method performs well for which system. In this work, we combine interpretable circuit designs with an effective basis approach in order to optimize a multiconfigurational valence bond wavefunction. Based on selected model systems, we show how this leads to explainable performance. We demonstrate that the developed methodology outperforms related methods in terms of the size of the effective basis as well as individual quantum resources for the involved circuits.
References in corpus (38)
- SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
- Array Programming with NumPy
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- The theory of variational hybrid quantum-classical algorithms
- Noisy intermediate-scale quantum (NISQ) algorithms
- Recent developments in the PySCF program package
- The effect of data encoding on the expressive power of variational quantum machine learning models
- Hartree-Fock on a superconducting qubit quantum computer
- Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
- Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
- Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
- Qulacs: a fast and versatile quantum circuit simulator for research purpose
- Increasing the representation accuracy of quantum simulations of chemistry without extra quantum resources
- A Non-Orthogonal Variational Quantum Eigensolver
- Qubit-excitation-based adaptive variational quantum eigensolver
- Decoding quantum errors with subspace expansions
- Quantum Power Method by a Superposition of Time-Evolved States
- Generalized quantum subspace expansion
- Orbital-optimized pair-correlated electron simulations on trapped-ion quantum computers
- Exact and efficient Lanczos method on a quantum computer
- A Feasible Approach for Automatically Differentiable Unitary Coupled-Cluster on Quantum Computers
- Quantum Filter Diagonalization with Double-Factorized Hamiltonians
- Tequila: A platform for rapid development of quantum algorithms
- A theory of quantum subspace diagonalization
- Quantum inverse iteration algorithm for programmable quantum simulators
- Iterative Quantum Assisted Eigensolver
- Simulating quantum chemistry in the seniority-zero space on qubit-based quantum computers
- Reducing qubit requirements while maintaining numerical precision for the Variational Quantum Eigensolver: A Basis-Set-Free Approach
- Conceptual understanding through efficient inverse-design of quantum optical experiments
- Chemistry on quantum computers with virtual quantum subspace expansion
- Optimized Low-Depth Quantum Circuits for Molecular Electronic Structure using a Separable Pair Approximation
- Computation of molecular excited states on IBM quantum computers using a discriminative variational quantum eigensolver
- Multidimensional Fourier series with quantum circuits
- Quantum Computer-Aided design of Quantum Optics Hardware
- Molecular Quantum Circuit Design: A Graph-Based Approach
- Compact wavefunctions from compressed imaginary time evolution
- AGP-based unitary coupled cluster theory for quantum computers
Cited by in corpus (4)
- A Hybrid Qubit Encoding: Splitting Fock Space into Fermionic and Bosonic Subspaces
- Connections between Richardson-Gaudin States, Perfect-Pairing, and Pair Coupled-Cluster Theory
- State Specific Measurement Protocols for the Variational Quantum Eigensolver
- Gradient Scalability and Taylor Surrogation of Quantum Cost Landscapes