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.02183

Single-Particle Spectral Estimation

Adrian Chapman, Charles Derby, Steven T. Flammia, Yeongwoo Hwang, Joel Klassen, Calum McCartney

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

Abstract

We study Hamiltonian learning in a novel setting, where we are promised a physical structure that is obfuscated by a global unitary. In particular, we consider the task of learning the weights $E_i$ of a Hamiltonian $H=U^{\dagger}(\sum_{i \in I} E_i n_i + H_O)U$ comprised of a set of non-interacting modes $I$ and an arbitrary ``spectator'' $H_O$ acting on a disjoint set of modes $O$. The non-interacting structure is hidden by an unknown global unitary $U$, and our goal is to recover the $E_i$ without reconstructing $U$. Such Hamiltonians are well-motivated in the setting of materials modeling, where they find application for classical methods such as mean-field theory, Green's functions, and density functional theory. We show that this problem is DQC1-hard, despite the apparent simplification given by the non-interacting structure. We then introduce SPICES (single-particle inference via contour estimators), which combines a Hadamard test with a novel classical postprocessing procedure to efficiently recover the spectral distribution in Wasserstein distance under certain natural assumptions. The method exploits the correspondence between single-particle energies of the individual quasiparticles and the Fourier frequencies governing zeros of the partition function at complex inverse temperature. As quasiparticle spectra feature ubiquitously in downstream materials calculations, and with SPICES being simple and practical to execute, we expect that SPICES is a promising route to quantum applications in materials simulation.

AI Summary

The paper studies single-particle spectral estimation when a free sector is hidden by an unknown global unitary: $UHU^\dagger=\sum_{i\in I}E_i n_i+H_O$, with a corresponding transformed occupation observable $N$. The objective is to recover the thermally weighted distribution of protected energies in a window $\Omega$, without reconstructing $U$. SPICES estimates normalized complex grand-canonical partition functions using Hadamard tests on Gibbs states. Protected energies correspond to inverse-fugacity roots $e^{-(\beta+it)E_i}$. Logarithmic contour integrals isolate their first root moment; Fourier sampling and linear-programming reconstruction then produce an estimate within Wasserstein-1 error $\epsilon$, using evolution times $O(\epsilon^{-1})$. Polynomial complexity requires spectator roots to remain outside the target annulus, radial separation $q<1$ from its boundaries, a normalized signal floor $b$, efficient Gibbs preparation and controlled evolution, and polynomial bounds on $b^{-1}$, $(1-q)^{-1}$ and $e^{2\beta|\Omega|}$. For free systems, $\beta\Delta\ge\log(3M)$ guarantees signal magnitude at least $e^{-1}$. For spectator-only interactions of norm $|\lambda|$, sufficient stability conditions include $|\lambda|\sqrt{\beta^2+t_{\max}^2}<\log(4/3)$. A reduction establishes DQC1-hardness even for stable instances with one protected energy in $\{16,17\}$; the construction encodes difficulty in the occupation observable and its operational access. The structural promise requires exact decoupling of protected modes, excluding general quasiparticle interactions. The sufficient temperature and conditioning bounds restrict window widths relative to endpoint gaps. Interacting-spectator guarantees can require finite time horizons. Numerical validation and comparisons with Green’s-function methods are deferred.

Little sign of AI-generated textAI use disclosedStrong assumptionsMissing comparison
AI was used to assist with paper drafting, editing and the design of figures and diagrams.

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

Comments
70 pages, 3 figures

Related papers

Structure-Agnostic Unitary Learning from Quantum Observable Dynamics with Application to Hamiltonian Identification

Mohamed Berkani

We present a variational algorithm for learning an unknown quantum unitary from time-series observable measurements, with no structural assumption about the target. The core separation: a hardware-efficient parametrised circuit learns the evolution operator U via observable matching; Hamiltonian identification follows as classical post-processing via matrix logarithm, when the target happens to be exp(-iH*tau). Three experiments establish the method's generality. First, a noiseless proof of correctness with exact gradients (L-BFGS-B) achieves MSE 1.61e-14 and recovers all Hamiltonian coefficients to six decimal places. Second, a gate-learning experiment fits CNOT, iSWAP, and a Haar-random SU(4) element -- none generated by any fixed Hamiltonian -- all to process fidelity 1.000000, confirming the method does not rely on Trotterisation structure. Third, quantum deployment via SPSA-Adam under Qiskit Aer depolarising noise (p1=0.001, p2=0.01, Nshots=1024) recovers all three Ising Hamiltonian terms with errors below 8%. The optimiser, SPSA-Adam, combines SPSA's hardware-efficient two-point gradient estimation with Adam's adaptive moment updates. A four-stage moment-warm curriculum progressively extends the training horizon, converting a global non-convex problem into a sequence of well-posed local ones.

quant-pharXiv:2607.15316•Jul 17, 2026•0 citations

Full-frequency GW from Cayley-transformed self-energy moments

Marcus K. Allen, George H. Booth

The dynamical GW self-energy approximation is a key computational tool to provide the fundamental spectrum of electronic systems. We reformulate this approximation, representing the particle and hole parts of the GW self-energy through a highly compact set of Cayley-transformed moment constraints. The Cayley transformation maps real frequencies to the unit circle, keeping the moments bounded as their order increases, ensuring numerical stability and allowing resolution to be focused on an energy range of interest. We calculate these Cayley-transformed moments via an efficient O[N$^4$] scaling contour integration, and from them, construct a Hermitian upfolded Hamiltonian with a linearly scaling dimensionality with system size. A single-shot diagonalization of this effective Hamiltonian gives an explicit full-frequency G0W0 Green's function with manifestly real poles and non-negative spectral weights. This enables quasiparticle energies, satellite features, and their spectral weights to be obtained across the full G0W0 spectrum. Comparisons with exact G0W0 calculations and convergence across the GW100 test set and the larger Chlorophyll A molecule demonstrate substantially faster and more reliable convergence with moment order than an earlier monomial-moment approach. These Cayley moment representations therefore provide a stable, compact, and systematically improvable route to the complete spectral information of zero-temperature GW, without explicit frequency grids, plasmon-pole models and other common approximations, or analytic continuation.

arXiv:2609.29271•Sep 24, 2026•0 citations

Learning spectral density functions in open quantum systems

Felipe Peleteiro, João Victor Shiguetsugo Kawanami Lima, Pedro Marcelo Prado +2 more

Spectral density functions quantify how environmental modes couple to quantum systems and govern their open dynamics. Inferring such frequency-dependent functions from time-domain measurements is an ill-conditioned inverse problem. Here, we use exactly solvable spin-boson models with pure-dephasing and amplitude-damping channels to reconstruct spectral density functions from noisy simulated data. First, we introduce a parameter estimation approach based on machine learning regressors to infer Lorentzian and Ohmic-like spectral density parameters, quantifying robustness to noise. Second, we show that a cosine transform inversion yields a physics-consistent spectral prior estimation, which is refined by a constrained neural network enforcing positivity and correct asymptotic behaviour. Our neural network framework robustly reconstructs structured spectral densities by filtering simulated noisy signals and learning general functional dependencies.

quant-pharXiv:2602.24056•Physical Review A•Mar 2, 2026•1 citation

Operator Score Matching for Learning Quantum Hamiltonians

Shreya Shukla, Abhijith Jayakumar, Andrey Y. Lokhov

Learning quantum Hamiltonians from low-temperature thermal state measurements is a fundamental problem in quantum physics. Scalability of existing methods is limited by the complexity of semidefinite optimization problems or partition function computation. Here, we develop a quantum analog of classical score matching method that exploits generalized notions of derivatives and integration by parts in operator algebras. We introduce a new \emph{Operator Score Matching} loss function that recovers Hamiltonian parameters by a simple gradient descent without the need to compute intractable normalization constants. Numerical experiments on the Gibbs states of the transverse-field Ising model, XXZ spin chain, Fermi-Hubbard model, and lattice $φ^4$ theory demonstrate efficient parameter recovery using finite-depth truncations of nested commutator expansions. Our results establish Operator Score Matching as a practical, partition-function-free framework for quantum Hamiltonian learning.

quant-pharXiv:2609.25246•Sep 23, 2026•2 citations

Learning Quantum Hamiltonians from the Dynamical Structure Factor

Nisarga Paul, Thomas Schuster, Jason Alicea

Identifying the microscopic interactions governing a quantum system is essential for developing predictive theories of materials and validating quantum technologies. Despite considerable progress, learning Hamiltonians from realistic experimental data remains a challenge. Motivated by neutron scattering and quantum simulations, we study the problem of learning a quantum Hamiltonian from the dynamical structure factor (DSF), which captures two-point correlation data in quantum magnets. We show that the DSF encodes sufficient information to efficiently reconstruct broad classes of quantum Hamiltonians. Our approach exploits simple relations between low-order spectral moments of the DSF and microscopic couplings, giving rise to three complementary Hamiltonian tomography protocols based on the high-temperature expansion, strong-field polarization, and the fluctuation-dissipation theorem, respectively. The framework we introduce establishes practical and robust Hamiltonian learning from common experimental data, with potentially immediate application to neutron scattering experiments.

arXiv:2611.15859•Nov 11, 2026•0 citations

Quantum Advantage in Learning Quantum Dynamics via Fourier coefficient extraction

Barthe, Alice, Rad, Mahtab Yaghubi, Grossi, Michele +1 more

One of the key challenges in quantum machine learning is finding relevant machine learning tasks with a provable quantum advantage. A natural candidate for this is learning unknown Hamiltonian dynamics. Here, we tackle the supervised learning version of this problem, where we are given random examples of the inputs to the dynamics as classical data, paired with the expectation values of some observable after the time evolution, as corresponding output labels. The task is to replicate the corresponding input-output function. We prove that this task can yield provable exponential classical-quantum learning advantages under common complexity assumptions in natural settings. To design our quantum learning algorithms, we introduce a new method, which we term \textit{\subroutine}~algorithm for parametrized circuit functions, and which may be of independent interest. Furthermore, we discuss the limitations of generalizing our method to arbitrary quantum dynamics while maintaining provable guarantees. We explain that significant generalizations are impossible under certain complexity-theoretic assumptions, but nonetheless, we provide a heuristic kernel method, where we trade-off provable correctness for broader applicability.

arXiv:2506.17089•Jun 20, 2025•7 citations
We study Hamiltonian learning in a novel setting, where we are promised a physical structure that is obfuscated by a global unitary. In particular, we consider the task of learning the weights EiE_iEi​ of a Hamiltonian H=U†(∑i∈IEini+HO)UH=U^{\dagger}(\sum_{i \in I} E_i n_i + H_O)UH=U†(∑i∈I​Ei​ni​+HO​)U comprised of a set of non-interacting modes III and an arbitrary ``spectator'' HOH_OHO​ acting on a disjoint set of modes OOO. The non-interacting structure is hidden by an unknown global unitary UUU, and our goal is to recover the EiE_iEi​ without reconstructing UUU. Such Hamiltonians are well-motivated in the setting of materials modeling, where they find application for classical methods such as mean-field theory, Green's functions, and density functional theory. We show that this problem is DQC1-hard, despite the apparent simplification given by the non-interacting structure. We then introduce SPICES (single-particle inference via contour estimators), which combines a Hadamard test with a novel classical postprocessing procedure to efficiently recover the spectral distribution in Wasserstein distance under certain natural assumptions. The method exploits the correspondence between single-particle energies of the individual quasiparticles and the Fourier frequencies governing zeros of the partition function at complex inverse temperature. As quasiparticle spectra feature ubiquitously in downstream materials calculations, and with SPICES being simple and practical to execute, we expect that SPICES is a promising route to quantum applications in materials simulation.
The paper studies single-particle spectral estimation when a free sector is hidden by an unknown global unitary: UHU†=∑i∈IEini+HOUHU^\dagger=\sum_{i\in I}E_i n_i+H_OUHU†=∑i∈I​Ei​ni​+HO​, with a corresponding transformed occupation observable NNN. The objective is to recover the thermally weighted distribution of protected energies in a window Ω\OmegaΩ, without reconstructing UUU.
SPICES estimates normalized complex grand-canonical partition functions using Hadamard tests on Gibbs states. Protected energies correspond to inverse-fugacity roots e−(β+it)Eie^{-(\beta+it)E_i}e−(β+it)Ei​. Logarithmic contour integrals isolate their first root moment; Fourier sampling and linear-programming reconstruction then produce an estimate within Wasserstein-1 error ϵ\epsilonϵ, using evolution times O(ϵ−1)O(\epsilon^{-1})O(ϵ−1). Polynomial complexity requires spectator roots to remain outside the target annulus, radial separation q<1q<1q<1 from its boundaries, a normalized signal floor bbb, efficient Gibbs preparation and controlled evolution, and polynomial bounds on b−1b^{-1}b−1, (1−q)−1(1-q)^{-1}(1−q)−1 and e2β∣Ω∣e^{2\beta|\Omega|}e2β∣Ω∣.
For free systems, βΔ≥log⁡(3M)\beta\Delta\ge\log(3M)βΔ≥log(3M) guarantees signal magnitude at least e−1e^{-1}e−1. For spectator-only interactions of norm ∣λ∣|\lambda|∣λ∣, sufficient stability conditions include ∣λ∣β2+tmax⁡2<log⁡(4/3)|\lambda|\sqrt{\beta^2+t_{\max}^2}<\log(4/3)∣λ∣β2+tmax2​​<log(4/3). A reduction establishes DQC1-hardness even for stable instances with one protected energy in {16,17}\{16,17\}{16,17}; the construction encodes difficulty in the occupation observable and its operational access.
The structural promise requires exact decoupling of protected modes, excluding general quasiparticle interactions. The sufficient temperature and conditioning bounds restrict window widths relative to endpoint gaps. Interacting-spectator guarantees can require finite time horizons. Numerical validation and comparisons with Green’s-function methods are deferred.
We present a variational algorithm for learning an unknown quantum unitary from time-series observable measurements, with no structural assumption about the target. The core separation: a hardware-efficient parametrised circuit learns the evolution operator U via observable matching; Hamiltonian identification follows as classical post-processing via matrix logarithm, when the target happens to be exp(-iH*tau). Three experiments establish the method's generality. First, a noiseless proof of correctness with exact gradients (L-BFGS-B) achieves MSE 1.61e-14 and recovers all Hamiltonian coefficients to six decimal places. Second, a gate-learning experiment fits CNOT, iSWAP, and a Haar-random SU(4) element -- none generated by any fixed Hamiltonian -- all to process fidelity 1.000000, confirming the method does not rely on Trotterisation structure. Third, quantum deployment via SPSA-Adam under Qiskit Aer depolarising noise (p1=0.001, p2=0.01, Nshots=1024) recovers all three Ising Hamiltonian terms with errors below 8%. The optimiser, SPSA-Adam, combines SPSA's hardware-efficient two-point gradient estimation with Adam's adaptive moment updates. A four-stage moment-warm curriculum progressively extends the training horizon, converting a global non-convex problem into a sequence of well-posed local ones.
The dynamical GW self-energy approximation is a key computational tool to provide the fundamental spectrum of electronic systems. We reformulate this approximation, representing the particle and hole parts of the GW self-energy through a highly compact set of Cayley-transformed moment constraints. The Cayley transformation maps real frequencies to the unit circle, keeping the moments bounded as their order increases, ensuring numerical stability and allowing resolution to be focused on an energy range of interest. We calculate these Cayley-transformed moments via an efficient O[N4^44] scaling contour integration, and from them, construct a Hermitian upfolded Hamiltonian with a linearly scaling dimensionality with system size. A single-shot diagonalization of this effective Hamiltonian gives an explicit full-frequency G0W0 Green's function with manifestly real poles and non-negative spectral weights. This enables quasiparticle energies, satellite features, and their spectral weights to be obtained across the full G0W0 spectrum. Comparisons with exact G0W0 calculations and convergence across the GW100 test set and the larger Chlorophyll A molecule demonstrate substantially faster and more reliable convergence with moment order than an earlier monomial-moment approach. These Cayley moment representations therefore provide a stable, compact, and systematically improvable route to the complete spectral information of zero-temperature GW, without explicit frequency grids, plasmon-pole models and other common approximations, or analytic continuation.
Spectral density functions quantify how environmental modes couple to quantum systems and govern their open dynamics. Inferring such frequency-dependent functions from time-domain measurements is an ill-conditioned inverse problem. Here, we use exactly solvable spin-boson models with pure-dephasing and amplitude-damping channels to reconstruct spectral density functions from noisy simulated data. First, we introduce a parameter estimation approach based on machine learning regressors to infer Lorentzian and Ohmic-like spectral density parameters, quantifying robustness to noise. Second, we show that a cosine transform inversion yields a physics-consistent spectral prior estimation, which is refined by a constrained neural network enforcing positivity and correct asymptotic behaviour. Our neural network framework robustly reconstructs structured spectral densities by filtering simulated noisy signals and learning general functional dependencies.
Learning quantum Hamiltonians from low-temperature thermal state measurements is a fundamental problem in quantum physics. Scalability of existing methods is limited by the complexity of semidefinite optimization problems or partition function computation. Here, we develop a quantum analog of classical score matching method that exploits generalized notions of derivatives and integration by parts in operator algebras. We introduce a new \emph{Operator Score Matching} loss function that recovers Hamiltonian parameters by a simple gradient descent without the need to compute intractable normalization constants. Numerical experiments on the Gibbs states of the transverse-field Ising model, XXZ spin chain, Fermi-Hubbard model, and lattice φ4φ^4φ4 theory demonstrate efficient parameter recovery using finite-depth truncations of nested commutator expansions. Our results establish Operator Score Matching as a practical, partition-function-free framework for quantum Hamiltonian learning.
Identifying the microscopic interactions governing a quantum system is essential for developing predictive theories of materials and validating quantum technologies. Despite considerable progress, learning Hamiltonians from realistic experimental data remains a challenge. Motivated by neutron scattering and quantum simulations, we study the problem of learning a quantum Hamiltonian from the dynamical structure factor (DSF), which captures two-point correlation data in quantum magnets. We show that the DSF encodes sufficient information to efficiently reconstruct broad classes of quantum Hamiltonians. Our approach exploits simple relations between low-order spectral moments of the DSF and microscopic couplings, giving rise to three complementary Hamiltonian tomography protocols based on the high-temperature expansion, strong-field polarization, and the fluctuation-dissipation theorem, respectively. The framework we introduce establishes practical and robust Hamiltonian learning from common experimental data, with potentially immediate application to neutron scattering experiments.
One of the key challenges in quantum machine learning is finding relevant machine learning tasks with a provable quantum advantage. A natural candidate for this is learning unknown Hamiltonian dynamics. Here, we tackle the supervised learning version of this problem, where we are given random examples of the inputs to the dynamics as classical data, paired with the expectation values of some observable after the time evolution, as corresponding output labels. The task is to replicate the corresponding input-output function. We prove that this task can yield provable exponential classical-quantum learning advantages under common complexity assumptions in natural settings. To design our quantum learning algorithms, we introduce a new method, which we term \textit{\subroutine}~algorithm for parametrized circuit functions, and which may be of independent interest. Furthermore, we discuss the limitations of generalizing our method to arbitrary quantum dynamics while maintaining provable guarantees. We explain that significant generalizations are impossible under certain complexity-theoretic assumptions, but nonetheless, we provide a heuristic kernel method, where we trade-off provable correctness for broader applicability.