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:2610.01954

Hardware-Efficient Ground-State Preparation using Variational Imaginary-Time Majorana Evolution

Federico Santona, Manuel G. Algaba, Aeishah Ameera Anuar, Anna M. Wernbacher, Prachi Sharma, Fedor Šimkovic

quant-phphysics.chem-phSubmitted Oct 1, 2026• Announced Oct 2, 2026• 0 citations
arXivHTMLPDF

Abstract

Compact ground-state preparation circuits are essential for early fault-tolerant quantum chemistry. We introduce Variational Imaginary-time Majorana Evolution (VIME), a classical pre-training algorithm that extends operator-projected variational quantum imaginary-time evolution (OVQITE) to molecular electronic structure using a single compiled Majorana-propagation (MP) surrogate graph. We pair VIME with a compressed tiled Unitary Product State (c-tUPS) ansatz that we develop to reduce both classical simulation and quantum state-preparation costs. In the strongly correlated ruthenium complex TLD-1411, active-space calculations requiring up to 52 qubits achieve chemical precision against DMRG reference energies, with energy errors approximately $400\times$ smaller than those from ADAPT-VQE-based variational Majorana-propagation (ADAPT-VMPE). Across the strongly multireference acene series up to heptacene (60 qubits), VIME matches or improves on the MP-reported energy accuracy of the ADAPT-VMPE comparison points with up to $26\times$ fewer CNOTs and $167\times$ lower two-qubit depth. These results establish imaginary-time classical pre-training of compressed variational ansätze as a promising route to resource-efficient molecular ground-state preparation.

AI Summary

The paper asks whether classical pre-training can produce compact molecular ground-state circuits without optimization exploiting errors in a truncated simulator. Variational Imaginary-time Majorana Evolution (VIME) combines operator-projected VQITE with Majorana propagation (MP). A single compiled Hamiltonian-propagation graph supplies pool expectations, approximate anticommutators, and parameter derivatives through backward and forward traversals, avoiding separate propagation for every observable. The accompanying compressed tiled Unitary Product State (c-tUPS) ansatz uses four rather than eight length-four Majorana rotations per tile and compiles to 10 CNOTs per tile under all-to-all connectivity. Exact-statevector tests on hydrogen chains assess truncation errors and optimization behavior. For one-layer H$_8$ circuits, VIME reaches median ground-state overlap approximately $0.96$, versus $0.79$ for direct MP-energy minimization, which develops large negative surrogate-energy biases. Larger benchmarks compare MP-reported energies with DMRG references. Selected 1.5-layer TLD-1411 circuits reach errors of $1.284$, $0.825$, and $0.021\,\mathrm{m}E_h$ at 28, 40, and 52 qubits, using 200–380 CNOTs and two-qubit depth 24. Acene benchmarks through 60 qubits use $3.3$–$26\times$ fewer CNOTs and $36$–$167\times$ lower depth than the chosen ADAPT-VMPE comparison points, with comparable allocated CPU-hours. Large-system results lack independent circuit-energy or overlap validation; MP energies are not variational bounds. Neither method reaches chemical precision for the acenes. Reported endpoints select favorable runs, optimization can become trapped, and classical cost is dominated by Jacobian evaluation. Existing random-circuit MP accuracy guarantees do not cover the structured ansatz; additional truncations are needed for the largest calculations.

Little sign of AI-generated textOverclaimsMissing comparison

Central claim may not hold: The abstract's chemical-precision ground-state-preparation claim at 52 qubits and approximately 400-fold energy-error improvement are supported only by truncated MP surrogate energies, without independent validation or error bounds establishing the actual prepared circuit's energy accuracy.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
52 pages, 28 figures, 16 tables

Related papers

Qubit-Adaptive Variational Quantum Imaginary Time Evolution: A Resource-Efficient Algorithm for Ground-State Preparation of Correlated Molecules on Near-Term Quantum Computers

Thitiwuth Chaiyatho, Zhenyu Li, Jin‐Shi Xu +2 more

Preparing ground states of correlated molecules on near-term quantum computers requires algorithms that are both accurate and resource-efficient. We introduce the qubit-adaptive variational quantum imaginary time evolution (QAITE) algorithm, which synthesizes the systematic convergence of imaginary-time evolution with hardware-efficient, adaptive ansatz construction. By integrating the linear-scaling qubit operator pool into the adaptive variational quantum imaginary time evolution framework, QAITE deterministically constructs a compact ansatz without costly classical optimization loops. Numerical simulations for molecular systems (H4, LiH, H2O, BeH2), benchmarked against our own implementations of established adaptive algorithms under identical conditions, show that QAITE achieves chemical accuracy with a 15-45% reduction in CNOT gates compared to the standard adaptive variational quantum imaginary time evolution (AVQITE) method. For hydrogen chains (RHH = 1.5 Å, N = 6-16 qubits), QAITE's circuit complexity grows approximately quadratically and remains the lowest of the four methods at every system size, reaching 31% fewer CNOT gates than AVQITE at 16 qubits─a saving of 1322 gates. This efficiency extends to heterogeneous (LiH)n and (HBe)n chains, where QAITE maintains a CNOT gate ratio below 1 for all sizes studied (e.g., 0.81 for (LiH)2). We further show that the deterministic parameter update is numerically robust: the results are insensitive to the regularization of the quantum geometric tensor over at least 4 orders of magnitude, and chemical accuracy is retained under realistic shot noise applied to both the quantum geometric tensor and the force vector. By outperforming established adaptive algorithms in both absolute gate count and scaling, QAITE establishes a promising, scalable pathway for quantum molecular simulations on noisy intermediate-scale quantum devices.

Journal of Chemical Theory and Computation•Sep 26, 2026•0 citations

Scalable quantum circuit generation for iterative ground state approximation using Majorana Propagation

Rahul Chakraborty, Aaron Miller, Anton Nykänen +6 more

We introduce the Adaptive Derivative-Assembled Pseudo-Trotter ansatz Variational Majorana Propagation Eigensolver (ADAPT-VMPE), a quantum-inspired classical algorithm that exploits Majorana Propagation (MP) to produce circuits for approximating the ground state of molecular Hamiltonians. Equipped with the theoretical guarantees of MP, which provide controllable bounds on the approximation error, ADAPT-VMPE offers an efficient and scalable approach for iterative ansatz construction. A theoretical analysis of the computational complexity demonstrates that it is polynomial in both the number of qubits and the number of iterations. We present an in-depth analysis of circuit construction strategies, analyzing their impact on convergence and provide practical guidance for efficient ansatz generation. Using ADAPT-VMPE, we construct up to 100-qubit ansätze for a strongly correlated photosensitizer currently undergoing human clinical trials for cancer treatment. Our results demonstrate that constant overlap with the ground state across system sizes can be reached in polynomial time with polynomially sized circuits.

quant-pharXiv:2603.23444•Mar 25, 2026•8 citations

Adaptive Variational Quantum Imaginary Time Evolution Approach for Ground State Preparation

Niladri Gomes, Anirban Mukherjee, Feng Zhang +5 more

Abstract An adaptive variational quantum imaginary time evolution (AVQITE) approach is introduced that yields efficient representations of ground states for interacting Hamiltonians on near‐term quantum computers. It is based on McLachlan's variational principle applied to imaginary time evolution of variational wave functions. The variational parameters evolve deterministically according to equations of motions that minimize the difference to the exact imaginary time evolution, which is quantified by the McLachlan distance. Rather than working with a fixed variational ansatz, where the McLachlan distance is constrained by the quality of the ansatz, the AVQITE method iteratively expands the ansatz along the dynamical path to keep the McLachlan distance below a chosen threshold. This ensures the state is able to follow the quantum imaginary time evolution path in the system Hilbert space rather than in a restricted variational manifold set by a predefined fixed ansatz. AVQITE is used to prepare ground states of H 4 , H 2 O, and BeH 2 molecules, where it yields compact variational ansätze and ground state energies within chemical accuracy. Polynomial scaling of circuit depth with system size is shown through a set of AVQITE calculations of quantum spin models. Finally, quantum Lanczos calculations are demonstrated alongside AVQITE without additional quantum resource costs.

arXiv:2102.01544•Advanced Quantum Technologies•Oct 29, 2021•101 citations

Sparse-QITE: Discovering Compact Generators for Quantum Imaginary-Time Evolution via Regularization Methods

Rafael Gómez-Lurbe, Luca Ion, Alberto Acevedo +1 more

Quantum imaginary-time evolution (QITE) provides a systematic route to ground-state preparation, but its cost grows rapidly with the locality $D$ of the unitary approximation, for which the local Pauli basis scales as $4^D$. We introduce Sparse-QITE, a regularized formulation that promotes compact generators, reducing the number of quantum operations and yielding circuits with fewer gates and lower depth. We derive rigorous bounds on the sparsification error and benchmark the method in one-dimensional transverse-field Ising and antiferromagnetic Heisenberg models. Sparse-QITE exhibits a controllable sparsity--accuracy trade-off while retaining strong compression even in the high-accuracy regime. In scalability experiments with respect to $D$, the active support grows much more slowly than in standard QITE and, in several regimes, approximately saturates over the domain sizes studied. After circuit construction and transpilation, some of the largest-domain cases require only about $1\%$ of the standard-QITE gate count while maintaining high accuracy. We further introduce adaptive and active-discovery variants: the former selects the regularization strength dynamically during the evolution, while the latter reduces the number of Pauli expectation values that need to be evaluated and, consequently, the measurement requirements. These results establish sparsity-promoting regularization as a route toward more resource-efficient QITE. More broadly, these results suggest that sparsity-promoting regularization may also benefit variational quantum algorithms.

quant-pharXiv:2610.20791•Oct 16, 2026•0 citations

Generating approximate ground states of strongly correlated quantum many-body systems through quantum imaginary time evolution

Michael Kaicher, Florian Dommert, Christopher Wever +3 more

Abstract Most quantum algorithms designed to generate or probe properties of the ground state of a quantum many-body system require as input an initial state with a large overlap with the desired ground state. One approach for preparing such a ground state is Imaginary Time Evolution (ITE). Recent work by [Motta, M. , Sun, C. , Tan, A.T.K. et al (2020)] introduced an algorithm—which we will refer to as Quantum Imaginary Time Evolution (QITE)—that shows how ITE can be approximated by a sequence of unitary operators, making QITE potentially implementable on early fault-tolerant quantum computers. In this work, we provide a heuristic study of the capabilities of the QITE algorithm in approximating the ITE of lattice and molecular electronic structure Hamiltonians. We numerically study the performance of the QITE algorithm when provided with a good classical initial state for a large class of systems, some of which are of interest to industrial applications, and check if QITE is able to qualitatively replicate the ITE behavior and improve over a classical mean-field solution. The systems we consider in this work range from one- and two-dimensional lattice systems of various lattice geometries displaying short- and long-range interactions, to active spaces of molecular electronic structure Hamiltonians. In addition to the comparison of QITE and ITE, we explicitly show how imaginary time evolved fermionic Gaussian states can serve as initial states which can be efficiently computed on classical computers and efficiently implemented on quantum computers for generic spin Hamiltonians in arbitrary lattice geometries and dimensions, which can be of independent interest.

arXiv:2409.01320•Journal of Physics Communications•Jun 23, 2025•1 citation

Classical reservoir approach for efficient molecular ground state preparation

Zekun He, Dominika Zgid, A. F. Kemper +1 more

Ground state preparation is a central application of quantum algorithms for electronic structure. We introduce the classical reservoir approach, a low cost variational ansatz tailored to near-term hardware, requiring only nearest-neighbor interactions on a machine with square-lattice connectivity. Unlike traditional methods built from the classically efficient Hartree Fock theory, our ansatz operates in localized molecular orbitals to study previously unexplored regions of the variational parameter space. Numerical benchmarks demonstrate chemical accuracy across diverse systems and bond lengths; notably, significantly reduced circuit depths are attainable when relaxed error thresholds (e.g., tens of E_h) are permissible. We benchmark the method on hydrogen chains, N_2, O_2, CO, BeH_2, and H_2O, the latter corresponding to an effective 24 qubit calculation.

quant-pharXiv:2512.21069•Dec 25, 2025•1 citation
Compact ground-state preparation circuits are essential for early fault-tolerant quantum chemistry. We introduce Variational Imaginary-time Majorana Evolution (VIME), a classical pre-training algorithm that extends operator-projected variational quantum imaginary-time evolution (OVQITE) to molecular electronic structure using a single compiled Majorana-propagation (MP) surrogate graph. We pair VIME with a compressed tiled Unitary Product State (c-tUPS) ansatz that we develop to reduce both classical simulation and quantum state-preparation costs. In the strongly correlated ruthenium complex TLD-1411, active-space calculations requiring up to 52 qubits achieve chemical precision against DMRG reference energies, with energy errors approximately 400×400\times400× smaller than those from ADAPT-VQE-based variational Majorana-propagation (ADAPT-VMPE). Across the strongly multireference acene series up to heptacene (60 qubits), VIME matches or improves on the MP-reported energy accuracy of the ADAPT-VMPE comparison points with up to 26×26\times26× fewer CNOTs and 167×167\times167× lower two-qubit depth. These results establish imaginary-time classical pre-training of compressed variational ansätze as a promising route to resource-efficient molecular ground-state preparation.
The paper asks whether classical pre-training can produce compact molecular ground-state circuits without optimization exploiting errors in a truncated simulator. Variational Imaginary-time Majorana Evolution (VIME) combines operator-projected VQITE with Majorana propagation (MP). A single compiled Hamiltonian-propagation graph supplies pool expectations, approximate anticommutators, and parameter derivatives through backward and forward traversals, avoiding separate propagation for every observable. The accompanying compressed tiled Unitary Product State (c-tUPS) ansatz uses four rather than eight length-four Majorana rotations per tile and compiles to 10 CNOTs per tile under all-to-all connectivity.
Exact-statevector tests on hydrogen chains assess truncation errors and optimization behavior. For one-layer H8_88​ circuits, VIME reaches median ground-state overlap approximately 0.960.960.96, versus 0.790.790.79 for direct MP-energy minimization, which develops large negative surrogate-energy biases. Larger benchmarks compare MP-reported energies with DMRG references. Selected 1.5-layer TLD-1411 circuits reach errors of 1.2841.2841.284, 0.8250.8250.825, and 0.021 mEh0.021\,\mathrm{m}E_h0.021mEh​ at 28, 40, and 52 qubits, using 200–380 CNOTs and two-qubit depth 24. Acene benchmarks through 60 qubits use 3.33.33.3–26×26\times26× fewer CNOTs and 363636–167×167\times167× lower depth than the chosen ADAPT-VMPE comparison points, with comparable allocated CPU-hours.
Large-system results lack independent circuit-energy or overlap validation; MP energies are not variational bounds. Neither method reaches chemical precision for the acenes. Reported endpoints select favorable runs, optimization can become trapped, and classical cost is dominated by Jacobian evaluation. Existing random-circuit MP accuracy guarantees do not cover the structured ansatz; additional truncations are needed for the largest calculations.
Preparing ground states of correlated molecules on near-term quantum computers requires algorithms that are both accurate and resource-efficient. We introduce the qubit-adaptive variational quantum imaginary time evolution (QAITE) algorithm, which synthesizes the systematic convergence of imaginary-time evolution with hardware-efficient, adaptive ansatz construction. By integrating the linear-scaling qubit operator pool into the adaptive variational quantum imaginary time evolution framework, QAITE deterministically constructs a compact ansatz without costly classical optimization loops. Numerical simulations for molecular systems (H4, LiH, H2O, BeH2), benchmarked against our own implementations of established adaptive algorithms under identical conditions, show that QAITE achieves chemical accuracy with a 15-45% reduction in CNOT gates compared to the standard adaptive variational quantum imaginary time evolution (AVQITE) method. For hydrogen chains (RHH = 1.5 Å, N = 6-16 qubits), QAITE's circuit complexity grows approximately quadratically and remains the lowest of the four methods at every system size, reaching 31% fewer CNOT gates than AVQITE at 16 qubits─a saving of 1322 gates. This efficiency extends to heterogeneous (LiH)n and (HBe)n chains, where QAITE maintains a CNOT gate ratio below 1 for all sizes studied (e.g., 0.81 for (LiH)2). We further show that the deterministic parameter update is numerically robust: the results are insensitive to the regularization of the quantum geometric tensor over at least 4 orders of magnitude, and chemical accuracy is retained under realistic shot noise applied to both the quantum geometric tensor and the force vector. By outperforming established adaptive algorithms in both absolute gate count and scaling, QAITE establishes a promising, scalable pathway for quantum molecular simulations on noisy intermediate-scale quantum devices.
We introduce the Adaptive Derivative-Assembled Pseudo-Trotter ansatz Variational Majorana Propagation Eigensolver (ADAPT-VMPE), a quantum-inspired classical algorithm that exploits Majorana Propagation (MP) to produce circuits for approximating the ground state of molecular Hamiltonians. Equipped with the theoretical guarantees of MP, which provide controllable bounds on the approximation error, ADAPT-VMPE offers an efficient and scalable approach for iterative ansatz construction. A theoretical analysis of the computational complexity demonstrates that it is polynomial in both the number of qubits and the number of iterations. We present an in-depth analysis of circuit construction strategies, analyzing their impact on convergence and provide practical guidance for efficient ansatz generation. Using ADAPT-VMPE, we construct up to 100-qubit ansätze for a strongly correlated photosensitizer currently undergoing human clinical trials for cancer treatment. Our results demonstrate that constant overlap with the ground state across system sizes can be reached in polynomial time with polynomially sized circuits.
Abstract An adaptive variational quantum imaginary time evolution (AVQITE) approach is introduced that yields efficient representations of ground states for interacting Hamiltonians on near‐term quantum computers. It is based on McLachlan's variational principle applied to imaginary time evolution of variational wave functions. The variational parameters evolve deterministically according to equations of motions that minimize the difference to the exact imaginary time evolution, which is quantified by the McLachlan distance. Rather than working with a fixed variational ansatz, where the McLachlan distance is constrained by the quality of the ansatz, the AVQITE method iteratively expands the ansatz along the dynamical path to keep the McLachlan distance below a chosen threshold. This ensures the state is able to follow the quantum imaginary time evolution path in the system Hilbert space rather than in a restricted variational manifold set by a predefined fixed ansatz. AVQITE is used to prepare ground states of H 4 , H 2 O, and BeH 2 molecules, where it yields compact variational ansätze and ground state energies within chemical accuracy. Polynomial scaling of circuit depth with system size is shown through a set of AVQITE calculations of quantum spin models. Finally, quantum Lanczos calculations are demonstrated alongside AVQITE without additional quantum resource costs.
Quantum imaginary-time evolution (QITE) provides a systematic route to ground-state preparation, but its cost grows rapidly with the locality DDD of the unitary approximation, for which the local Pauli basis scales as 4D4^D4D. We introduce Sparse-QITE, a regularized formulation that promotes compact generators, reducing the number of quantum operations and yielding circuits with fewer gates and lower depth. We derive rigorous bounds on the sparsification error and benchmark the method in one-dimensional transverse-field Ising and antiferromagnetic Heisenberg models. Sparse-QITE exhibits a controllable sparsity--accuracy trade-off while retaining strong compression even in the high-accuracy regime. In scalability experiments with respect to DDD, the active support grows much more slowly than in standard QITE and, in several regimes, approximately saturates over the domain sizes studied. After circuit construction and transpilation, some of the largest-domain cases require only about 1%1\%1% of the standard-QITE gate count while maintaining high accuracy. We further introduce adaptive and active-discovery variants: the former selects the regularization strength dynamically during the evolution, while the latter reduces the number of Pauli expectation values that need to be evaluated and, consequently, the measurement requirements. These results establish sparsity-promoting regularization as a route toward more resource-efficient QITE. More broadly, these results suggest that sparsity-promoting regularization may also benefit variational quantum algorithms.
Abstract Most quantum algorithms designed to generate or probe properties of the ground state of a quantum many-body system require as input an initial state with a large overlap with the desired ground state. One approach for preparing such a ground state is Imaginary Time Evolution (ITE). Recent work by [Motta, M. , Sun, C. , Tan, A.T.K. et al (2020)] introduced an algorithm—which we will refer to as Quantum Imaginary Time Evolution (QITE)—that shows how ITE can be approximated by a sequence of unitary operators, making QITE potentially implementable on early fault-tolerant quantum computers. In this work, we provide a heuristic study of the capabilities of the QITE algorithm in approximating the ITE of lattice and molecular electronic structure Hamiltonians. We numerically study the performance of the QITE algorithm when provided with a good classical initial state for a large class of systems, some of which are of interest to industrial applications, and check if QITE is able to qualitatively replicate the ITE behavior and improve over a classical mean-field solution. The systems we consider in this work range from one- and two-dimensional lattice systems of various lattice geometries displaying short- and long-range interactions, to active spaces of molecular electronic structure Hamiltonians. In addition to the comparison of QITE and ITE, we explicitly show how imaginary time evolved fermionic Gaussian states can serve as initial states which can be efficiently computed on classical computers and efficiently implemented on quantum computers for generic spin Hamiltonians in arbitrary lattice geometries and dimensions, which can be of independent interest.
Ground state preparation is a central application of quantum algorithms for electronic structure. We introduce the classical reservoir approach, a low cost variational ansatz tailored to near-term hardware, requiring only nearest-neighbor interactions on a machine with square-lattice connectivity. Unlike traditional methods built from the classically efficient Hartree Fock theory, our ansatz operates in localized molecular orbitals to study previously unexplored regions of the variational parameter space. Numerical benchmarks demonstrate chemical accuracy across diverse systems and bond lengths; notably, significantly reduced circuit depths are attainable when relaxed error thresholds (e.g., tens of E_h) are permissible. We benchmark the method on hydrogen chains, N_2, O_2, CO, BeH_2, and H_2O, the latter corresponding to an effective 24 qubit calculation.