Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions

Abstract

Determining low-energy eigenstates in electronic many-body quantum systems is a key challenge in computational chemistry and condensed-matter physics. Hybrid quantum-classical approaches, such as the Variational Quantum Eigensolver and Quantum Subspace Methods, offer practical solutions but face limitations in circuit depth and measurement overhead. In this article, we propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for the extraction of low-lying energy states. We show that, under certain conditions, our approach leads to a tridiagonal representation similar to that obtained with the Lanczos algorithm. The iterative process allows control over the trade-off between circuit depth, the number of variational parameters, and the number of measurements required to achieve the desired accuracy, making it suitable for current quantum hardware. As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.

References in corpus (66)

• 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
• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum computational chemistry
• Simulated Quantum Computation of Molecular Energies
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Scalable Quantum Simulation of Molecular Energies
• Quantum algorithms for quantum chemistry and quantum materials science
• Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
• Variational ansatz-based quantum simulation of imaginary time evolution
• Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
• Robust determination of molecular spectra on a quantum processor
• Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
• Training variational quantum algorithms is NP-hard
• qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
• An initialization strategy for addressing barren plateaus in parametrized quantum circuits
• Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
• Efficient Symmetry-Preserving State Preparation Circuits for the Variational Quantum Eigensolver Algorithm
• From transistor to trapped-ion computers for quantum chemistry
• Barren Plateaus in Variational Quantum Computing
• Exact Parameterization of Fermionic Wave Functions via Unitary Coupled Cluster Theory
• Quantum equation of motion for computing molecular excitation energies on a noisy quantum processor
• Sequential minimal optimization for quantum-classical hybrid algorithms
• Increasing the representation accuracy of quantum simulations of chemistry without extra quantum resources
• Is the Trotterized UCCSD Ansatz chemically well-defined?
• Quantum Orbital-Optimized Unitary Coupled Cluster Methods in the Strongly Correlated Regime: Can Quantum Algorithms Outperform their Classical Equivalents?
• A Non-Orthogonal Variational Quantum Eigensolver
• Gate-efficient simulation of molecular eigenstates on a quantum computer
• Quantum Solver of Contracted Eigenvalue Equations for Scalable Molecular Simulations on Quantum Computing Devices
• Quantum Krylov subspace algorithms for ground and excited state energy estimation
• Real time evolution for ultracompact Hamiltonian eigenstates on quantum hardware
• Symmetry-adapted variational quantum eigensolver
• Generalized quantum subspace expansion
• Exact and efficient Lanczos method on a quantum computer
• Quantum Filter Diagonalization with Double-Factorized Hamiltonians
• On the practical usefulness of the Hardware Efficient Ansatz
• A theory of quantum subspace diagonalization
• Quantum inverse iteration algorithm for programmable quantum simulators
• Iterative Quantum Assisted Eigensolver
• Overlap-ADAPT-VQE: Practical Quantum Chemistry on Quantum Computers via Overlap-Guided Compact Ansätze
• Simulating periodic systems on quantum computer
• TETRIS-ADAPT-VQE: An adaptive algorithm that yields shallower, denser circuit ansätze
• Chemistry on quantum computers with virtual quantum subspace expansion
• Real-Time Krylov Theory for Quantum Computing Algorithms
• Symmetry breaking/symmetry preserving circuits and symmetry restoration on quantum computers: A quantum many-body perspective
• Challenges in the use of quantum computing hardware-efficient Ansatze in electronic structure theory
• Householder transformed density matrix functional embedding theory
• Sparse Quantum State Preparation for Strongly Correlated Systems
• AGP-based unitary coupled cluster theory for quantum computers
• Polylogarithmic-depth controlled-NOT gates without ancilla qubits
• A stochastic quantum Krylov protocol with double factorized Hamiltonians
• Analysis of quantum Krylov algorithms with errors
• Analyzing variational quantum landscapes with information content
• Quantum embedding of multi-orbital fragments using the Block-Householder-transformation
• Physically motivated improvements of Variational Quantum Eigensolvers
• Avoiding Barren Plateaus with Entanglement
• Measurement-efficient quantum Krylov subspace diagonalisation
• Quantum Information Driven Ansatz (QIDA): shallow-depth empirical quantum circuits from Quantum Chemistry
• Quantum subspace expansion in the presence of hardware noise
• Unitary transformations within density matrix embedding approaches: A novel perspective on the self-consistent scheme for electronic structure calculation
• Quantum subspace expansion approach for simulating dynamical response functions of Kitaev spin liquids
• Recursive relations and quantum eigensolver algorithms within modified Schrieffer--Wolff transformations for the Hubbard dimer
• Classical Benchmarks for Variational Quantum Eigensolver Simulations of the Hubbard Model
• A versatile unitary transformation framework for an optimal bath construction in density-matrix based quantum embedding approaches