Quantum computing: Difference between revisions
imported>Sekhar Talluri No edit summary |
mNo edit summary |
||
| (5 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
{{subpages}} | {{subpages}} | ||
Quantum computing is a novel paradigm for computing. Quantum mechanical systems can exist as a superposition of states and this property can be used to design computing systems that can encode several possible solutions simultaneously. Certain problems that require an exponentially large time on an ordinary computer may be solved in linear time using Quantum computers. Basic unit of information storage in a quantum computer is called the qubit. Whereas a conventional computer stores bits (which can be either 1 or 0), a state (qubit) in a quantum computer can be simultaneously both 0 and 1 (this is called superposition of states). | Quantum computing<ref name=Shor1994>{{citation | ||
| last = Shor | first = P.W | |||
| year = 1994 | |||
| title = Algorithms for Quantum Computation: Discrete Logarithms and Factoring | |||
| journal = Annual Symposium on Foundations of Computer Science | |||
| volume = 35 | |||
| pages = 124–124 | |||
| url = http://www.physics.princeton.edu/~mcdonald/examples/QM/shor_ieeefcs_35_124_94.pdf | |||
}}</ref> is a novel paradigm for computing. Quantum mechanical systems can exist as a [[superposition of states]] and this property can be used to design computing systems that can encode several possible solutions simultaneously. Certain problems that require an exponentially large time on an ordinary computer may be solved in linear time using Quantum computers. Basic unit of information storage in a quantum computer is called the qubit. Whereas a conventional [[computer]] stores bits (which can be either 1 or 0), a state (qubit) in a quantum computer can be simultaneously both 0 and 1 (this is called superposition of states). | |||
To create a working Quantum computer, it is necessary to create: | To create a working [[Quantum computer]], it is necessary to create: | ||
* A coherent superposition of states, | * A coherent superposition of states, | ||
* Manipulate the coherence in a manner specified by the algorithm of interest and | * Manipulate the coherence in a manner specified by the [[algorithm]] of interest and | ||
* Read out the result. | * Read out the result. In a conventional Quantum computer, readout results in a collapse of the superposition of states into a single 'pure' state. In an ensemble Quantum computer, readout is the [[expectation value]] of the observable. | ||
Experiments demonstrating ensemble quantum computing algorithms have been successfully implemented on [[NMR]] spectrometers<ref>{{citation | Experiments demonstrating ensemble quantum computing algorithms have been successfully implemented on [[NMR spectroscopy]] spectrometers<ref>{{citation | ||
| last = D.G.Cory, A.Fahmy, T.F.Havel | | last = D.G.Cory, A.Fahmy, T.F.Havel | ||
| year = 1997 | | year = 1997 | ||
| Line 18: | Line 26: | ||
| url = http://www.pnas.org/cgi/content/full/94/5/1634 | | url = http://www.pnas.org/cgi/content/full/94/5/1634 | ||
}}</ref>. Such (an expectation value) Quantum computer can solve some problems in polynomial time that would be non deterministic polynomial time complete ([[NP complete]]) on a conventional computer. | }}</ref>. Such (an expectation value) Quantum computer can solve some problems in polynomial time that would be non deterministic polynomial time complete ([[NP complete]]) on a conventional computer. | ||
Other experimental methods have also been used to demonstrate the experimental feasibility of | Other experimental methods have also been used to demonstrate the experimental feasibility of a Quantum computer. | ||
==References== | ==References== | ||
<references/> | <references/>[[Category:Suggestion Bot Tag]] | ||
Latest revision as of 06:00, 9 October 2024
Quantum computing[1] is a novel paradigm for computing. Quantum mechanical systems can exist as a superposition of states and this property can be used to design computing systems that can encode several possible solutions simultaneously. Certain problems that require an exponentially large time on an ordinary computer may be solved in linear time using Quantum computers. Basic unit of information storage in a quantum computer is called the qubit. Whereas a conventional computer stores bits (which can be either 1 or 0), a state (qubit) in a quantum computer can be simultaneously both 0 and 1 (this is called superposition of states).
To create a working Quantum computer, it is necessary to create:
- A coherent superposition of states,
- Manipulate the coherence in a manner specified by the algorithm of interest and
- Read out the result. In a conventional Quantum computer, readout results in a collapse of the superposition of states into a single 'pure' state. In an ensemble Quantum computer, readout is the expectation value of the observable.
Experiments demonstrating ensemble quantum computing algorithms have been successfully implemented on NMR spectroscopy spectrometers[2]. Such (an expectation value) Quantum computer can solve some problems in polynomial time that would be non deterministic polynomial time complete (NP complete) on a conventional computer. Other experimental methods have also been used to demonstrate the experimental feasibility of a Quantum computer.
References
- ↑ Shor, P.W (1994), "Algorithms for Quantum Computation: Discrete Logarithms and Factoring", Annual Symposium on Foundations of Computer Science 35: 124–124
- ↑ D.G.Cory, A.Fahmy, T.F.Havel (1997), "Ensemble quantum computing by NMR spectroscopy", Proceedings of the National Academy of Sciences 94 (5): 1634–1639, DOI:10.1073/pnas.94.5.1634