A note on polynomial-time tolerant testing stabilizer states

October 29, 2024 · Declared Dead · 🏛 arXiv.org

👻 CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Srinivasan Arunachalam, Sergey Bravyi, Arkopal Dutt arXiv ID 2410.22220 Category quant-ph: Quantum Computing Cross-listed cs.CC, cs.DS Citations 10 Venue arXiv.org Last Checked 5 months ago
Abstract
We show an improved inverse theorem for the Gowers-$3$ norm of $n$-qubit quantum states $|ψ\rangle$ which states that: for every $γ\geq 0$, if the $\textsf{Gowers}(|ψ\rangle,3)^8 \geq γ$ then the stabilizer fidelity of $|ψ\rangle$ is at least $γ^C$ for some constant $C>1$. This implies a constant-sample polynomial-time tolerant testing algorithm for stabilizer states which accepts if an unknown state is $\varepsilon_1$-close to a stabilizer state in fidelity and rejects when $|ψ\rangle$ is $\varepsilon_2 \leq \varepsilon_1^C$-far from all stabilizer states, promised one of them is the case.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Quantum Computing

Died the same way — 👻 Ghosted