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

Provably Efficient Learning of Fermionic Correlations under Particle-Number Symmetry

Yuki Koizumi, Kaito Wada, Toshinori P. Takama, Nobuyuki Yoshioka

quant-phSubmitted Jun 29, 2026• Announced Jun 30, 2026• 0 citations• Revised Sep 30, 2026 (v2)
v1 · Jun 29, 2026v2 · Sep 30, 2026
arXivHTMLPDF

Abstract

Predicting local fermionic correlations is a central task in quantum many-body physics, as these correlations encode many physically relevant local observables. The ubiquitous particle-number symmetry imposes strong structural constraints on quantum states, suggesting that local correlations should be learned with fewer samples than by symmetry-agnostic approaches. However, it has remained unclear whether such a provable advantage exists in collective learning of local correlations. Here, we develop a framework of number-conserving fermionic-shadow tomography based on random orbital rotations. We prove that, for every given order $k$, we can simultaneously estimate all $k$-body fermionic correlations of an $N$-mode $η$-particle state with a given variance $\varepsilon^2$ using only $O_k(η^k/\varepsilon^2)$ samples, which are independent of the system size $N$. We further establish a matching information-theoretic lower bound $Ω_k(η^k/\varepsilon^2)$ for any adaptive protocol based on single-copy measurements, showing that the $(η^k,\varepsilon)$-dependence is optimal up to constants depending only on $k$. Furthermore, numerical studies show a 20-fold query reduction for one-body correlation estimation at $N=200$, $η=20$, and $\varepsilon=10^{-2}$, compared with the best alternative including Heisenberg-limited estimation methods. Relative to fermionic Gaussian-unitary shadows, sample costs for the square-lattice Fermi-Hubbard model at $N=288$ are reduced by factors of $148$ for energy density and $161$ for spin structure factor estimation. For molecular energy derivatives with respect to atomic coordinates, our method reduces sample requirements by factors of $53$ for $\mathrm{Cr}_2$ and $18.5$ for $[\mathrm{Fe}_2\mathrm{S}_2]^{2-}$ at $N=128$. These results demonstrate the practical advantage of particle-number symmetry for fermionic observable estimation.

Comments
102 pages, 8 figures. V2: Added tight bounds, exact 1-/2-RDM covariance formulas, and numerical benchmarks

Related papers

Fermionic Partial Tomography via Classical Shadows

Andrew Zhao, Nicholas C. Rubin, Akimasa Miyake

We propose a tomographic protocol for estimating any k-body reduced density matrix (k-RDM) of an n-mode fermionic state, a ubiquitous step in near-term quantum algorithms for simulating many-body physics, chemistry, and materials. Our approach extends the framework of classical shadows, a randomized approach to learning a collection of quantum-state properties, to the fermionic setting. Our sampling protocol uses randomized measurement settings generated by a discrete group of fermionic Gaussian unitaries, implementable with linear-depth circuits. We prove that estimating all k-RDM elements to additive precision ϵ requires on the order of (n/k)k^{3/2}log(n)/ϵ^{2} repeated state preparations, which is optimal up to the logarithmic factor. Furthermore, numerical calculations show that our protocol offers a substantial improvement in constant overheads for k≥2, as compared to prior deterministic strategies. We also adapt our method to particle-number symmetry, wherein the additional circuit depth may be halved at the cost of roughly 2-5 times more repetitions.

arXiv:2010.16094•Physical Review Letters•Sep 9, 2021•144 citations

Particle-preserving fermionic shadows with mode-independent sample complexity

Maxwell West, M. Cerezo, Martin Larocca

We consider the problem of learning expectation values of particle-preserving operators with respect to an unknown $η$-particle $n$-mode fermionic state via classical shadows. Our main application is to estimating overlaps with arbitrary Slater determinant states: While it is known that such overlaps can, in the average case, be learnt to a fixed additive precision with a constant number of samples, the best-known worst case bound is $\mathcal{O}(\sqrt n \log n)$; here we improve this to $\mathcal{O}(η\logη)$, achieving a mode-independent sample cost. Our procedure is also computationally efficient, requiring only classical post-processing which for a generic dense orbital runs in time $\mathcal{O}(nη^2)$. For the task of estimating the expectation value of a general particle-preserving quadratic fermionic observable $h$, we prove a sample complexity bound of $\mathcal{O}(η\|h_0\|_2^2)$, where $h_0$ is the traceless component of $h$; the associated classical post-processing scales as $\mathcal{O}(n^2η)$. Finally, we discuss implementation of the required randomization: in a first-quantized encoding, approximate unitary designs give circuit depths polylogarithmic in the number of modes, contrasting with linear-depth requirements for nearest-neighbor second-quantized matchgate implementations. On the technical side, our proof reduces the extremal shadow variance to harmonic analysis on the AIII symmetric space $U(n)/(U(η)\times U(n-η))$ and evaluates the resulting integral using techniques from the theories of Jacobi ensembles and orthogonal polynomials, in a calculation which may be of independent interest.

quant-pharXiv:2606.27254•Jun 26, 2026•0 citations

Faster Quantum Algorithm for Multiple Observables Estimation

Yuki Koizumi, Kaito Wada, Wataru Mizukami +1 more

Achieving quantum advantage in efficiently estimating collective properties of quantum many-body systems remains a fundamental goal in quantum computing. While the quantum gradient estimation (QGE) algorithm has been shown to achieve doubly quantum enhancement in the precision and the number of observables, it remains unclear whether one benefits in practical applications. In this Letter, we present a generalized framework of the adaptive QGE algorithm and further propose two variants which enable us to estimate the collective properties of fermionic systems using the smallest cost among existing quantum algorithms. The first method utilizes the symmetry inherent in the target state, and the second method enables estimation in a single-shot manner using the parallel scheme. We show that our proposal offers a quadratic speedup compared with prior QGE algorithms in the task of fermionic partial tomography for systems with limited particle numbers. Furthermore, we provide numerical demonstrations showing that, for a problem of estimating 2-body fermionic reduced density matrices, our proposals improve the number of queries to the target state preparation oracle by a factor of 4.4 for the nitrogenase FeMo cofactor and by a factor of 7.8 for Fermi-Hubbard model of 200 sites in chemical accuracy.

arXiv:2505.00697•Physical Review Letters•Jan 15, 2026•2 citations

Permutationally Invariant Quantum State Tomography for Fermions

Shion Yamashika, Daisuke Yamamoto

Quantum state tomography provides complete information about a quantum state, but its measurement cost generally grows exponentially with system size. In many-particle quantum simulators, this challenge is further compounded by the limited accessibility of local measurements and controls. Here we develop a tomography protocol for permutation-invariant fermionic many-body states with U(1) particle-number symmetry. We show that any such state is completely determined by the distribution of the total particle number and the occupation of a single collective mode within each particle-number sector, both of which are accessible in current ultracold-atom experiments. The number of required observables scales only linearly with the system size. More generally, the protocol reconstructs the permutation-symmetrized component of arbitrary U(1)-symmetric fermionic states, which can still encode nontrivial many-body and state-level structure beyond conventional few-body observables. We demonstrate this protocol in interacting non-Gaussian states of the complex Sachdev-Ye-Kitaev model and in free-fermion chains across a Lifshitz transition. This framework opens a route toward information-theoretic characterization of strongly correlated itinerant quantum matter in experimentally realistic fermionic quantum simulators.

cond-mat.quant-gasCross-listedarXiv:2607.23579•Jul 28, 2026•0 citations

Classical shadows of fermions with particle number symmetry

Guang Hao Low

We consider classical shadows of fermion wavefunctions with $η$ particles occupying $n$ modes. We prove that all $k$-Reduced Density Matrices (RDMs) may be simultaneously estimated to an average variance of $ε^{2}$ using at most $\binomη{k}\big(1-\frac{η-k}{n}\big)^{k}\frac{1+n}{1+n-k}/ε^{2}$ measurements in random single-particle bases that conserve particle number, and provide an estimator for any $k$-RDM with $\mathcal{O}(k^2η)$ classical complexity. Our sample complexity is a super-exponential improvement over the $\mathcal{O}(\binom{n}{k}\frac{\sqrt{k}}{ε^{2}})$ scaling of prior approaches as $n$ can be arbitrarily larger than $η$, which is common in natural problems. Our method, in the worst-case of half-filling, still provides a factor of $4^{k}$ advantage in sample complexity, and also estimates all $η$-reduced density matrices, applicable to estimating overlaps with all single Slater determinants, with at most $\mathcal{O}(\frac{1}{ε^{2}})$ samples, which is additionally independent of $η$.

arXiv:2208.08964•Aug 18, 2022•13 citations

Shadow tomography for classical tensor network simulations

Jiace Sun, Garnet Kin-Lic Chan

Shadow tomography has appeared as a powerful tool for estimating observables on quantum computers from a small number of samples. We show that shadow-tomography-inspired ideas can offer similarly improved sample scaling for estimating observables on tensor network states on classical computers after proper adaptation. We develop strategies for both spin (bosonic) and fermionic systems, tailored to the contraction requirements of tensor networks, and generate scaling improvements of factors of $O(N)$ to $O(N^{3})$ (where $N$ is system size), depending on the specific task and system type. For the important and difficult task of evaluating the expectation value of long-range interacting Hamiltonians, we achieve the optimal $O(1)$ overall scaling (up to logarithmic factors) for an arbitrarily fixed relative Monte Carlo error in both spin and fermionic systems. Additionally, we show that shadow estimators offer more stable gradients of observables in variational optimization tasks than standard Monte Carlo estimators. We demonstrate practical advantage by simulating systems with long-range interactions, including the 2D long-range Heisenberg model and an ab-initio quantum chemistry Hamiltonian.

quant-pharXiv:2606.29133•Jun 30, 2026•0 citations
Predicting local fermionic correlations is a central task in quantum many-body physics, as these correlations encode many physically relevant local observables. The ubiquitous particle-number symmetry imposes strong structural constraints on quantum states, suggesting that local correlations should be learned with fewer samples than by symmetry-agnostic approaches. However, it has remained unclear whether such a provable advantage exists in collective learning of local correlations. Here, we develop a framework of number-conserving fermionic-shadow tomography based on random orbital rotations. We prove that, for every given order kkk, we can simultaneously estimate all kkk-body fermionic correlations of an NNN-mode ηηη-particle state with a given variance ε2\varepsilon^2ε2 using only Ok(ηk/ε2)O_k(η^k/\varepsilon^2)Ok​(ηk/ε2) samples, which are independent of the system size NNN. We further establish a matching information-theoretic lower bound Ωk(ηk/ε2)Ω_k(η^k/\varepsilon^2)Ωk​(ηk/ε2) for any adaptive protocol based on single-copy measurements, showing that the (ηk,ε)(η^k,\varepsilon)(ηk,ε)-dependence is optimal up to constants depending only on kkk. Furthermore, numerical studies show a 20-fold query reduction for one-body correlation estimation at N=200N=200N=200, η=20η=20η=20, and ε=10−2\varepsilon=10^{-2}ε=10−2, compared with the best alternative including Heisenberg-limited estimation methods. Relative to fermionic Gaussian-unitary shadows, sample costs for the square-lattice Fermi-Hubbard model at N=288N=288N=288 are reduced by factors of 148148148 for energy density and 161161161 for spin structure factor estimation. For molecular energy derivatives with respect to atomic coordinates, our method reduces sample requirements by factors of 535353 for Cr2\mathrm{Cr}_2Cr2​ and 18.518.518.5 for [Fe2S2]2−[\mathrm{Fe}_2\mathrm{S}_2]^{2-}[Fe2​S2​]2− at N=128N=128N=128. These results demonstrate the practical advantage of particle-number symmetry for fermionic observable estimation.
We propose a tomographic protocol for estimating any k-body reduced density matrix (k-RDM) of an n-mode fermionic state, a ubiquitous step in near-term quantum algorithms for simulating many-body physics, chemistry, and materials. Our approach extends the framework of classical shadows, a randomized approach to learning a collection of quantum-state properties, to the fermionic setting. Our sampling protocol uses randomized measurement settings generated by a discrete group of fermionic Gaussian unitaries, implementable with linear-depth circuits. We prove that estimating all k-RDM elements to additive precision ϵ requires on the order of (n/k)k^{3/2}log(n)/ϵ^{2} repeated state preparations, which is optimal up to the logarithmic factor. Furthermore, numerical calculations show that our protocol offers a substantial improvement in constant overheads for k≥2, as compared to prior deterministic strategies. We also adapt our method to particle-number symmetry, wherein the additional circuit depth may be halved at the cost of roughly 2-5 times more repetitions.
We consider the problem of learning expectation values of particle-preserving operators with respect to an unknown ηηη-particle nnn-mode fermionic state via classical shadows. Our main application is to estimating overlaps with arbitrary Slater determinant states: While it is known that such overlaps can, in the average case, be learnt to a fixed additive precision with a constant number of samples, the best-known worst case bound is O(nlog⁡n)\mathcal{O}(\sqrt n \log n)O(n​logn); here we improve this to O(ηlog⁡η)\mathcal{O}(η\logη)O(ηlogη), achieving a mode-independent sample cost. Our procedure is also computationally efficient, requiring only classical post-processing which for a generic dense orbital runs in time O(nη2)\mathcal{O}(nη^2)O(nη2). For the task of estimating the expectation value of a general particle-preserving quadratic fermionic observable hhh, we prove a sample complexity bound of O(η∥h0∥22)\mathcal{O}(η\|h_0\|_2^2)O(η∥h0​∥22​), where h0h_0h0​ is the traceless component of hhh; the associated classical post-processing scales as O(n2η)\mathcal{O}(n^2η)O(n2η). Finally, we discuss implementation of the required randomization: in a first-quantized encoding, approximate unitary designs give circuit depths polylogarithmic in the number of modes, contrasting with linear-depth requirements for nearest-neighbor second-quantized matchgate implementations. On the technical side, our proof reduces the extremal shadow variance to harmonic analysis on the AIII symmetric space U(n)/(U(η)×U(n−η))U(n)/(U(η)\times U(n-η))U(n)/(U(η)×U(n−η)) and evaluates the resulting integral using techniques from the theories of Jacobi ensembles and orthogonal polynomials, in a calculation which may be of independent interest.
Achieving quantum advantage in efficiently estimating collective properties of quantum many-body systems remains a fundamental goal in quantum computing. While the quantum gradient estimation (QGE) algorithm has been shown to achieve doubly quantum enhancement in the precision and the number of observables, it remains unclear whether one benefits in practical applications. In this Letter, we present a generalized framework of the adaptive QGE algorithm and further propose two variants which enable us to estimate the collective properties of fermionic systems using the smallest cost among existing quantum algorithms. The first method utilizes the symmetry inherent in the target state, and the second method enables estimation in a single-shot manner using the parallel scheme. We show that our proposal offers a quadratic speedup compared with prior QGE algorithms in the task of fermionic partial tomography for systems with limited particle numbers. Furthermore, we provide numerical demonstrations showing that, for a problem of estimating 2-body fermionic reduced density matrices, our proposals improve the number of queries to the target state preparation oracle by a factor of 4.4 for the nitrogenase FeMo cofactor and by a factor of 7.8 for Fermi-Hubbard model of 200 sites in chemical accuracy.
Quantum state tomography provides complete information about a quantum state, but its measurement cost generally grows exponentially with system size. In many-particle quantum simulators, this challenge is further compounded by the limited accessibility of local measurements and controls. Here we develop a tomography protocol for permutation-invariant fermionic many-body states with U(1) particle-number symmetry. We show that any such state is completely determined by the distribution of the total particle number and the occupation of a single collective mode within each particle-number sector, both of which are accessible in current ultracold-atom experiments. The number of required observables scales only linearly with the system size. More generally, the protocol reconstructs the permutation-symmetrized component of arbitrary U(1)-symmetric fermionic states, which can still encode nontrivial many-body and state-level structure beyond conventional few-body observables. We demonstrate this protocol in interacting non-Gaussian states of the complex Sachdev-Ye-Kitaev model and in free-fermion chains across a Lifshitz transition. This framework opens a route toward information-theoretic characterization of strongly correlated itinerant quantum matter in experimentally realistic fermionic quantum simulators.
We consider classical shadows of fermion wavefunctions with ηηη particles occupying nnn modes. We prove that all kkk-Reduced Density Matrices (RDMs) may be simultaneously estimated to an average variance of ε2ε^{2}ε2 using at most (ηk)(1−η−kn)k1+n1+n−k/ε2\binomη{k}\big(1-\frac{η-k}{n}\big)^{k}\frac{1+n}{1+n-k}/ε^{2}(kη​)(1−nη−k​)k1+n−k1+n​/ε2 measurements in random single-particle bases that conserve particle number, and provide an estimator for any kkk-RDM with O(k2η)\mathcal{O}(k^2η)O(k2η) classical complexity. Our sample complexity is a super-exponential improvement over the O((nk)kε2)\mathcal{O}(\binom{n}{k}\frac{\sqrt{k}}{ε^{2}})O((kn​)ε2k​​) scaling of prior approaches as nnn can be arbitrarily larger than ηηη, which is common in natural problems. Our method, in the worst-case of half-filling, still provides a factor of 4k4^{k}4k advantage in sample complexity, and also estimates all ηηη-reduced density matrices, applicable to estimating overlaps with all single Slater determinants, with at most O(1ε2)\mathcal{O}(\frac{1}{ε^{2}})O(ε21​) samples, which is additionally independent of ηηη.
Shadow tomography has appeared as a powerful tool for estimating observables on quantum computers from a small number of samples. We show that shadow-tomography-inspired ideas can offer similarly improved sample scaling for estimating observables on tensor network states on classical computers after proper adaptation. We develop strategies for both spin (bosonic) and fermionic systems, tailored to the contraction requirements of tensor networks, and generate scaling improvements of factors of O(N)O(N)O(N) to O(N3)O(N^{3})O(N3) (where NNN is system size), depending on the specific task and system type. For the important and difficult task of evaluating the expectation value of long-range interacting Hamiltonians, we achieve the optimal O(1)O(1)O(1) overall scaling (up to logarithmic factors) for an arbitrarily fixed relative Monte Carlo error in both spin and fermionic systems. Additionally, we show that shadow estimators offer more stable gradients of observables in variational optimization tasks than standard Monte Carlo estimators. We demonstrate practical advantage by simulating systems with long-range interactions, including the 2D long-range Heisenberg model and an ab-initio quantum chemistry Hamiltonian.