Corpus ID: 231861895

On the Hardness of PAC-learning stabilizer States with Noise

@article{Gollakota2021OnTH,
  title={On the Hardness of PAC-learning stabilizer States with Noise},
  author={Aravind Gollakota and Daniel Liang},
  journal={ArXiv},
  year={2021},
  volume={abs/2102.05174}
}
We consider the problem of learning stabilizer states with noise in the Probably Approximately Correct (PAC) framework of Aaronson [Aar07] for learning quantum states. In the noiseless setting, an algorithm for this problem was recently given by Rocchetto [Roc18], but the noisy case was left open. Motivated by approaches to noise tolerance from classical learning theory, we introduce the Statistical Query (SQ) model for PAC-learning quantum states, and prove that algorithms in this model are… Expand

References

SHOWING 1-10 OF 43 REFERENCES
Quantum learning robust against noise
Noise is often regarded as anathema to quantum computation, but in some settings it can be an unlikely ally. We consider the problem of learning the class of $n$-bit parity functions by makingExpand
Noise-tolerant learning, the parity problem, and the statistical query model
TLDR
The algorithm runs in polynomial time for the case of parity functions that depend on only the first O(log n log log n) bits of input, which provides the first known instance of an efficient noise-tolerant algorithm for a concept class that is not learnable in the Statistical Query model of Kearns [1998]. Expand
Stabiliser states are efficiently PAC-learnable
TLDR
The results solve an open problem formulated by Aaronson (2007) and establish a connection between classical simulation of quantum systems and efficient learnability. Expand
Private learning implies quantum stability
TLDR
Key to many of the results is the construction of a generic quantum online learner, Robust Standard Optimal Algorithm (RSOA), which is robust to adversarial imprecision and various combinatorial parameters. Expand
Efficient noise-tolerant learning from statistical queries
TLDR
This paper formalizes a new but related model of learning from statistical queries, and demonstrates the generality of the statistical query model, showing that practically every class learnable in Valiant’s model and its variants can also be learned in the new model (and thus can be learning in the presence of noise). Expand
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
TLDR
It is proved that an algorithm due to Kushilevitz and Mansour can be used to weakly learn DNF using membership queries in polynomial time, with respect to the uniform distribution on the inputs, and it is obtained that DNF expressions and decision trees are not evenWeakly learnable with any unproven assumptions. Expand
Improved Simulation of Stabilizer Circuits
TLDR
The Gottesman-Knill theorem, which says that a stabilizer circuit, a quantum circuit consisting solely of controlled-NOT, Hadamard, and phase gates can be simulated efficiently on a classical computer, is improved in several directions. Expand
Efficient quantum tomography II
TLDR
From new analyses of random Young diagrams, the quantum generalization of learning a discrete probability distribution and several new results in quantum tomography are derived, including learning the eigenvalues of an unknown state to ε-accuracy in Hellinger-Squared, chi-squared, or KL distance, using n = O(d2/ε) copies. Expand
Shadow tomography of quantum states
  • S. Aaronson
  • Mathematics, Physics
  • Electron. Colloquium Comput. Complex.
  • 2017
TLDR
Surprisingly, this work gives a procedure that solves the problem of shadow tomography by measuring only O( ε−5·log4 M·logD) copies, which means, for example, that the authors can learn the behavior of an arbitrary n-qubit state, on *all* accepting/rejecting circuits of some fixed polynomial size, by measuringonly nO( 1) copies of the state. Expand
Gentle measurement of quantum states and differential privacy
TLDR
The connection theorem is proved, together with a quantum analog of the so-called private multiplicative weights algorithm of Hardt and Rothblum, to give a protocol to solve the problem of shadow tomography using order ( logm) 2 2 copies of ρ, compared to Aaronson’s previous bound of O(logm) 4( logd) . Expand
...
1
2
3
4
5
...