✦ LIBER ✦

Quantum computing, postselection, and probabilistic polynomial-time

✍ Scribed by Aaronson, Scott

Book ID: 120147756
Publisher: The Royal Society
Year: 2005
Tongue: English
Weight: 293 KB
Volume: 461
Category: Article
ISSN: 0962-8444
DOI: 10.1098/rspa.2005.1546

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Quantum probabilistically cloning and co

Quantum probabilistically cloning and computation

✍ Gao, Ting ;Yan, Fengli ;Wang, Zhixi ;Li, Youcheng 📂 Article 📅 2008 🏛 Higher Education Press and Springer 🌐 English ⚖ 263 KB

Polynomial-Time Simulation of Pairing Mo

Polynomial-Time Simulation of Pairing Models on a Quantum Computer

✍ Wu, L.-A.; Byrd, M. S.; Lidar, D. A. 📂 Article 📅 2002 🏛 The American Physical Society 🌐 English ⚖ 111 KB

Probabilistic time and the quantum gravi

Probabilistic time and the quantum gravity interpretation

✍ Mario A. Castagnino; Francisco D. Mazzitelli 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 321 KB

Testing shift-equivalence of polynomials

Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines

✍ D. Grigoriev 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 930 KB

The polynomials f, g E F[Xl, ,X,J are called shift-equivalent if there exists a shift (a~, , cc,) E F" such that f(Xl furl, . . ,X,, + CC,) = g. In three different cases algorithms which produce the set of all shift-equivalences of f, g in polynomial time are designed. Here (1) in the case of a zero

Polynomial-Time Algorithms for Prime Fac

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

✍ Shor, Peter W. 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 430 KB

Polynomial-Time Algorithms for Prime Fac

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

✍ Shor, Peter W. 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 362 KB