Quantum Computing Task
(Redirected from Quantum Computing)
Jump to navigation
Jump to search
A Quantum Computing Task is a computing task that ...
- See: Cryptanalysis, Church–Turing Thesis, Computation, Quantum Mechanics, Phenomena, Quantum Superposition, Quantum Entanglement, Post-Quantum Cryptography.
References
2015
- (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/quantum_computing Retrieved:2015-8-13.
- Quantum computing studies theoretical computation systems (quantum computers) that make direct use of quantum-mechanical phenomena, such as superposition and entanglement, to perform operations on data. Quantum computers are different from digital computers based on transistors. Whereas digital computers require data to be encoded into binary digits (bits), each of which is always in one of two definite states (0 or 1), quantum computation uses quantum bits (qubits), which can be in superpositions of states. A quantum Turing machine is a theoretical model of such a computer, and is also known as the universal quantum computer. Quantum computers share theoretical similarities with non-deterministic and probabilistic computers. The field of quantum computing was initiated by the work of Yuri Manin in 1980, Richard Feynman in 1982, and David Deutsch in 1985. A quantum computer with spins as quantum bits was also formulated for use as a quantum space–time in 1968. , the development of actual quantum computers is still in its infancy, but experiments have been carried out in which quantum computational operations were executed on a very small number of quantum bits. Both practical and theoretical research continues, and many national governments and military agencies are funding quantum computing research in an effort to develop quantum computers for civilian, business, trade, and national security purposes, such as cryptanalysis. [1] Large-scale quantum computers will be able to solve certain problems much more quickly than any classical computers that use even the best currently known algorithms, like integer factorization using Shor's algorithm or the simulation of quantum many-body systems. There exist quantum algorithms, such as Simon's algorithm, that run faster than any possible probabilistic classical algorithm. Given sufficient computational resources, however, a classical computer could be made to simulate any quantum algorithm, as quantum computation does not violate the Church–Turing thesis.
- ↑ Quantum Information Science and Technology Roadmap for a sense of where the research is heading.
- (Valiron et al., 2015) ⇒ Benoît Valiron, Neil J. Ross, Peter Selinger, D. Scott Alexander, and Jonathan M. Smith. (2015). “Programming the Quantum Future.” In: Communications of the ACM Journal, 58(8). doi:10.1145/2699415