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- norm of -qubit quantum states which states that: for every , if the then the stabilizer fidelity of is at least for some constant . This implies a constant-sample polynomial-time tolerant testing algorithm for stabilizer states which accepts if an unknown state is -close to a stabilizer state in fidelity and rejects when is -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