Partitioned Quantum Subspace Expansion
arXiv:2403.08868 · doi:10.22331/q-2025-05-05-1726
Abstract
We present an iterative generalisation of the quantum subspace expansion algorithm used with a Krylov basis. The iterative construction connects a sequence of subspaces via their lowest energy states. Diagonalising a Hamiltonian in a given Krylov subspace requires the same quantum resources in both the single step and sequential cases. We propose a variance-based criterion for determining a good iterative sequence and provide numerical evidence that these good sequences display improved numerical stability over a single step in the presence of finite sampling noise. Implementing the generalisation requires additional classical processing with a polynomial overhead in the subspace dimension. By exchanging quantum circuit depth for additional measurements the quantum subspace expansion algorithm appears to be an approach suited to near term or early error-corrected quantum hardware. Our work suggests that the numerical instability limiting the accuracy of this approach can be substantially alleviated in a parameter-free way.
14+15 pages, 12 figures, journal version
References in corpus (35)
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- Many body localization and thermalization in quantum statistical mechanics
- Error mitigation for short-depth quantum circuits
- Suppressing quantum errors by scaling a surface code logical qubit
- Logical quantum processor based on reconfigurable atom arrays
- Many-body localization edge in the random-field Heisenberg chain
- Hamiltonian Simulation by Qubitization
- Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
- Toward the first quantum simulation with quantum speedup
- The Bravyi-Kitaev transformation for quantum computation of electronic structure
- Quantum advantage in learning from experiments
- Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
- Variational quantum algorithms for nonlinear problems
- Solving nonlinear differential equations with differentiable quantum circuits
- A Non-Orthogonal Variational Quantum Eigensolver
- Exponential Error Suppression for Near-Term Quantum Devices
- Decoding quantum errors with subspace expansions
- Variational Quantum Fidelity Estimation
- Quantum Krylov subspace algorithms for ground and excited state energy estimation
- Quantum Power Method by a Superposition of Time-Evolved States
- Variational Quantum Algorithms for Computational Fluid Dynamics
- Real time evolution for ultracompact Hamiltonian eigenstates on quantum hardware
- Generalized quantum subspace expansion
- Exact and efficient Lanczos method on a quantum computer
- A theory of quantum subspace diagonalization
- Iterative Quantum Assisted Eigensolver
- Few-qubit quantum-classical simulation of strongly correlated lattice fermions
- Non-linear quantum-classical scheme to simulate non-equilibrium strongly correlated fermionic many-body dynamics
- Recompilation-enhanced simulation of electron-phonon dynamics on IBM Quantum computers
- Analysis of quantum Krylov algorithms with errors
- Sampling Error Analysis in Quantum Krylov Subspace Diagonalization
- Coarse grained intermolecular interactions on quantum processors
- Quantum subspace expansion in the presence of hardware noise
- Solving lattice gauge theories using the quantum Krylov algorithm and qubitization