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

From Projected Subspaces to Full-Space Implementations: Representation-Equivalence Audits for Open-Shell ADAPT-VQE

Lucia Malíčková, Petr Klenovský

quant-phSubmitted Sep 28, 2026• Announced Sep 30, 2026• 0 citations
arXivHTMLPDF

Abstract

A variational state optimized in a symmetry-projected space need not be the state prepared by exponentiating the corresponding unprojected parent generators. For an orthogonal target-space projector $P$, $Q=I-P$, and an anti-Hermitian generator $A$, exact equivalence for all amplitudes requires target-space invariance, $QAP=0$. We formulate this condition as a representation-equivalence audit for open-shell ADAPT-VQE. For a canonical CAS(15e,9o) type-1 Cu(II) Hamiltonian, 274 of 323 bare Hartree--Fock-origin single, double, and triple excitations violate this condition. Projected-doublet ADAPT reaches 1.5719 m$E_h$ with 121 operators, whereas the same amplitudes in the corresponding full-space sequence give 464.730 m$E_h$ error, 0.07343 fidelity with the projected state, and 54.45\% quartet weight. Reoptimizing the same 121 parent generators in the same order under the hard constraint $p_D\ge0.999$ reduces the best converged error to 8.482 m$E_h$, showing that the catastrophic same-angle failure is primarily a representation/parameter-transfer failure but is not completely repaired by full-space reoptimization of the fixed sequence. An independent 12-qubit NO benchmark exhibits the same mechanism more mildly. A spin-preserving generalized full-space construction removes the representation ambiguity and reaches 1.493 and 1.181 m$E_h$ at 18 and 24 qubits. For the 18-qubit positive control, selectively refining only four Suzuki-2 factors and re-transpiling with a fixed compiler seed passes the predeclared circuit-equivalence gate at 19,660 controlled-X (CX) gates and depth 23,016. Circuit synthesis and final-energy measurement therefore constitute separate validation layers. The contribution is a validation framework, not a new spin-adapted ADAPT algorithm.

AI Summary

The paper asks when an ADAPT-VQE state optimized in a symmetry-projected space is actually prepared by exponentiating the corresponding unprojected parent generators with the same amplitudes. For an orthogonal projector $P$, $Q=I-P$, and anti-Hermitian generator $A$, it establishes that reduced-space evolution equals compressed parent evolution for every amplitude iff $QAP=0$. It also derives finite-amplitude leakage bounds and a state-specific telescoping fidelity certificate. Exact determinant-space simulations quantify the mismatch. For Cu CAS(15e,9o), 274 of 323 bare single, double, and triple excitations violate invariance. Projected-doublet ADAPT reaches 1.5719 m$E_h$ error with 121 operators; transferring its amplitudes to the parent sequence gives 464.730 m$E_h$ error, 0.07343 fidelity with the projected state, and 54.45% quartet weight. Full-space reoptimization of that fixed sequence under $p_D\ge0.999$ reduces the best converged error to 8.482 m$E_h$. An independent NO benchmark shows a milder mismatch: 1.4286 versus 24.537 m$E_h$. Generalized spin-preserving pools provide positive controls, reaching 1.493 and 1.181 m$E_h$ at 18 and 24 qubits, with reduced/full-space agreement to numerical precision. A selectively refined Suzuki circuit for the 18-qubit state meets specified fidelity, energy, and spin tolerances using 19,660 CX gates and depth 23,016. The contribution is an audit framework, not a new spin-adapted algorithm. Exact projectors are small-system validation tools; molecular models are not chemically converged. Optimization results are local, compilation costs exclude device connectivity, and measurement estimates exclude adaptive optimization and noise.

Little sign of AI-generated textIncrementalUnclear novelty

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

Comments
6 pages, 2 figures, 2 tables; 36-page supplementary material supplied as an ancillary PDF. Submitted to The Journal of Chemical Physics

Related papers

Adaptive construction of shallower quantum circuits with quantum spin projection for fermionic systems

Takashi Tsuchimochi, Masaki Taii, Taisei Nishimaki +1 more

Quantum computing is a promising approach to harnessing strong correlation in molecular systems; however, current devices only allow for hybrid quantum-classical algorithms with a shallow circuit depth, such as the variational quantum eigensolver (VQE). In this paper, we report the importance of the Hamiltonian symmetry in constructing VQE circuits adaptively (ADAPT-VQE). This treatment often violates symmetry, thereby deteriorating the convergence of fidelity to the exact solution and ultimately resulting in deeper circuits. We demonstrate that spin-symmetry projection can provide a simple yet effective solution to this problem, by keeping the quantum state in the correct symmetry space, to reduce the overall gate operations. To further investigate the role of spin-symmetry in computing molecular properties with ADAPT-VQE, we have derived the analytical derivative of symmetry-projected VQE energy. Our illustrative calculations reveal the significance of preserving symmetry in providing accurate dipole moments and geometries with variational approximations.

arXiv:2205.07097•Physical Review Research•Aug 4, 2022•26 citations

Symmetry-Preserving and Scalable Variational Circuits for the Lattice Gross-Neveu Model

Vivan Bhatt, Zhongtian Dong, Kyoungchul Kong +1 more

We study variational preparation of ground states and sector-resolved excited states in the $(1+1)$-dimensional lattice Gross-Neveu model. We construct fixed circuits preserving either total fermion number or every flavor number, and a problem-specific scalable-circuit adaptive variational quantum eigensolver (SC-ADAPT-VQE). Classical circuit benchmarks cover massless and massive systems through 30 qubits, using exact-diagonalization and tensor-network reference results. Imposing flavor-number conservation improves the achieved energies in the completed two-flavor comparisons. Selected massive fixed-ansatz benchmarks with one to four flavors have relative energy errors of approximately $1 \times 10^{-5}$ - $2 \times 10^{-4}$, smaller than the quoted literature errors where available, although discretizations and computational resources differ. The adaptive pool combines translated bulk and boundary-sensitive generators with an interaction-sensitive cross-flavor family. Selected massive SC-ADAPT benchmarks with one to three flavors have relative energy errors below $2.1 \times 10^{-3}$. For one flavor, matrix-product-state evaluations extend the transferred circuits to 60-400 qubits without target-side operator selection or parameter optimization, giving energy deviations of approximately $0.35\%$ - $1.76\%$ from density-matrix renormalization-group reference values at maximum bond dimension 256. At fixed flavor number, range caps, and append count, the adaptive construction has a precompilation local-factor count linear in volume and a volume-independent shared-parameter count; fixed-accuracy performance at arbitrary volumes remains unestablished. Sequential deflation also prepares low-lying states within a fixed flavor-number sector, with projector fidelities providing a basis-independent assessment of degenerate target eigenspaces.

hep-phCross-listedarXiv:2610.30270•Oct 23, 2026•0 citations

Full-Spectrum Quantum Simulation for the Nuclear Shell Model

B. Maheshwari, P. Stevenson, P. Van Isacker

The nuclear shell model is a general way of expressing the many-body nuclear Hamiltonian and deciphering the underlying nuclear structure. In today's era of modern and high-power computation, the primary limitation of the nuclear shell model is the enormous dimensionality of its Hilbert space, which far exceeds available storage capacity and prevents the diagonalization of the full Hamiltonian matrix in that space. Quantum computing offers a scalable solution to bypass this curse of dimensionality. In this work, we introduce a single-run quantum simulation capable of obtaining multiple shell-model eigenstates simultaneously. The nuclear Hamiltonian is transformed from a bit to a qubit basis using the Jordan-Wigner transformation, explicitly preserving fermionic anti-commutation. We employ a Subspace Search Variational Quantum Eigensolver (SSVQE) along with an Adaptive Derivative-Assembled Pseudo-Trotter (ADAPT) ansatz to construct the quantum circuit required to solve the shell-model problem. The ADAPT-SSVQE algorithm uses a symmetry-preserving single and double-excitation operator pool and optimizes a weighted energy sum to obtain the simultaneous convergence of all eigenstates within a targeted MJ subspace, eliminating the need for post-processing efforts to extract excited spectra. We benchmark this approach by solving the problem for two and three identical nucleons in a j = 9/2 orbital, successfully extracting five and ten mutually orthogonal states, respectively, within a 10-qubit active space. The algorithm achieves spectroscopic accuracy, in simulation, relative to exact diagonalization and intrinsically restores total angular momentum (\hat{J}^2) symmetry.

nucl-thCross-listedarXiv:2607.08235•Jul 10, 2026•0 citations

Symmetry-adapted qubit encoding with complete active space and Bravyi--Kitaev mapping for quantum chemistry on a quantum computer

Dario Picozzi, Jonathan Tennyson

We present a symmetry-adapted qubit encoding with complete active space (SAE-CAS) for quantum chemistry on fault-tolerant and near-term quantum processors. Building on exact-symmetry encodings, we extend symmetry-adapted mappings to approximate $Z$-symmetries corresponding to frozen-core and virtual orbitals, thereby reducing qubit requirements without significant loss of accuracy. We derive the mapping from the second-quantised Hamiltonian to active-space qubit Hamiltonians, prove its equivalence to the canonical CAS Hamiltonian with frozen-core and virtual-orbital projection, and integrate it with point-group and spin-parity symmetry encodings via affine Clifford transformations to maximise qubit reduction while preserving the target symmetry sector. The same framework also accommodates the Bravyi--Kitaev mapping, yielding an SAE-CAS-BK variant that is unitarily equivalent to SAE-CAS. Numerical benchmarking on nine small molecules using UCCSD and a hardware-efficient shifted-circular-alternating (HE-SCA) ansatz shows that SAE-CAS reduces qubit counts and Pauli-operator weight, yields shallower circuits with fewer parameters, and often accelerates VQE convergence; with HE-SCA it consistently reaches CAS reference energies in cases where JW-CAS does not converge within the tested budgets. We provide an open-source implementation in the Python package QuantumSymmetry. SAE-CAS offers a route to resource-efficient molecular simulations on fault-tolerant and near-term quantum processors.

quant-pharXiv:2606.05865•Jun 5, 2026•3 citations

Training-free operator selection for quantum circuit construction from a heterogeneous-graph representation

Li Hao, Chaoqun Ji, Mengbo Fu

Abstract Automated construction of variational quantum circuits remains a major bottleneck in quantum chemistry, largely because adaptive VQE methods repeatedly screen large operator pools using quantum-gradient criteria. For a canonical Hartree–Fock reference and normalized double-excitation generators, the initial ADAPT gradient magnitude is exactly the corresponding antisymmetrized two-electron Hamiltonian coupling. We encode this static signal as an excitation-edge feature of a heterogeneous graph, enabling a training-free classical ranking without current-state candidate-gradient measurements. Across statevector benchmarks from eight to twenty qubits, incremental construction reaches chemical accuracy with operator counts close to full gradient-based selection while avoiding repeated quantum screening. Supervised and residual models are used as controls to test whether learned corrections improve this low-cost rule. Static learned readouts provide no consistent held-out advantage, whereas state-conditioned features improve selected teacher-forced ranking metrics but require additional information and do not establish a closed-loop reduction in operator count. As a complementary higher-rank contribution, we derive an exact shared-residual formulation that reduces Hamiltonian applications for triple- and quadruple-excitation screening from 2 C or C + 1 to one while preserving all scores and rankings. Results on stretched H 6 and N 2 benchmarks show that these higher-rank operators can repair a singles-and-doubles expressivity limit.

Quantum Science and Technology•Sep 28, 2026•0 citations

A Reproducible Pipeline for Symmetry-Respecting Excited States on Near-Term Quantum Computers: The H2O/STO-3G Case

Huajing Song

Variational excited-state quantum algorithms fail for reasons usually studied in isolation: barren plateaus, symmetry contamination, finite-sampling instability, and hardware cost. Using one small but complete system -- H$_2$O in the STO-3G basis (12 qubits, Jordan--Wigner) -- we assemble these into a single reproducible pipeline, checking every claim against exact diagonalization. The bare qubit Hamiltonian interleaves cation ($N{=}7$) states below the neutral manifold; hardware-efficient and number-conserving ansätze stall at Hartree--Fock, an exact stationary point by Brillouin's theorem, while ADAPT-VQE escapes; variational deflation inherits the contamination and inverts the spectrum, whereas the quantum equation-of-motion (qEOM) subspace method restores the ladder to sub-milli-Hartree accuracy. Particle number is protected \emph{structurally} under shot noise, and a realistic measurement model collapses the thousands of subspace matrix elements to $\sim\!10^5$ commuting groups; a matrix-aware shot allocation then reaches chemical accuracy at $\sim\!3\times10^9$ total shots -- a thousandfold below the naive per-element estimate and reachable in days -- leaving single-circuit gate fidelity, not measurement, as the binding constraint. This work is a teaching and benchmarking reference, not a new method; all code, parameters, and figures are released.

quant-pharXiv:2606.28130•Jun 29, 2026•0 citations
A variational state optimized in a symmetry-projected space need not be the state prepared by exponentiating the corresponding unprojected parent generators. For an orthogonal target-space projector PPP, Q=I−PQ=I-PQ=I−P, and an anti-Hermitian generator AAA, exact equivalence for all amplitudes requires target-space invariance, QAP=0QAP=0QAP=0. We formulate this condition as a representation-equivalence audit for open-shell ADAPT-VQE. For a canonical CAS(15e,9o) type-1 Cu(II) Hamiltonian, 274 of 323 bare Hartree--Fock-origin single, double, and triple excitations violate this condition. Projected-doublet ADAPT reaches 1.5719 mEhE_hEh​ with 121 operators, whereas the same amplitudes in the corresponding full-space sequence give 464.730 mEhE_hEh​ error, 0.07343 fidelity with the projected state, and 54.45% quartet weight. Reoptimizing the same 121 parent generators in the same order under the hard constraint pD≥0.999p_D\ge0.999pD​≥0.999 reduces the best converged error to 8.482 mEhE_hEh​, showing that the catastrophic same-angle failure is primarily a representation/parameter-transfer failure but is not completely repaired by full-space reoptimization of the fixed sequence. An independent 12-qubit NO benchmark exhibits the same mechanism more mildly. A spin-preserving generalized full-space construction removes the representation ambiguity and reaches 1.493 and 1.181 mEhE_hEh​ at 18 and 24 qubits. For the 18-qubit positive control, selectively refining only four Suzuki-2 factors and re-transpiling with a fixed compiler seed passes the predeclared circuit-equivalence gate at 19,660 controlled-X (CX) gates and depth 23,016. Circuit synthesis and final-energy measurement therefore constitute separate validation layers. The contribution is a validation framework, not a new spin-adapted ADAPT algorithm.
The paper asks when an ADAPT-VQE state optimized in a symmetry-projected space is actually prepared by exponentiating the corresponding unprojected parent generators with the same amplitudes. For an orthogonal projector PPP, Q=I−PQ=I-PQ=I−P, and anti-Hermitian generator AAA, it establishes that reduced-space evolution equals compressed parent evolution for every amplitude iff QAP=0QAP=0QAP=0. It also derives finite-amplitude leakage bounds and a state-specific telescoping fidelity certificate.
Exact determinant-space simulations quantify the mismatch. For Cu CAS(15e,9o), 274 of 323 bare single, double, and triple excitations violate invariance. Projected-doublet ADAPT reaches 1.5719 mEhE_hEh​ error with 121 operators; transferring its amplitudes to the parent sequence gives 464.730 mEhE_hEh​ error, 0.07343 fidelity with the projected state, and 54.45% quartet weight. Full-space reoptimization of that fixed sequence under pD≥0.999p_D\ge0.999pD​≥0.999 reduces the best converged error to 8.482 mEhE_hEh​. An independent NO benchmark shows a milder mismatch: 1.4286 versus 24.537 mEhE_hEh​.
Generalized spin-preserving pools provide positive controls, reaching 1.493 and 1.181 mEhE_hEh​ at 18 and 24 qubits, with reduced/full-space agreement to numerical precision. A selectively refined Suzuki circuit for the 18-qubit state meets specified fidelity, energy, and spin tolerances using 19,660 CX gates and depth 23,016.
The contribution is an audit framework, not a new spin-adapted algorithm. Exact projectors are small-system validation tools; molecular models are not chemically converged. Optimization results are local, compilation costs exclude device connectivity, and measurement estimates exclude adaptive optimization and noise.
Quantum computing is a promising approach to harnessing strong correlation in molecular systems; however, current devices only allow for hybrid quantum-classical algorithms with a shallow circuit depth, such as the variational quantum eigensolver (VQE). In this paper, we report the importance of the Hamiltonian symmetry in constructing VQE circuits adaptively (ADAPT-VQE). This treatment often violates symmetry, thereby deteriorating the convergence of fidelity to the exact solution and ultimately resulting in deeper circuits. We demonstrate that spin-symmetry projection can provide a simple yet effective solution to this problem, by keeping the quantum state in the correct symmetry space, to reduce the overall gate operations. To further investigate the role of spin-symmetry in computing molecular properties with ADAPT-VQE, we have derived the analytical derivative of symmetry-projected VQE energy. Our illustrative calculations reveal the significance of preserving symmetry in providing accurate dipole moments and geometries with variational approximations.
We study variational preparation of ground states and sector-resolved excited states in the (1+1)(1+1)(1+1)-dimensional lattice Gross-Neveu model. We construct fixed circuits preserving either total fermion number or every flavor number, and a problem-specific scalable-circuit adaptive variational quantum eigensolver (SC-ADAPT-VQE). Classical circuit benchmarks cover massless and massive systems through 30 qubits, using exact-diagonalization and tensor-network reference results. Imposing flavor-number conservation improves the achieved energies in the completed two-flavor comparisons. Selected massive fixed-ansatz benchmarks with one to four flavors have relative energy errors of approximately 1×10−51 \times 10^{-5}1×10−5 - 2×10−42 \times 10^{-4}2×10−4, smaller than the quoted literature errors where available, although discretizations and computational resources differ. The adaptive pool combines translated bulk and boundary-sensitive generators with an interaction-sensitive cross-flavor family. Selected massive SC-ADAPT benchmarks with one to three flavors have relative energy errors below 2.1×10−32.1 \times 10^{-3}2.1×10−3. For one flavor, matrix-product-state evaluations extend the transferred circuits to 60-400 qubits without target-side operator selection or parameter optimization, giving energy deviations of approximately 0.35%0.35\%0.35% - 1.76%1.76\%1.76% from density-matrix renormalization-group reference values at maximum bond dimension 256. At fixed flavor number, range caps, and append count, the adaptive construction has a precompilation local-factor count linear in volume and a volume-independent shared-parameter count; fixed-accuracy performance at arbitrary volumes remains unestablished. Sequential deflation also prepares low-lying states within a fixed flavor-number sector, with projector fidelities providing a basis-independent assessment of degenerate target eigenspaces.
The nuclear shell model is a general way of expressing the many-body nuclear Hamiltonian and deciphering the underlying nuclear structure. In today's era of modern and high-power computation, the primary limitation of the nuclear shell model is the enormous dimensionality of its Hilbert space, which far exceeds available storage capacity and prevents the diagonalization of the full Hamiltonian matrix in that space. Quantum computing offers a scalable solution to bypass this curse of dimensionality. In this work, we introduce a single-run quantum simulation capable of obtaining multiple shell-model eigenstates simultaneously. The nuclear Hamiltonian is transformed from a bit to a qubit basis using the Jordan-Wigner transformation, explicitly preserving fermionic anti-commutation. We employ a Subspace Search Variational Quantum Eigensolver (SSVQE) along with an Adaptive Derivative-Assembled Pseudo-Trotter (ADAPT) ansatz to construct the quantum circuit required to solve the shell-model problem. The ADAPT-SSVQE algorithm uses a symmetry-preserving single and double-excitation operator pool and optimizes a weighted energy sum to obtain the simultaneous convergence of all eigenstates within a targeted MJ subspace, eliminating the need for post-processing efforts to extract excited spectra. We benchmark this approach by solving the problem for two and three identical nucleons in a j = 9/2 orbital, successfully extracting five and ten mutually orthogonal states, respectively, within a 10-qubit active space. The algorithm achieves spectroscopic accuracy, in simulation, relative to exact diagonalization and intrinsically restores total angular momentum (\hat{J}^2) symmetry.
We present a symmetry-adapted qubit encoding with complete active space (SAE-CAS) for quantum chemistry on fault-tolerant and near-term quantum processors. Building on exact-symmetry encodings, we extend symmetry-adapted mappings to approximate ZZZ-symmetries corresponding to frozen-core and virtual orbitals, thereby reducing qubit requirements without significant loss of accuracy. We derive the mapping from the second-quantised Hamiltonian to active-space qubit Hamiltonians, prove its equivalence to the canonical CAS Hamiltonian with frozen-core and virtual-orbital projection, and integrate it with point-group and spin-parity symmetry encodings via affine Clifford transformations to maximise qubit reduction while preserving the target symmetry sector. The same framework also accommodates the Bravyi--Kitaev mapping, yielding an SAE-CAS-BK variant that is unitarily equivalent to SAE-CAS. Numerical benchmarking on nine small molecules using UCCSD and a hardware-efficient shifted-circular-alternating (HE-SCA) ansatz shows that SAE-CAS reduces qubit counts and Pauli-operator weight, yields shallower circuits with fewer parameters, and often accelerates VQE convergence; with HE-SCA it consistently reaches CAS reference energies in cases where JW-CAS does not converge within the tested budgets. We provide an open-source implementation in the Python package QuantumSymmetry. SAE-CAS offers a route to resource-efficient molecular simulations on fault-tolerant and near-term quantum processors.
Abstract Automated construction of variational quantum circuits remains a major bottleneck in quantum chemistry, largely because adaptive VQE methods repeatedly screen large operator pools using quantum-gradient criteria. For a canonical Hartree–Fock reference and normalized double-excitation generators, the initial ADAPT gradient magnitude is exactly the corresponding antisymmetrized two-electron Hamiltonian coupling. We encode this static signal as an excitation-edge feature of a heterogeneous graph, enabling a training-free classical ranking without current-state candidate-gradient measurements. Across statevector benchmarks from eight to twenty qubits, incremental construction reaches chemical accuracy with operator counts close to full gradient-based selection while avoiding repeated quantum screening. Supervised and residual models are used as controls to test whether learned corrections improve this low-cost rule. Static learned readouts provide no consistent held-out advantage, whereas state-conditioned features improve selected teacher-forced ranking metrics but require additional information and do not establish a closed-loop reduction in operator count. As a complementary higher-rank contribution, we derive an exact shared-residual formulation that reduces Hamiltonian applications for triple- and quadruple-excitation screening from 2 C or C + 1 to one while preserving all scores and rankings. Results on stretched H 6 and N 2 benchmarks show that these higher-rank operators can repair a singles-and-doubles expressivity limit.
Variational excited-state quantum algorithms fail for reasons usually studied in isolation: barren plateaus, symmetry contamination, finite-sampling instability, and hardware cost. Using one small but complete system -- H2_22​O in the STO-3G basis (12 qubits, Jordan--Wigner) -- we assemble these into a single reproducible pipeline, checking every claim against exact diagonalization. The bare qubit Hamiltonian interleaves cation (N=7N{=}7N=7) states below the neutral manifold; hardware-efficient and number-conserving ansätze stall at Hartree--Fock, an exact stationary point by Brillouin's theorem, while ADAPT-VQE escapes; variational deflation inherits the contamination and inverts the spectrum, whereas the quantum equation-of-motion (qEOM) subspace method restores the ladder to sub-milli-Hartree accuracy. Particle number is protected \emph{structurally} under shot noise, and a realistic measurement model collapses the thousands of subspace matrix elements to ∼ ⁣105\sim\!10^5∼105 commuting groups; a matrix-aware shot allocation then reaches chemical accuracy at ∼ ⁣3×109\sim\!3\times10^9∼3×109 total shots -- a thousandfold below the naive per-element estimate and reachable in days -- leaving single-circuit gate fidelity, not measurement, as the binding constraint. This work is a teaching and benchmarking reference, not a new method; all code, parameters, and figures are released.