Sparse Quantum State Preparation for Strongly Correlated Systems

Abstract

Quantum Computing allows, in principle, the encoding of the exponentially scaling many-electron wave function onto a linearly scaling qubit register, offering a promising solution to overcome the limitations of traditional quantum chemistry methods. An essential requirement for ground state quantum algorithms to be practical is the initialisation of the qubits to a high-quality approximation of the sought-after ground state. Quantum State Preparation (QSP) allows the preparation of approximate eigenstates obtained from classical calculations, but it is frequently treated as an oracle in quantum information. In this study, we conduct QSP on the ground state of prototypical strongly correlated systems, up to 28 qubits, using the Hyperion GPU-accelerated state-vector emulator. Various variational and non-variational methods are compared in terms of their circuit depth and classical complexity. Our results indicate that the recently developed Overlap-ADAPT-VQE algorithm offers the most advantageous performance for near-term applications.

References in corpus (28)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Quantum algorithm for solving linear systems of equations
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Barren plateaus in quantum neural network training landscapes
• Noisy intermediate-scale quantum (NISQ) algorithms
• Simulated Quantum Computation of Molecular Energies
• The Variational Quantum Eigensolver: a review of methods and best practices
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Hamiltonian Simulation by Qubitization
• Quantum measurements and the Abelian Stabilizer Problem
• Simulation of Electronic Structure Hamiltonians Using Quantum Computers
• qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
• Quantum-state preparation with universal gate decompositions
• Is there evidence for exponential quantum advantage in quantum chemistry?
• Creating superpositions that correspond to efficiently integrable probability distributions
• Efficient Symmetry-Preserving State Preparation Circuits for the Variational Quantum Eigensolver Algorithm
• A divide-and-conquer algorithm for quantum state preparation
• Quantum Package 2.0: An Open-Source Determinant-Driven Suite of Programs
• Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications
• Qubit-excitation-based adaptive variational quantum eigensolver
• Efficient quantum circuits for quantum computational chemistry
• Overlap-ADAPT-VQE: Practical Quantum Chemistry on Quantum Computers via Overlap-Guided Compact Ansätze
• Quantum algorithms for approximate function loading
• Double sparse quantum state preparation
• Improving quantum measurements by introducing "ghost" Pauli products
• Low-rank quantum state preparation
• State Preparation Boosters for Early Fault-Tolerant Quantum Computation

Cited by in corpus (6)

• Polylogarithmic-depth controlled-NOT gates without ancilla qubits
• Shortcut to Chemically Accurate Quantum Computing via Density-based Basis-set Correction
• Greedy Gradient-free Adaptive Variational Quantum Algorithms on a Noisy Intermediate Scale Quantum Computer
• Quantum State Preparation Of Multiconfigurational States For Quantum Chemistry
• Quantum Encoding of Structured Data with Matrix Product States
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions