English

A note on polynomial-time tolerant testing stabilizer states

Quantum Physics 2024-10-30 v1 Computational Complexity Data Structures and Algorithms

Abstract

We show an improved inverse theorem for the Gowers-33 norm of nn-qubit quantum states ψ|\psi\rangle which states that: for every γ0\gamma\geq 0, if the Gowers(ψ,3)8γ\textsf{Gowers}(|\psi \rangle,3)^8 \geq \gamma then the stabilizer fidelity of ψ|\psi\rangle is at least γC\gamma^C for some constant C>1C>1. This implies a constant-sample polynomial-time tolerant testing algorithm for stabilizer states which accepts if an unknown state is ε1\varepsilon_1-close to a stabilizer state in fidelity and rejects when ψ|\psi\rangle is ε2ε1C\varepsilon_2 \leq \varepsilon_1^C-far from all stabilizer states, promised one of them is the case.

Cite

@article{arxiv.2410.22220,
  title  = {A note on polynomial-time tolerant testing stabilizer states},
  author = {Srinivasan Arunachalam and Sergey Bravyi and Arkopal Dutt},
  journal= {arXiv preprint arXiv:2410.22220},
  year   = {2024}
}

Comments

6 pages

R2 v1 2026-06-28T19:39:54.594Z