Universal quantum simulator
- Universal quantum simulator
A universal quantum simulator is a quantum computer proposed by Richard Feynman in 1982. [cite journal
last = Feynman
first = Richard
authorlink = Richard Feynman
title = Simulating Physics with Computers
journal = International Journal of Theoretical Physics
volume = 21
pages = 467–488
date = 1982
url = http://www.springerlink.com/content/t2x8115127841630
doi = 10.1007/BF02650179
accessdate = 2007-10-19 ] Feynman showed that a classical Turing machine would experience an exponential slowdown when simulating quantum phenomena, while his hypothetical universal quantum simulator would not. David Deutsch later, in 1985, took the ideas further and described the first true Universal quantum computer.
A quantum system of many particles is described by an exponentially large Hilbert space. Therefore, a classical computer requires exponentially many resources (space and/or time) to simulate its evolution. The proposed solution involves the development of a computing machine that follows the laws of quantum mechanics. In this case, a quantum system of many particles could be simulated by this quantum machine using a number of quantum bits similar to the number of particles in the original system.
References
External links
* [http://www.ceid.upatras.gr/tech_news/papers/quantum_theory.pdf Deutsch's 1985 paper]
* [http://www.cs.princeton.edu/courses/archive/fall04/cos576/papers/feynman82/feynman82.pdf Richard P. Feynman, 1982, "Simulating Physics with Computers"]
Wikimedia Foundation.
2010.
Look at other dictionaries:
Universal quantum computer — In quantum mechanics, the universal quantum computer or universal quantum Turing machine (UQTM) is a theoretical machine that combines both Church Turing and quantum principles.Such computers were first proposed in a 1985 paper written by Oxford… … Wikipedia
Quantum information — For the journal with this title, see Historical Social Research. In quantum mechanics, quantum information is physical information that is held in the state of a quantum system. The most popular unit of quantum information is the qubit, a two… … Wikipedia
Quantum channel — In quantum information theory, a quantum channel is a communication channel which can transmit quantum information, as well as classical information. An example of quantum information is the state of a qubit. An example of classical information… … Wikipedia
Quantum finite automata — In quantum computing, quantum finite automata or QFA are a quantum analog of probabilistic automata. They are related to quantum computers in a similar fashion as finite automata are related to Turing machines. Several types of automata may be… … Wikipedia
Quantum computer — A quantum computer is a device for computation that makes direct use of distinctively quantum mechanical phenomena, such as superposition and entanglement, to perform operations on data. In a classical (or conventional) computer, information is… … Wikipedia
One-way quantum computer — The one way or measurement based quantum computer is a method of quantum computing that first prepares an entangled resource state, usually a cluster state or graph state, then performs single qubit measurements on it. It is one way because the… … Wikipedia
Nuclear magnetic resonance quantum computer — Molecule of alanine used in NMR implementation of quantum computing. Qubits are implemented by spin states of the black carbon atoms NMR quantum computing uses the spin states of molecules as qubits. NMR differs from other implementation … Wikipedia
Simulador cuántico universal — Un simulador cuántico universal es un tipo de computador cuántico que fue propuesto por Richard Feynman en 1982, extendiendo las ideas de la computación analógica a los sistemas descritos por la mecánica cuántica.[1] Feynman mostró que una… … Wikipedia Español
Timeline of quantum computing — Timeline of quantum computers1970s* 1970 Stephen Wiesner invents conjugate coding.* 1973 Alexander Holevo publishes a paper showing that n qubits cannot carry more than n classical bits of information (a result known as Holevo s theorem or Holevo … Wikipedia
Deutsch–Jozsa algorithm — The Deutsch–Jozsa algorithm is a quantum algorithm, proposed by David Deutsch and Richard Jozsa in 1992[1] with improvements by Richard Cleve, Artur Ekert, Chiara Macchiavello, and Michele Mosca in 1998.[2] Although it is of little practical use … Wikipedia
