aiqbench analysis
This research presents a significant algorithmic breakthrough in quantum computing by achieving an exponential speedup in learning the Pauli profile of virtually distilled states. By utilizing paired replicas to cancel anticommutation signs, the protocol reduces the resource requirements from exponential to polynomial scaling with system size, making detailed state characterization feasible on current hardware. This advancement directly addresses critical challenges in quantum error mitigation and state tomography, which are foundational for scaling fault-tolerant quantum processors.
Pauli-resolved virtual distillation
arXiv:2609.24132v1 Announce Type: new Abstract: Learning the full Pauli profile of the virtually distilled quantum state $\rho^m/\text{tr}(\rho^m)$ has so far required exponentially many copies of $\rho$. We show that all $4^n$ squared Pauli moments $[\text{tr}(P\rho^m)]^2$ can be learned to additive error $\varepsilon$ with confidence $1-\delta$ from one $2m$-replica measurement setting using $O(m[n+\log(1/\delta)]/\varepsilon^2)$ copies. This is an exponential speedup in the system size $n$ over previous protocols. For $m = 2$, we propose the coherent Bell difference sampling circuit that realizes this measurement on current devices. The speedup originates from paired replicas that cancel the anticommutation signs of Pauli operators, collapsing the incompatibility of the Pauli family. We certify this collapse by introducing the quantum Bernstein norm, a computable incompatibility measure for nonlinear functionals. A further information-theoretic $m$-replica protocol recovers the signed moments $\text{tr}(P\rho^m)$ using $O(m[n+\log(1/\delta)]/\varepsilon^4)$ copies. For fixed $m$ in the stated lower-bound regime, it attains the optimal replica number, since any protocol with fewer replicas requires exponentially many copies.
Abstract:Learning the full Pauli profile of the virtually distilled quantum state $\rho^m/\text{tr}(\rho^m)$ has so far required exponentially many copies of $\rho$. We show that all $4^n$ squared Pauli moments $[\text{tr}(P\rho^m)]^2$ can be learned to additive error $\varepsilon$ with confidence $1-\delta$ from one $2m$-replica measurement setting using $O(m[n+\log(1/\delta)]/\varepsilon^2)$ copies. This is an exponential speedup in the system size $n$ over previous protocols. For $m = 2$, we propose the coherent Bell difference sampling circuit that realizes this measurement on current devices. The speedup originates from paired replicas that cancel the anticommutation signs of Pauli operators, collapsing the incompatibility of the Pauli family. We certify this collapse by introducing the quantum Bernstein norm, a computable incompatibility measure for nonlinear functionals. A further information-theoretic $m$-replica protocol recovers the signed moments $\text{tr}(P\rho^m)$ using $O(m[n+\log(1/\delta)]/\varepsilon^4)$ copies. For fixed $m$ in the stated lower-bound regime, it attains the optimal replica number, since any protocol with fewer replicas requires exponentially many copies.
arXiv:2609.24132 [quant-ph]
(or arXiv:2609.24132v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.24132 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.
Full text under the publisher's open licence · 246 words
Related coverage

News
Quantum Computing Report · Jul 25, 2026
PPVM: A Circuit Simulation Framework for Digital Twins of Quantum Processors
arXiv · Oct 14, 2026
SymFT: Universal Fault-Tolerant Quantum Circuit Simulation via Symbolic Clifford--Pauli Frames and Stabilizer Coordinates
arXiv · Jul 31, 2026
Slepian Bounds on the Success Probability of Virtual Distillation
arXiv · Aug 24, 2026