Learning stabilizer states by Bell sampling

@inproceedings{Montanaro2017LearningSS,
  title={Learning stabilizer states by Bell sampling},
  author={Ashley Montanaro},
  year={2017}
}
It is well-known and follows from Holevo’s theorem [7] that approximately determining an arbitrary quantum state |ψ〉 of n qubits requires exponentially many (in n) copies of |ψ〉. One way of circumventing this problem is to relax the notion of what it means to determine |ψ〉 (e.g. by requiring only that we are able to predict the result of “most” measurements on |ψ〉, according to some probability distribution [1]); another way is to restrict the class of states to be determined to some class… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-4 of 4 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Stabiliser states are efficiently PAClearnable, 2017

A. Rocchetto
2017
View 2 Excerpts

Efficient quantum state tomography.

Nature communications • 2010
View 2 Excerpts

Learning and testing algorithms for the Clifford group

R. Low
Phys. Rev. A, • 2009
View 2 Excerpts

The Learnability of Quantum States

Electronic Colloquium on Computational Complexity • 2006
View 2 Excerpts

Clifford group, stabilizer states, and linear and quadratic operations over GF(2)

J. Dehaene, B. De Moor
Phys. Rev. A, • 2003
View 2 Excerpts

Similar Papers

Loading similar papers…