Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2512.12753

Basis Adaptive Algorithm for Quantum Many-Body Systems on Quantum Computers

Anutosh Biswas, Sayan Ghosh, Ritajit Majumdar, Mostafizur Rahaman Laskar, Nicholas Bronn, Manoranjan Kumar

cond-mat.str-elquant-phSubmitted Dec 14, 2025• Announced Dec 16, 2025• 0 citations• Revised Jul 15, 2026 (v2)
v1 · Dec 14, 2025v2 · Jul 15, 2026
arXivHTMLPDF

Abstract

We introduce a Basis Adaptive (BA) algorithm for hybrid quantum-classical simulation of correlated quantum many-body systems. Starting from a small set of physically motivated bitstrings, the algorithm iteratively applies a single-step first-order Trotterized circuit on a quantum processor, filters the sampled configurations by enforcing $U(1)$ spin conservation and lattice reflection symmetry, and classically diagonalizes the Hamiltonian in the resulting reduced Hilbert space. This design avoids the variational optimization overhead of VQE, the deep coherent circuits required by QPE, and the symmetry-violating subspaces that arise in SKQD. The ground-state energy error is bounded analytically by $\sqrt{8}\,\|H\|\left(1-\sqrt{α_{D_T}}\right)^{1/2}$, where $α_{D_T}$ is the probability weight captured by the $D_T$ sampled basis states. This bound connects algorithm performance directly to ground-state sparsity and explains the observed accuracy hierarchy across different phases. Benchmarked on the spin-$1/2$ Heisenberg XXZ chain (up to $N=62$ qubits on the IBM Heron processor), the algorithm achieves a $3.5\%$ energy error in the gapped Neel phase ($Δ=2.0$) and below $0.5\%$ at the ferromagnetic boundary ($Δ=-1.0$). The accuracy degrades to $28.7\%$ in the strongly quasi-long-range-ordered regime ($Δ=0.5$). Spin-spin correlation functions are reproduced across all regimes, confirming that symmetry-filtered real-time sampling provides a practical and noise-resilient pathway to ground-state properties on near-term quantum hardware.

Comments
16 pages, 7 figures

Related papers

Hybrid Quantum-Classical Algorithms for Quantum Computing Applications in Computational Physics

Julian Schuhmacher

Computational methods are central to modern physics, yet many problems, especially those involving Quantum Many-Body Systems (QMBSs), remain challenging at scale. The core difficulty of simulating QMBSs is the exponential growth of the solution space with system size. This renders exact treatments intractable and pushes approximate methods to their limits when tackling two- and higher-dimensional systems and long-time dynamics. Quantum computers offer a quantum-native platform for representing and manipulating such systems. Recent algorithmic and technological advancements have enabled experiments on quantum processors in the quantum utility regime, a scale at which exact classical reproduction is no longer feasible. This represents the first step towards realizing quantum advantage, where quantum computers solve specific, practically relevant problems more efficiently than any classical approach. While advancing towards the goal of quantum advantage, useful computations on quantum processors are expected to be realised through hybrid quantum-classical algorithms, which combine quantum experiments and classical computational resources. A prominent example are variational quantum algorithms, where a Parametrized Quantum Circuit (PQC) prepares a trial quantum state whose parameters are iteratively updated by a classical optimisation routine to minimize a target cost function (e.g., the energy of a target Hamiltonian). However, the optimisation of such PQCs is affected by trainability issues, such as barren plateaus in the parameter landscape, which can render the optimisation increasingly difficult for larger system sizes. This motivates the development of novel hybrid approaches overcoming the limits of PQCs. In this thesis, we introduce a new class of approaches based on hybrid Tensor Networks (TNs). A hybrid TN is obtained by integrating quantum states prepared on a quantum processor within TNs -- one of the state-of-the-art approaches for simulating quantum systems. We first show how hybrid TNs can be used for ground-state searches within a variational setting. Then, we further extend the framework to non-variational hybrid TN ansätze for which the quantum tensors are prepared via quantum annealing and subsequently post-processed by classical TNs. In the context of quantum machine learning, which also relies on PQCs, we further investigate heuristic best practices that mitigate the same exponential concentration effects in kernel-based models for anomaly detection. Another class of hybrid algorithms are quantum error-mitigation workflows, where classical post-processing is used to reconstruct expectation values from noise-affected circuit executions. Such methods generally feature a trade-off between the bias and the variance: the price to pay for mitigating noise in a bias-free fashion is that the number of measurements usually grows exponentially with the depth of the circuit in order to achieve a fixed accuracy. In this thesis, we develop a low-resource error-mitigation strategy that reduces the measurement overhead in practical digital Hamiltonian-simulation workflows. We apply this method to Trotterized dynamics in a lattice-gauge-theory model, enabling the extraction of expectation values with improved accuracy at time-scales that allow the observation of post-collision scattering dynamics.

•Jan 1, 2026•0 citations

Filter-assisted quantum subspace diagonalization via wavefunction sparsity engineering

Han Xu, Tomonori Shirakawa, Seiji Yunoki

Subspace diagonalization techniques based on quantum sampling, such as quantum selected configuration interaction (QSCI) and sample-based quantum diagonalization (SQD), have recently emerged as promising quantum-centric approaches for approximating ground-state energies of many-body systems. However, their performance is fundamentally limited by an intrinsic trade-off between sampling efficiency and the sparsity of the ground-state wavefunction, which becomes particularly severe in strongly correlated systems. Here, we introduce a filter-assisted SQD protocol that engineers wavefunction sparsity via a quantum filter, i.e., a unitary transformation of the Hamiltonian designed to concentrate the ground-state weight onto a small number of computational basis states. Using the Gini coefficient as a robust sparsity measure, we establish a quantitative relationship between wavefunction sparsity and the resource requirements of SQD, providing theoretical bounds on the required subspace dimension and sampling cost. To realize the quantum filter, we employ a tensor-network-based circuit-encoding algorithm that maps target states to quantum circuits with controllable fidelity. We benchmark our approach on the quantum Ising model with transverse and longitudinal fields using both numerical simulations and quantum hardware experiments. Our results demonstrate that, compared with standard SQD, the proposed protocol significantly enhances wavefunction sparsity, reduces ground-state energy estimation errors by orders of magnitude, and substantially lowers sampling overhead. These findings establish filter-assisted subspace diagonalization as a powerful and scalable framework for quantum many-body calculations in the strongly correlated regime.

quant-pharXiv:2605.28040•May 28, 2026•3 citations

Symmetry-adapted sample-based quantum diagonalization: Application to lattice model

Kosuke Nogaki, Steffen Backes, Tomonori Shirakawa +2 more

We present a symmetry-adapted extension of sample-based quantum diagonalization (SQD) that rigorously embeds space-group symmetry into the many-body subspace sampled by quantum hardware. The method is benchmarked on the two-leg ladder Hubbard model using both molecular orbital and momentum bases. Energy convergence is shown to be improved in the momentum basis compared to the molecular orbital basis for both the spin-quintet ground state and the spin-singlet excited state. We clarify the relationship between the compactness of the many-body wave function and the sparsity of the representation matrices of symmetry operations. Furthermore, the enhancement of the superconducting correlation function due to the Coulomb interaction is demonstrated. Our method highlights the importance of symmetry structure in random-sampling quantum simulation of correlated systems

arXiv:2505.00914•May 1, 2025•11 citations

Qubit-efficient encoding scheme for quantum simulations of electronic structure

Yu Shee, Pei-Kai Tsai, Cheng-Lin Hong +2 more

Simulating electronic structure on a quantum computer requires encoding of fermionic systems onto qubits. Common encoding methods transform a fermionic system of $N$ spin-orbitals into an $N$-qubit system, but many of the fermionic configurations do not respect the required conditions and symmetries of the system so the qubit Hilbert space in this case may have unphysical states and thus cannot be fully utilized. We propose a generalized qubit-efficient encoding (QEE) scheme that requires the qubit number to be only logarithmic in the number of configurations that satisfy the required conditions and symmetries. For the case of considering only the particle-conserving and singlet configurations, we reduce the qubit count to an upper bound of $\mathcal{O}(m{log}_{2}N)$, where $m$ is the number of particles. This QEE scheme is demonstrated on an ${\mathrm{H}}_{2}$ molecule in the 6-31G basis set and a $\mathrm{LiH}$ molecule in the STO-3G basis set using fewer qubits than the common encoding methods. We calculate the ground-state energy surfaces using a variational quantum eigensolver algorithm with a hardware-efficient ansatz circuit. We choose to use a hardware-efficient ansatz since most of the Hilbert space in our scheme is spanned by desired configurations so a heuristic search for an eigenstate is sensible. The simulations are performed on IBM Quantum machines and the Qiskit simulator with a noise model implemented from a IBM Quantum machine. Using the methods of measurement error mitigation and error-free linear extrapolation, we demonstrate that most of the distributions of the extrapolated energies using our QEE scheme agree with the exact results obtained by Hamiltonian diagonalization in the given basis sets within chemical accuracy. Our proposed scheme and results show the feasibility of quantum simulations for larger molecular systems in the noisy intermediate-scale quantum (NISQ) era. The number of terms in the Hamiltonian has an upper bound of $\mathcal{O}(\frac{{N}^{2m+1}}{(m\ensuremath{-}1)!\phantom{\rule{0.16em}{0ex}}m!})$ for the QEE scheme while it scales as $\mathcal{O}({N}^{4})$ for the Jordan-Wigner encoding scheme. Nevertheless, we present several cases where QEE is useful.

arXiv:2110.04112•Physical Review Research•May 27, 2022•53 citations

Quantum algorithm for weakly correlated molecular electronic ground states with sub-quintic scaling in the system size

Oskar Leimkuhler, Marvin Kronenberger, Davide Castaldo +8 more

Weakly correlated electronic structures are predominant among molecules, and are routinely solved with heuristic classical methods such as the ``gold standard'' CCSD(T) coupled cluster model, incurring a formal time complexity $O(n^7)$ in the number of molecular orbitals and with no guarantee of energy error $\varepsilon$ at or below chemical accuracy. In this work, a quantum algorithm is presented for ground state energy estimation of weakly correlated molecules using Trotterized time evolution, with an end-to-end quantum operations cost that scales as $\tilde{O}(n^{4.8}/\varepsilon^2)$ in the limit of high-order product formulae when run as a low-depth, shot-noise limited algorithm, or $\tilde{O}(n^{4.8} + n^{3.8}/\varepsilon)$ when scaling the simulation time $T\propto 1/\varepsilon$. The algorithm combines adiabatic state preparation using a smoothed Gevrey schedule with eigenstate filtering via quantum prolate diagonalization (QPD). Both steps of the algorithm rely on a size-independent spectral gap assumption, which is validated by numerical studies on alanine chains with up to 64 monomers. We benchmark the performance of our eigenstate filtering algorithm on a set of 28 molecules to compare our approach against prior phase estimation algorithms, finding that QPD achieves state-of-the-art cost tradeoffs for $\varepsilon$-accurate results. Physical quantum resource estimates are obtained for running Trotter step circuits with up to 40 spin-orbitals, providing a clear path for scaling up quantum simulation of chemistry on early fault-tolerant hardware.

quant-pharXiv:2611.00751•Nov 3, 2026•0 citations

Spin coupling is all you need: Encoding strong electron correlation in molecules on quantum computers

Daniel Marti-Dafcik, Hugh G. A. Burton, David P. Tew

The performance of quantum algorithms for eigenvalue problems, such as computing Hamiltonian spectra, depends strongly on the overlap of the initial wave function and the target eigenvector. In a basis of Slater determinants, the representation of energy eigenstates of systems with N strongly correlated electrons requires a number of determinants that scales exponentially with N . On classical processors, this restricts simulations to systems where N is small. Here, we show that quantum computers can efficiently simulate strongly correlated molecular systems by directly encoding the dominant entanglement structure in the form of spin-coupled initial states. This avoids resorting to expensive classical or quantum state preparation heuristics and instead exploits symmetries in the wave function. We provide quantum circuits for deterministic preparation of a family of spin eigenfunctions with ( N N / 2 ) Slater determinants with depth O ( N ) and O ( N 2 ) local gates. Their use as highly entangled initial states in quantum algorithms reduces the total runtime of quantum phase estimation and related fault-tolerant methods by orders of magnitude. Furthermore, we assess the application of spin-coupled wave functions as initial states for a range of heuristic quantum algorithms, namely, the variational quantum eigensolver, adiabatic state preparation, and different versions of quantum subspace diagonalization (QSD) including QSD based on real-time-evolved states. We also propose a QSD algorithm that exploits states obtained through adaptive quantum eigensolvers. For all algorithms, we demonstrate that using spin-coupled initial states drastically reduces the quantum resources required to simulate strongly correlated ground and excited states. Our work provides a crucial component for enabling scalable quantum simulation of classically challenging electronic systems.

arXiv:2404.18878•Physical Review Research•Feb 24, 2025•20 citations
We introduce a Basis Adaptive (BA) algorithm for hybrid quantum-classical simulation of correlated quantum many-body systems. Starting from a small set of physically motivated bitstrings, the algorithm iteratively applies a single-step first-order Trotterized circuit on a quantum processor, filters the sampled configurations by enforcing U(1)U(1)U(1) spin conservation and lattice reflection symmetry, and classically diagonalizes the Hamiltonian in the resulting reduced Hilbert space. This design avoids the variational optimization overhead of VQE, the deep coherent circuits required by QPE, and the symmetry-violating subspaces that arise in SKQD. The ground-state energy error is bounded analytically by 8 ∥H∥(1−αDT)1/2\sqrt{8}\,\|H\|\left(1-\sqrt{α_{D_T}}\right)^{1/2}8​∥H∥(1−αDT​​​)1/2, where αDTα_{D_T}αDT​​ is the probability weight captured by the DTD_TDT​ sampled basis states. This bound connects algorithm performance directly to ground-state sparsity and explains the observed accuracy hierarchy across different phases. Benchmarked on the spin-1/21/21/2 Heisenberg XXZ chain (up to N=62N=62N=62 qubits on the IBM Heron processor), the algorithm achieves a 3.5%3.5\%3.5% energy error in the gapped Neel phase (Δ=2.0Δ=2.0Δ=2.0) and below 0.5%0.5\%0.5% at the ferromagnetic boundary (Δ=−1.0Δ=-1.0Δ=−1.0). The accuracy degrades to 28.7%28.7\%28.7% in the strongly quasi-long-range-ordered regime (Δ=0.5Δ=0.5Δ=0.5). Spin-spin correlation functions are reproduced across all regimes, confirming that symmetry-filtered real-time sampling provides a practical and noise-resilient pathway to ground-state properties on near-term quantum hardware.
Computational methods are central to modern physics, yet many problems, especially those involving Quantum Many-Body Systems (QMBSs), remain challenging at scale. The core difficulty of simulating QMBSs is the exponential growth of the solution space with system size. This renders exact treatments intractable and pushes approximate methods to their limits when tackling two- and higher-dimensional systems and long-time dynamics. Quantum computers offer a quantum-native platform for representing and manipulating such systems. Recent algorithmic and technological advancements have enabled experiments on quantum processors in the quantum utility regime, a scale at which exact classical reproduction is no longer feasible. This represents the first step towards realizing quantum advantage, where quantum computers solve specific, practically relevant problems more efficiently than any classical approach. While advancing towards the goal of quantum advantage, useful computations on quantum processors are expected to be realised through hybrid quantum-classical algorithms, which combine quantum experiments and classical computational resources. A prominent example are variational quantum algorithms, where a Parametrized Quantum Circuit (PQC) prepares a trial quantum state whose parameters are iteratively updated by a classical optimisation routine to minimize a target cost function (e.g., the energy of a target Hamiltonian). However, the optimisation of such PQCs is affected by trainability issues, such as barren plateaus in the parameter landscape, which can render the optimisation increasingly difficult for larger system sizes. This motivates the development of novel hybrid approaches overcoming the limits of PQCs. In this thesis, we introduce a new class of approaches based on hybrid Tensor Networks (TNs). A hybrid TN is obtained by integrating quantum states prepared on a quantum processor within TNs -- one of the state-of-the-art approaches for simulating quantum systems. We first show how hybrid TNs can be used for ground-state searches within a variational setting. Then, we further extend the framework to non-variational hybrid TN ansätze for which the quantum tensors are prepared via quantum annealing and subsequently post-processed by classical TNs. In the context of quantum machine learning, which also relies on PQCs, we further investigate heuristic best practices that mitigate the same exponential concentration effects in kernel-based models for anomaly detection. Another class of hybrid algorithms are quantum error-mitigation workflows, where classical post-processing is used to reconstruct expectation values from noise-affected circuit executions. Such methods generally feature a trade-off between the bias and the variance: the price to pay for mitigating noise in a bias-free fashion is that the number of measurements usually grows exponentially with the depth of the circuit in order to achieve a fixed accuracy. In this thesis, we develop a low-resource error-mitigation strategy that reduces the measurement overhead in practical digital Hamiltonian-simulation workflows. We apply this method to Trotterized dynamics in a lattice-gauge-theory model, enabling the extraction of expectation values with improved accuracy at time-scales that allow the observation of post-collision scattering dynamics.
Subspace diagonalization techniques based on quantum sampling, such as quantum selected configuration interaction (QSCI) and sample-based quantum diagonalization (SQD), have recently emerged as promising quantum-centric approaches for approximating ground-state energies of many-body systems. However, their performance is fundamentally limited by an intrinsic trade-off between sampling efficiency and the sparsity of the ground-state wavefunction, which becomes particularly severe in strongly correlated systems. Here, we introduce a filter-assisted SQD protocol that engineers wavefunction sparsity via a quantum filter, i.e., a unitary transformation of the Hamiltonian designed to concentrate the ground-state weight onto a small number of computational basis states. Using the Gini coefficient as a robust sparsity measure, we establish a quantitative relationship between wavefunction sparsity and the resource requirements of SQD, providing theoretical bounds on the required subspace dimension and sampling cost. To realize the quantum filter, we employ a tensor-network-based circuit-encoding algorithm that maps target states to quantum circuits with controllable fidelity. We benchmark our approach on the quantum Ising model with transverse and longitudinal fields using both numerical simulations and quantum hardware experiments. Our results demonstrate that, compared with standard SQD, the proposed protocol significantly enhances wavefunction sparsity, reduces ground-state energy estimation errors by orders of magnitude, and substantially lowers sampling overhead. These findings establish filter-assisted subspace diagonalization as a powerful and scalable framework for quantum many-body calculations in the strongly correlated regime.
We present a symmetry-adapted extension of sample-based quantum diagonalization (SQD) that rigorously embeds space-group symmetry into the many-body subspace sampled by quantum hardware. The method is benchmarked on the two-leg ladder Hubbard model using both molecular orbital and momentum bases. Energy convergence is shown to be improved in the momentum basis compared to the molecular orbital basis for both the spin-quintet ground state and the spin-singlet excited state. We clarify the relationship between the compactness of the many-body wave function and the sparsity of the representation matrices of symmetry operations. Furthermore, the enhancement of the superconducting correlation function due to the Coulomb interaction is demonstrated. Our method highlights the importance of symmetry structure in random-sampling quantum simulation of correlated systems
Simulating electronic structure on a quantum computer requires encoding of fermionic systems onto qubits. Common encoding methods transform a fermionic system of NNN spin-orbitals into an NNN-qubit system, but many of the fermionic configurations do not respect the required conditions and symmetries of the system so the qubit Hilbert space in this case may have unphysical states and thus cannot be fully utilized. We propose a generalized qubit-efficient encoding (QEE) scheme that requires the qubit number to be only logarithmic in the number of configurations that satisfy the required conditions and symmetries. For the case of considering only the particle-conserving and singlet configurations, we reduce the qubit count to an upper bound of O(mlog2N)\mathcal{O}(m{log}_{2}N)O(mlog2​N), where mmm is the number of particles. This QEE scheme is demonstrated on an H2{\mathrm{H}}_{2}H2​ molecule in the 6-31G basis set and a LiH\mathrm{LiH}LiH molecule in the STO-3G basis set using fewer qubits than the common encoding methods. We calculate the ground-state energy surfaces using a variational quantum eigensolver algorithm with a hardware-efficient ansatz circuit. We choose to use a hardware-efficient ansatz since most of the Hilbert space in our scheme is spanned by desired configurations so a heuristic search for an eigenstate is sensible. The simulations are performed on IBM Quantum machines and the Qiskit simulator with a noise model implemented from a IBM Quantum machine. Using the methods of measurement error mitigation and error-free linear extrapolation, we demonstrate that most of the distributions of the extrapolated energies using our QEE scheme agree with the exact results obtained by Hamiltonian diagonalization in the given basis sets within chemical accuracy. Our proposed scheme and results show the feasibility of quantum simulations for larger molecular systems in the noisy intermediate-scale quantum (NISQ) era. The number of terms in the Hamiltonian has an upper bound of $\mathcal{O}(\frac{{N}^{2m+1}}{(m\ensuremath{-}1)!\phantom{\rule{0.16em}{0ex}}m!})$ for the QEE scheme while it scales as O(N4)\mathcal{O}({N}^{4})O(N4) for the Jordan-Wigner encoding scheme. Nevertheless, we present several cases where QEE is useful.
Weakly correlated electronic structures are predominant among molecules, and are routinely solved with heuristic classical methods such as the ``gold standard'' CCSD(T) coupled cluster model, incurring a formal time complexity O(n7)O(n^7)O(n7) in the number of molecular orbitals and with no guarantee of energy error ε\varepsilonε at or below chemical accuracy. In this work, a quantum algorithm is presented for ground state energy estimation of weakly correlated molecules using Trotterized time evolution, with an end-to-end quantum operations cost that scales as O~(n4.8/ε2)\tilde{O}(n^{4.8}/\varepsilon^2)O~(n4.8/ε2) in the limit of high-order product formulae when run as a low-depth, shot-noise limited algorithm, or O~(n4.8+n3.8/ε)\tilde{O}(n^{4.8} + n^{3.8}/\varepsilon)O~(n4.8+n3.8/ε) when scaling the simulation time T∝1/εT\propto 1/\varepsilonT∝1/ε. The algorithm combines adiabatic state preparation using a smoothed Gevrey schedule with eigenstate filtering via quantum prolate diagonalization (QPD). Both steps of the algorithm rely on a size-independent spectral gap assumption, which is validated by numerical studies on alanine chains with up to 64 monomers. We benchmark the performance of our eigenstate filtering algorithm on a set of 28 molecules to compare our approach against prior phase estimation algorithms, finding that QPD achieves state-of-the-art cost tradeoffs for ε\varepsilonε-accurate results. Physical quantum resource estimates are obtained for running Trotter step circuits with up to 40 spin-orbitals, providing a clear path for scaling up quantum simulation of chemistry on early fault-tolerant hardware.
The performance of quantum algorithms for eigenvalue problems, such as computing Hamiltonian spectra, depends strongly on the overlap of the initial wave function and the target eigenvector. In a basis of Slater determinants, the representation of energy eigenstates of systems with N strongly correlated electrons requires a number of determinants that scales exponentially with N . On classical processors, this restricts simulations to systems where N is small. Here, we show that quantum computers can efficiently simulate strongly correlated molecular systems by directly encoding the dominant entanglement structure in the form of spin-coupled initial states. This avoids resorting to expensive classical or quantum state preparation heuristics and instead exploits symmetries in the wave function. We provide quantum circuits for deterministic preparation of a family of spin eigenfunctions with ( N N / 2 ) Slater determinants with depth O ( N ) and O ( N 2 ) local gates. Their use as highly entangled initial states in quantum algorithms reduces the total runtime of quantum phase estimation and related fault-tolerant methods by orders of magnitude. Furthermore, we assess the application of spin-coupled wave functions as initial states for a range of heuristic quantum algorithms, namely, the variational quantum eigensolver, adiabatic state preparation, and different versions of quantum subspace diagonalization (QSD) including QSD based on real-time-evolved states. We also propose a QSD algorithm that exploits states obtained through adaptive quantum eigensolvers. For all algorithms, we demonstrate that using spin-coupled initial states drastically reduces the quantum resources required to simulate strongly correlated ground and excited states. Our work provides a crucial component for enabling scalable quantum simulation of classically challenging electronic systems.