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

• URL: http://arxiv.org/abs/2606.28130v1
• Date: Fri, 26 Jun 2026 14:30:39 GMT
• Title: A Reproducible Pipeline for Symmetry-Respecting Excited States on Near-Term Quantum Computers: The H2O/STO-3G Case
• Abstract summary: Variational excited-state quantum algorithms fail for reasons usually studied in isolation.<n>We assemble these into a single reproducible pipeline, checking every claim against exact diagonalization.<n>This work is a teaching and benchmarking reference, not a new method; all code, parameters, and figures are released.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: 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.

Related papers

• A quantum let within the lambda calculus [45.88028371034407]
  Since the work of Selinger and Valiron, the standard design for quantum calculi has kept the quantum state outside the program.<n>We show that tensor elimination is possible in this setting.<n>We illustrate the resulting compositionality through quantum teleportation and the three-qubit bit-flip code.
  arXiv  Detail & Related papers  (2026-08-29T17:38:37Z)
• Scalable Lindblad Noise Learning via Stochastic Tensor-Network Simulation [48.887627688666974]
  Learning dissipation rates in large-scale open quantum systems is a major obstacle for near-term quantum technologies.<n>Here, we propose a scalable noise-learning framework for Lindblad dissipation rates that combines a simulation method, the Jump Method (TJM)<n>We demonstrate the approach on two noise models in the Ising model, in which independent dissipation rates are learned for each site up to $N_mathrmsite=16$.<n>This combination of scalable numerics and rigorous theoretical guarantees positions TJM-based noise learning as a practical foundation for characterizing dissipation in large quantum devices.
  arXiv  Detail & Related papers  (2026-08-25T15:07:11Z)
• Dynamical spectral functions from bitstring-sampled quantum subspaces: entanglement, not one-body magic, tracks the sampling cost [0.0]
  We use a bitstring-sampling primitive to reconstruct quantum subspaces.<n>The reconstruction matches exact diagonalization on Hubbard chains and, for $A()$, across nineteen molecules.<n>We prove moment exactness and a sampling bound in $|mathcalS|$, independent of Hilbert-space dimension.
  arXiv  Detail & Related papers  (2026-08-17T11:35:16Z)
• Improved Measurement Cost Scaling in the Nonorthogonal Quantum Eigensolver [1.6328866317851187]
  We study a bottleneck for the nonorthogonal quantum eigensolver (NOQE)<n>We show that, after overlap thresholding, the eigenvalue sensitivity is controlled by the condition number of the retained overlap matrix.<n>Experiments on hydrogen chains and rings suggest that, in practice, the measurement cost of structured NOQE instances can grow even more slowly than this linear bound.
  arXiv  Detail & Related papers  (2026-08-13T05:05:55Z)
• Intrinsic Structure: Spectral Identifiability for Mechanistic Interpretability [51.56484100374058]
  We prove the first identifiability theorem for a mechanistic-interpretability primitive.<n>The spectrum is an identifiable, model-intrinsic fingerprint with a stated error bar, not a legible decomposition.
  arXiv  Detail & Related papers  (2026-08-10T19:42:01Z)
• Adaptive operator-generated subspaces for effective many-body Hamiltonians [0.0]
  We present the Adaptive Clifford-Algebra Subspacesolver (A-CASE)<n>Overlap, Hamiltonian, observable, and response matrices are reconstructed from one shared Pauli-expectation bank.<n>A grouped iteration propagates finite-shot variability through thresholding, root matching, spectral weights, susceptibility, and broadening.
  arXiv  Detail & Related papers  (2026-08-01T09:51:25Z)
• Fault-tolerant simulation of the electronic structure using Projector Augmented-Waves and Bloch orbitals [43.936586633107396]
  We present the Bloch--UPAW framework that combines Bloch-orbital $k$-space structure with unitary projector-augmented-wave augmentation.<n>We derive a linear-combination-of-unitaries decomposition and a block-encoding circuit suitable for qubitization.<n>Asymptotically, the Toffoli cost scales as $mathcalO(N_k3)$ when refining the $k$-mesh and as $mathcalO(N_a3.5)$ when enlarging the supercell.
  arXiv  Detail & Related papers  (2026-04-13T23:46:58Z)
• Error-structure-tailored early fault-tolerant quantum computing [2.824800547988445]
  In quantum algorithms, logical rotation gates $R_Z_L(varphi)$ serve as essential components.<n>In this work, we consider error-structure-tailored fault tolerance, where fault-tolerance conditions are analyzed.<n>We design 1-fault-tolerant continuous-angle rotation gates in stabilizer codes, implemented via dispersive-coupling Hamiltonians.
  arXiv  Detail & Related papers  (2025-11-25T06:51:46Z)
• ATLAS: Efficient Atom Rearrangement for Defect-Free Neutral-Atom Quantum Arrays Under Transport Loss [46.043413607980845]
  Neutral-atom quantum computers encode qubits in individually trapped atoms arranged in optical lattices.<n>Algorithm converts a randomly loaded $W times W$ lattice into a defect-free $L times L$ subarray.<n>Algorithm achieves sublinear move scaling and linear growth of required initial size with target dimension.
  arXiv  Detail & Related papers  (2025-11-20T12:32:35Z)
• A Fundamental Bound for Robust Quantum Gate Control [0.0]
  We derive a universal performance limit for coherent quantum control in the presence of modeled and unmodeled uncertainties.<n>We prove that the worst-case (and hence the average) gate fidelity obeys the lower bound $F ge Flbbigl(tf Omeffbigr)$.
  arXiv  Detail & Related papers  (2025-07-01T22:26:04Z)
• Quantum Error Suppression with Subgroup Stabilisation [3.4719087457636792]
  Quantum state purification is the functionality that, given multiple copies of an unknown state, outputs a state with increased purity. We propose an effective state purification gadget with a moderate quantum overhead by projecting $M$ noisy quantum inputs to their subspace. Our method, applied in every short evolution over $M$ redundant copies of noisy states, can suppress both coherent and errors by a factor of $1/M$, respectively.
  arXiv  Detail & Related papers  (2024-04-15T17:51:47Z)
• The role of shared randomness in quantum state certification with unentangled measurements [36.19846254657676]
  We study quantum state certification using unentangled quantum measurements. $Theta(d2/varepsilon2)$ copies are necessary and sufficient for state certification. We develop a unified lower bound framework for both fixed and randomized measurements.
  arXiv  Detail & Related papers  (2024-01-17T23:44:52Z)
• Quantum Lower Bounds by Sample-to-Query Lifting [33.82353457014144]
  We propose a new method for proving quantum query lower bounds by a quantum sample-to-query lifting theorem.<n>We provide unified proofs for some known lower bounds, including those for phase/amplitude estimation and Hamiltonian simulation.
  arXiv  Detail & Related papers  (2023-08-03T14:41:49Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.