Fetching the paper…
Reading the bibliography…
We show that measuring pairs of qubits in the Bell basis can be used to obtain a simple quantum algorithm for efficiently identifying an unknown stabilizer state of n qubits.
Bounds for the quantity of information transmitted by a quantum communication channel
A. S. Holevo · 1973
Earlier work this paper cites.
Clifford group, stabilizer states, and linear and quadratic operations over GF(2)
J. Dehaene and B. De Moor · 2003
Earlier work this paper cites.
Improved simulation of stabilizer circuits
S. Aaronson and D. Gottesman · 2004
Earlier work this paper cites.
The learnability of quantum states
S. Aaronson · 2007
Earlier work this paper cites.
Identifying stabilizer states, 2008
S. Aaronson and D. Gottesman · 2008
Cited alongside, same era.
Learning and testing algorithms for the Clifford group
R. Low · 2009
Cited alongside, same era.
M. Rötteler · 2009
Cited alongside, same era.
Efficient quantum state tomography
M. Cramer, M. Plenio, S. Flammia, R. Somma, D. Gross, S. Bartlett, O. Landon-Cardinal, D. Poulin, and Y.-K. Liu · 2010
Cited alongside, same era.
Classical simulation of quantum computation, the Gottesman-Knill theorem, and slightly beyond
M. Van den Nest · 2010
Later among the works it cites.
Testing product states, quantum Merlin-Arthur games and tensor optimization
A. Harrow and A. Montanaro · 2013
Later among the works it cites.
Fast graph operations in quantum computation
L. Zhao, C. Pérez-Delgado, and J. Fitzsimons · 2016
Later among the works it cites.
Stabiliser states are efficiently PAC-learnable, 2017
A. Rocchetto · 2017
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…