A note on polynomial-time tolerant testing stabilizer states

Abstract

We show an improved inverse theorem for the Gowers-3 norm of n-qubit quantum states | which states that: for every γ≥ 0, if the Gowers(| ,3)8 ≥ γ then the stabilizer fidelity of | 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 1-close to a stabilizer state in fidelity and rejects when | is 2 ≤ 1C-far from all stabilizer states, promised one of them is the case.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…