query: Which theoretical models for quantum computing are polynomial-time equivalent?
positive_passages.docid: 66679
positive_passages.text: What are the models of quantum computation?
negative_passages.docid: 34455
negative_passages.text: How to approximate $Rx$, $Ry$ and $Rz$ gates?
negative_passages.docid: 41664
negative_passages.text: Current mathematics theory used in cryptography/coding theory
negative_passages.docid: 139993
negative_passages.text: Quantum systems without a classical analogue?
negative_passages.docid: 57089
negative_passages.text: Class of functions computable by Coq
negative_passages.docid: 6499
negative_passages.text: Quantum mechanical books for mathematicians
negative_passages.docid: 27362
negative_passages.text: What does a "real" quantum computer need for cryptanalysis and/or cryptographic attack purposes?
negative_passages.docid: 75161
negative_passages.text: Does Moore's law apply to quantum computing?
negative_passages.docid: 155036
negative_passages.text: What would be an informative introduction to quantum computing software?
negative_passages.docid: 30665
negative_passages.text: Elegant proofs that similar matrices have the same characteristic polynomial?
negative_passages.docid: 158729
negative_passages.text: Are the polynomial remainder and factor theorems equivalent?
negative_passages.docid: 138517
negative_passages.text: Is there a cryptography algorithm that will remain safe if P=NP?
negative_passages.docid: 111270
negative_passages.text: Baker Gill Solovay $P^B \ne NP^B$ relativization, what class is $B$ in?
negative_passages.docid: 98220
negative_passages.text: How do we show that no hidden variable theories can replace QM?
negative_passages.docid: 34861
negative_passages.text: Expressing a symmetric polynomial in terms of elementary symmetric polynomials using computer?
negative_passages.docid: 134699
negative_passages.text: Can *any* real polynomial be factored linearly (plus a constant) over $\mathbb{R}$?
negative_passages.docid: 69822
negative_passages.text: Is there any general statement about what kinds of problems can be solved more efficiently using a quantum computer?