REVIEW 1 cited by
A note on polynomial-time tolerant testing stabilizer states
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
We show an improved inverse theorem for the Gowers-$3$ norm of $n$-qubit quantum states $|\psi\rangle$ which states that: for every $\gamma\geq 0$, if the $\textsf{Gowers}(|\psi \rangle,3)^8 \geq \gamma$ then the stabilizer fidelity of $|\psi\rangle$ is at least $\gamma^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 $|\psi\rangle$ is $\varepsilon_2 \leq \varepsilon_1^C$-far from all stabilizer states, promised one of them is the case.
Forward citations
Cited by 1 Pith paper
-
Adaptive Quantum Computers: decoding and state preparation
Adaptive quantum computers, mixing quantum circuits with classical parity processing, provably separate from classical shallow circuits on Hadamard list decoding and also prepare standard quantum states more efficiently.
Discussion (0). Continue with ORCID to comment.