Hybrid Quantum-Classical Clustering for Preparing a Prior Distribution of Eigenspectrum

Abstract

Determining the energy gap in a quantum many-body system is critical to understanding its behavior and is important in quantum chemistry and condensed matter physics. The challenge of determining the energy gap requires identifying both the excited and ground states of a system. In this work, we consider preparing the prior distribution and circuits for the eigenspectrum of time-independent Hamiltonians, which can benefit both classical and quantum algorithms for solving eigenvalue problems. The proposed algorithm unfolds in three strategic steps: Hamiltonian transformation, parameter representation, and classical clustering. These steps are underpinned by two key insights: the use of quantum circuits to approximate the ground state of transformed Hamiltonians and the analysis of parameter representation to distinguish between eigenvectors. The algorithm is showcased through applications to the 1D Heisenberg system and the LiH molecular system, highlighting its potential for both near-term quantum devices and fault-tolerant quantum devices. The paper also explores the scalability of the method and its performance across various settings, setting the stage for more resource-efficient quantum computations that are both accurate and fast. The findings presented here mark a new insight into hybrid algorithms, offering a pathway to overcoming current computational challenges.

add fig.3

References in corpus (41)

• A variational eigenvalue solver on a quantum processor
• Quantum algorithm for solving linear systems of equations
• Variational Quantum Algorithms
• Barren plateaus in quantum neural network training landscapes
• Quantum computational chemistry
• Quantum Chemistry in the Age of Quantum Computing
• Simulated Quantum Computation of Molecular Energies
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• The Variational Quantum Eigensolver: a review of methods and best practices
• Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
• Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
• Variational ansatz-based quantum simulation of imaginary time evolution
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• Direct Fidelity Estimation from Few Pauli Measurements
• Quantum measurements and the Abelian Stabilizer Problem
• Quantum Natural Gradient
• Variational Quantum Computation of Excited States
• Why does deep and cheap learning work so well?
• The Expressive Power of Parameterized Quantum Circuits
• Subspace-search variational quantum eigensolver for excited states
• To Cluster, or Not to Cluster: An Analysis of Clusterability Methods
• Undecidability of the Spectral Gap (short version)
• Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications
• Hamiltonian complexity
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits
• Quantum Krylov subspace algorithms for ground and excited state energy estimation
• Quantum Power Method by a Superposition of Time-Evolved States
• Exploring the Advantages of Quantum Generative Adversarial Networks in Generative Chemistry
• Exact and efficient Lanczos method on a quantum computer
• Quantum inverse iteration algorithm for programmable quantum simulators
• Dimensional Expressivity Analysis of Parametric Quantum Circuits
• Quantum computation of silicon electronic band structure
• Improved algorithms of quantum imaginary time evolution for ground and excited states of molecular systems
• Margolus-Levitin quantum speed limit for an arbitrary fidelity
• Lowering Tomography Costs in Quantum Simulation with a Symmetry Projected Operator Basis
• Projective Quantum Phase Difference Estimation Algorithm for the Direct Computation of Eigenenergy Gaps on a Quantum Computer
• Scalable Quantum Computation of Highly Excited Eigenstates with Spectral Transforms
• A Gell-Mann & Low Theorem Perspective on Quantum Computing: New Paradigm for Designing Quantum Algorithm