×

Machines, logic and quantum physics. (English) Zbl 0998.68059

A popular introduction to quantum computing, from the basic notions of quantum mechanics to the main ideas behind quantum algorithms such as the Deutsch-Josza algorithm for checking, in one call of \(f\), where \(f(0)=f(1)\), and Shor’s polynomial-time algorithm for factoring large integers. The authors also survey current and future state of quantum computing technology.

MSC:

68Q05 Models of computation (Turing machines, etc.) (MSC2010)
03D10 Turing machines and related notions
81P68 Quantum computation
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

References:

[1] The Fabric of Reality (1997)
[2] DOI: 10.1103/RevModPhys.68.733 · doi:10.1103/RevModPhys.68.733
[3] DOI: 10.1098/rspa.1998.0164 · Zbl 0915.68050 · doi:10.1098/rspa.1998.0164
[4] Proceedings of the 25th Annual Symposium on the Theory of Computing pp 11– (1993)
[5] DOI: 10.1002/cpa.3160130102 · Zbl 0102.00703 · doi:10.1002/cpa.3160130102
[6] Proceedings of the London Mathematical Society, 2 42 pp 230– (1937)
[7] Mathematics and Mind pp 71– (1994)
[8] Proceedings of the 37th Annual Symposiumon the Foundations of Computer Science (1996)
[9] Proceedings of the 35th Annual Symposium on the Foundations of Computer Science pp 124– (1994)
[10] Technical Report MIT/LCS/TR-212 (1979)
[11] Shadows of the mind (1994)
[12] The Computer from Pascal to von Neumann (1972) · Zbl 0245.01017
[13] Computational Complexity (1994) · Zbl 0833.68049
[14] The Kleene Symposium pp 123– (1980)
[15] Opere 6 (1896)
[16] DOI: 10.1007/BF02650179 · doi:10.1007/BF02650179
[17] DOI: 10.1098/rspa.1985.0070 · Zbl 0900.81019 · doi:10.1098/rspa.1985.0070
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.