analiza aiqbench
This research presents an adaptive protocol for certifying fermionic Gaussian states with optimal sample complexity scaling as $O(d^2\epsilon^{-1})$, eliminating the need for large-scale entangled measurements or adaptive operations on most qubits. By linking certification efficiency to the spectral gap of a specific Markov chain, the study establishes tight worst-case bounds while suggesting a factor-of-$d$ improvement for typical Haar states via numerical evidence. The protocol's extension to phase-dressed non-Gaussian magic states further highlights its utility for verifying resources in matchgate computation and other fermionic simulations.
Certifying fermionic Gaussian states (and a little more) with optimal precision dependence
arXiv:2609.28233v1 Announce Type: new Abstract: 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 $\epsilon$, 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(d^2\epsilon^{-1})$ copies, single-qubit measurements with only one qubit measured adaptively per copy, and $O(d^3)$ classical processing time per copy. The $\epsilon^{-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\leftrightarrow 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 \epsilon^{-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.
Abstract: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 $\epsilon$, 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(d^2\epsilon^{-1})$ copies, single-qubit measurements with only one qubit measured adaptively per copy, and $O(d^3)$ classical processing time per copy. The $\epsilon^{-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\leftrightarrow 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 \epsilon^{-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.
Quantum Physics (quant-ph); Statistical Mechanics (cond-mat.stat-mech)
arXiv:2609.28233 [quant-ph]
(or arXiv:2609.28233v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.28233 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 336 cuvinte
Subiecte conexe
Approximate cloning of structured pure states
arXiv · 6 oct. 2026
Fermionic non-Gaussianity via Bell sampling: monotones and efficient quantum algorithms
arXiv · 4 iun. 2026
Fermionic non-Gaussianity via Bell sampling: monotones and efficient quantum algorithms
arXiv · 1 sept. 2026
Interface Capacity and Architectural Replenishment Determine Entanglement-Generation Speed in Quantum Networks
arXiv · 20 aug. 2026