We prove copy-optimal learning of the full Gaussian orbit of paired magic states on $n$ fermionic modes. The unknown evolution may be any parity-preserving quadratic circuit, including pair creation and annihilation, and each copy is measured once, in a fixed basis, on a single quartic Majorana observable. A nonadaptive learner returns a Gaussian preparation within trace distance $ε$ from $Θ(n^6/ε^2)$ copies at fixed confidence, and no learner in this measurement model, adaptive or not, can do better. Measured quartic correlations certify the trace distance of the result. Our second result extends learning to a broader family: pure states whose unknown input blocks are superpositions of disjoint occupation patterns with bounded particle number, under the same evolution. Using single-copy Gaussian rotations and occupation readout, a batch-adaptive learner returns an input and a Gaussian circuit with infidelity $f$ from $\widetilde O(n^7/f)$ copies and polynomial classical processing. Connected quartic correlations reveal the hidden mode groups, and fresh local measurements restore the branches and their coherences. No particle-number conservation, minimum branch weight or spectral gap is assumed.
AI Summary
The paper studies tomography of structured non-Gaussian fermionic pure states after unknown parity-preserving quadratic evolution, including pairing terms. The goal is a compact preparation description—an input state and Gaussian circuit—not an occupation-basis expansion or classical sampler.
For the Gaussian orbit of $B$ fixed four-mode states $(|1100\rangle+|0011\rangle)/\sqrt2$, with $n=4B$, it gives a polynomial-time, nonadaptive learner achieving trace-distance error $\epsilon$ with $\Theta(n^4[n^2+\log(1/\delta)]/\epsilon^2)$ copies at failure probability $\delta$. This rate is optimal even against adaptive learners, but specifically when each copy supplies one fixed-laboratory-basis quartic Majorana sign. Quadratic correlations vanish throughout this orbit. A gapped quartic parent Hamiltonian establishes the certificate $D_{\mathrm{tr}}(\rho,\sigma)\le\|x(\rho)-x(\sigma)\|_2/\sqrt{28}$. Reconstruction combines quartic-range estimation, independent range refresh, commutant-based block recovery and local refinement; the lower bound uses weak-response hard families and adaptive testing bounds.
A second learner allows unknown blocks comprising superpositions of disjoint occupation patterns, with fixed particle cap $r_\star$ but growing block and branch counts. Using batch-adaptive Gaussian rotations and occupation readout, it achieves infidelity $f$ with $\widetilde O_{r_\star}(n^7/f)$ copies and polynomial classical processing. Covariance bands and connected quartic correlations identify mode groups; fresh local measurements restore branches and coherences. No minimum branch weight or covariance gap is assumed.
Guarantees require pure promised states and ideal calibrated access; arbitrary inputs, mixed states and device noise are excluded. General-family copy optimality remains open, and quartic optimality does not extend to richer readout. Small-system numerics illustrate reconstruction, not scaling or practicality.
Little sign of AI-generated textStrong assumptions
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
Comments
59 pages, 3 figures; v2 adds copy-optimal paired-orbit learning under fixed-basis quartic measurements and improves the general-family copy bound; supporting Lean files included as ancillary material
We prove copy-optimal learning of the full Gaussian orbit of paired magic states on n fermionic modes. The unknown evolution may be any parity-preserving quadratic circuit, including pair creation and annihilation, and each copy is measured once, in a fixed basis, on a single quartic Majorana observable. A nonadaptive learner returns a Gaussian preparation within trace distance ε from Θ(n6/ε2) copies at fixed confidence, and no learner in this measurement model, adaptive or not, can do better. Measured quartic correlations certify the trace distance of the result. Our second result extends learning to a broader family: pure states whose unknown input blocks are superpositions of disjoint occupation patterns with bounded particle number, under the same evolution. Using single-copy Gaussian rotations and occupation readout, a batch-adaptive learner returns an input and a Gaussian circuit with infidelity f from O(n7/f) copies and polynomial classical processing. Connected quartic correlations reveal the hidden mode groups, and fresh local measurements restore the branches and their coherences. No particle-number conservation, minimum branch weight or spectral gap is assumed.
The paper studies tomography of structured non-Gaussian fermionic pure states after unknown parity-preserving quadratic evolution, including pairing terms. The goal is a compact preparation description—an input state and Gaussian circuit—not an occupation-basis expansion or classical sampler.
For the Gaussian orbit of B fixed four-mode states (∣1100⟩+∣0011⟩)/2, with n=4B, it gives a polynomial-time, nonadaptive learner achieving trace-distance error ϵ with Θ(n4[n2+log(1/δ)]/ϵ2) copies at failure probability δ. This rate is optimal even against adaptive learners, but specifically when each copy supplies one fixed-laboratory-basis quartic Majorana sign. Quadratic correlations vanish throughout this orbit. A gapped quartic parent Hamiltonian establishes the certificate Dtr(ρ,σ)≤∥x(ρ)−x(σ)∥2/28. Reconstruction combines quartic-range estimation, independent range refresh, commutant-based block recovery and local refinement; the lower bound uses weak-response hard families and adaptive testing bounds.
A second learner allows unknown blocks comprising superpositions of disjoint occupation patterns, with fixed particle cap r⋆ but growing block and branch counts. Using batch-adaptive Gaussian rotations and occupation readout, it achieves infidelity f with Or⋆(n7/f) copies and polynomial classical processing. Covariance bands and connected quartic correlations identify mode groups; fresh local measurements restore branches and coherences. No minimum branch weight or covariance gap is assumed.
Guarantees require pure promised states and ideal calibrated access; arbitrary inputs, mixed states and device noise are excluded. General-family copy optimality remains open, and quartic optimality does not extend to richer readout. Small-system numerics illustrate reconstruction, not scaling or practicality.
We establish efficient learning for a family of fermionic magic states under unknown number-conserving free-fermion evolution. Each input block has a definite particle number and is a superposition of Fock states, with occupied mode sets disjoint both within and across blocks. The key idea is to exploit the spectral structure of particle reduced density matrices (RDMs) to separate contributions from individual blocks from those involving several blocks, allowing us to reconstruct the hidden block structure. For a fixed upper bound on the particle number per block, our algorithm uses single-copy measurements and polynomial sample and classical computational complexity to recover a compact description of the state with prescribed fidelity and high probability, without prior knowledge of the block decomposition or the evolution. RDMs up to this upper bound suffice for reconstruction. We further show that this RDM order is necessary in general: two orthogonal states in the family can have identical RDMs at every lower order. These results show that an extensive number of non-Gaussian blocks can be compatible with efficient state learning.
We prove that learning an unknown mixed fermionic Gaussian state on m modes to trace distance ε requires Ω(m3/ε2) copies when measurements act on one copy at a time, even with arbitrary POVMs, fresh ancillas and classical adaptivity, but without quantum memory between copies. The bound holds for 0<ε≤1/3600 and separates this model from the known collective rate Θ(m2/ε2). It follows from a uniform single-copy Fisher-information budget and a dimension-independent comparison between trace distance and Gaussian parameters. On covariance matrices of operator norm at most 1−c, we prove a Frobenius-to-trace-norm continuity bound with constant [2c(2−c)]−1/2; matchgate shadows then attain O(m3/(cε2)) copies. This also gives explicit error certificates for thermal free-fermion states. For a class of mixed passive bosonic Gaussian states with total mean photon number at most one, a reduction to bounded-block qudit tomography gives a single-copy lower bound Ω(m3/(ε2log(m/ε))), versus collective complexity Θ(m2/ε2). These separations answer the mixed-state measurement-resource question posed by Chen et al. A two-mode example has optimal two-copy Fisher trace 5, versus the separable ceiling 4. An IBM replication gave a pre-registered witness lower bound 4.12 at one-sided 95% shot-noise confidence; its interpretation assumes the prescribed preparations and a common measurement channel and does not bound preparation systematics.
Fermionic Gaussian states are the workhorse reference states for qubit-based quantum simulation of fermionic systems, yet existing certification protocols either proceed via fidelity estimation, leading to suboptimal sample complexity in the target precision ε, only apply to Haar-typical states, or require adaptive measurements on a large fraction of qubits. We give an adaptive protocol that certifies any d-mode pure fermionic Gaussian state using O(d2ε−1) copies, single-qubit measurements with only one qubit measured adaptively per copy, and O(d3) classical processing time per copy. The ε−1 dependence is optimal for the certification problem, even among strategies using entangled measurements. The sample complexity is controlled by the spectral gap of a d↔d−2 down-up walk---a Markov chain studied in the theory of high-dimensional expanders, equivalent to a two-site Glauber dynamics in statistical physics---relating certification efficiency to relaxation time to equilibrium. The worst-case bound is tight for this protocol and is attained by physically relevant states, including ground states of the fully dimerized Su-Schrieffer-Heeger (SSH) chain and BCS pair states. In contrast, numerics up to d=14 suggest that O(dε−1) copies suffice to certify Haar-typical Gaussian states, a factor of d improvement over the worst-case bound. Finally, because the bound depends only on the target's computational-basis distribution, the protocol extends to efficiently phase-dressed states---states obtained by injecting an efficiently computable diagonal phase to Gaussian states---with the same sample complexity. The class includes a continuous family of four-mode non-Gaussian magic states for matchgate computation.
With single-copy measurements, every mixed fermionic Gaussian state on m modes, pure modes included, is learned to trace distance ε from Θ(m3/ε2) copies, with no logarithmic factor, against the known Θ(m2/ε2) for collective measurements. We prove the upper bound, resolving Conjecture 10.1 of arXiv:2609.23189 (lower bound for ε≤1/3600), and fill most open entries of the sample-complexity table of fermionic and bosonic Gaussian states, for single-copy, k-copy and collective measurements. The single-copy measurement's noise is matched to the metric at every occupation scale. With blocks of k copies, the covariant highest-weight measurement of arXiv:2611.07271, read out through the Weyl-shift estimator, is exactly unbiased for every state; it gives Θ(max{m3/k,m2}/ε2) in Frobenius norm on all states and in trace distance on every class at a fixed distance from the pure boundary. The gain 1/k (k≤m) away from the pure boundary, against 1/k on cold number-conserving states, is therefore attained. For bosonic Gaussian states with bounded covariance, any displacement and squeezing, and occupations n1≤⋯≤nm, O((m2+r3+∑i,j>r1/(ni+nj))/ε2) single-copy measurements suffice, r the largest index with rnr≤2; this is the minimax rate on dyadic-interval classes, with no spectral gap or cold-mode count assumed, and holds with no covariance bound for displaced passive states. With no bound on energy or squeezing, non-Gaussian measurements learn centred one-mode states, mixed included, from O(ε−2) and centred pure m-mode states from O(m2/ε2) single copies, free of the loglogE term of Gaussian measurements, and m-mode states from O(m3/ε2) copies, entangled only in a first round on blocks of 4m+6.
We give collective tomography protocols for quantum states and channels with known symmetries, using random purification and dilation to reduce learning to pure-state estimation. For states commuting with a compact-group representation with multiplicities mλ, the optimal copy complexity is Θ((∑λmλ2+logη−1)/ε2) for sufficiently small trace-distance error ε and failure probability η for the nontrivial case ∑λmλ2>1. For G-covariant channels with finite-dimensional unitary representations of a compact group G, parallel O(DG/ε2) queries achieve a diamond-distance error $\varepsilon $ at fixed success probability 2/3, where DG counts the real parameters of covariant Choi operators before imposing trace preservation. For permutation-covariant channels on k qudits of fixed local dimension d, at sufficiently small fixed error and fixed success probability 2/3, we obtain the optimal query scalings Θd(kd4−1) for diamond distance and Θd(kd4−d2) for Choi trace distance. Furthermore, we resolve an open problem in quantum tomography of constructing efficient quantum circuits that approximate the Hayashi measurement for optimal pure-state estimation. We encode states in the symmetric subspace into bosonic occupation modes, realize the measurement by heterodyne detection and normalization, and approximate this procedure on qubits using the quantum Hermite transform. Combined with our symmetry-compatible purification and dilation circuits, this yields query-optimal and gate-efficient learners of permutation-covariant states and channels with gate complexity Od(poly(k,ε−1,logη−1)).
The classical cost of simulating free-fermion (matchgate) circuits depends on both the input state and the computational task. We develop classical algorithms for circuits with non-Gaussian inputs, addressing exact sampling and both additive-error and exact estimation of expectation values. For inputs consisting of n copies of the four-mode magic state, we give exact sampling algorithms, generalizing the Clifford and Clifford algorithm for Boson sampling, for passive and active free-fermion dynamics with worst-case arithmetic cost O(2n) per sample, without any multiplicative polynomial prefactor. The passive algorithm enables an exact simulation of the non-interacting regime of a recent trapped-ion experiment. We also extend recently developed additive-error estimation of number correlators and related observables from passive to active dynamics with runtime polynomial in n and the inverse additive-error, for input states formed by products of n four-mode even parity states. Our estimator uses a Gaussian-state decomposition adapted to each sampled state to control its second moment. This includes estimation of individual output probabilities. Finally, we show that for even-parity product inputs composed of constant-size blocks, expectation values of Majorana monomials of logarithmic weight can be computed exactly in polynomial time, improving on prior Majorana propagation-style algorithms with quasi-polynomial runtime. The exact algorithm processes the input blocks by dynamic programming, sharing calculations across subsets of Majorana factors. Our suite of algorithms provide classical benchmarks for fermionic quantum simulations across a broad spectrum of computational tasks.