Quantum Computing - Revision history

User at 12:39, 28 October 2021

2021-10-28T12:39:55Z

User at 12:36, 28 October 2021

2021-10-28T12:36:34Z

User: The LinkTitles extension automatically added links to existing pages (https://github.com/bovender/LinkTitles).

2021-02-06T17:53:27Z

The LinkTitles extension automatically added links to existing pages (https://github.com/bovender/LinkTitles).

User at 18:30, 12 July 2019

2019-07-12T18:30:09Z

User at 18:27, 12 July 2019

2019-07-12T18:27:07Z

User at 17:50, 12 July 2019

2019-07-12T17:50:52Z

User at 17:33, 12 July 2019

2019-07-12T17:33:06Z

User: Created page with "Quantum computing is a theoretical computing model that uses a very different form of data handling to perform calculations. The emergence of quantum computing is based on a n..."

2019-02-11T17:22:24Z

Created page with "Quantum computing is a theoretical computing model that uses a very different form of data handling to perform calculations. The emergence of quantum computing is based on a n..."

New page

Quantum computing is a theoretical computing model that uses a very different form of data handling to perform calculations. The emergence of quantum computing is based on a new kind of data unit that could be called non-binary, as it has more than two possible values. A traditional computer works on bits of data that are binary, or Boolean, with only two possible values: 0 or 1. In contrast, a quantum bit, or "qubit," has possible values of 1, 0 or a superposition of 1 and 0, in the case of an unknown value. According to scientists, qubits are based on physical atoms and molecular structures. However, many find it helpful to theorize a qubit as a binary data unit with superposition.<ref>Definition: What is Quantum Computing? [https://www.techopedia.com/definition/679/quantum-computing Techopedia]</ref>

== References ==

<references/>

@@ Line 1: / Line 1: @@
-'''Quantum computing''' is a theoretical computing model that uses a very different form of [[data]] handling to perform calculations. The emergence of quantum computing is based on a new kind of data unit that could be called non-binary, as it has more than two possible values. A traditional [[computer]] works on bits of data that are binary, or Boolean, with only two possible values: 0 or 1. In contrast, a quantum bit, or "qubit," has possible values of 1, 0 or a superposition of 1 and 0, in the case of an unknown [[value]]. According to scientists, qubits are based on physical atoms and molecular structures. However, many find it helpful to theorize a qubit as a binary data unit with superposition.<ref>Definition: What is Quantum Computing? [https://www.techopedia.com/definition/679/quantum-computing Techopedia]</ref>
+'''Quantum computing''' is a theoretical computing model that uses a very different form of [[data]] handling to perform calculations. The emergence of quantum computing is based on a new kind of data unit that could be called non-binary, as it has more than two possible values. A traditional [[computer]] works on bits of data that are binary, or Boolean, with only two possible values: 0 or 1. In contrast, a quantum bit, or "qubit," has possible values of 1, 0 or a superposition of 1 and 0, in the case of an unknown value. According to scientists, qubits are based on physical atoms and molecular structures. However, many find it helpful to theorize a qubit as a binary data unit with superposition.<ref>Definition: What is Quantum Computing? [https://www.techopedia.com/definition/679/quantum-computing Techopedia]</ref>
@@ Line 11: / Line 14: @@
 [[File:Quantum_Computing_-_Supposition.png ‎|200px|Quantum Computing - Supposition]]
-'''Entanglement''': Entanglement is a famously counter-intuitive quantum phenomenon describing behavior we never see in the classical world. Entangled particles behave together as a [[system]] in ways that cannot be explained using classical logic.
+'''Entanglement''': Entanglement is a famously counter-intuitive quantum phenomenon describing behavior we never see in the classical world. Entangled particles behave together as a system in ways that cannot be explained using classical logic.
@@ Line 33: / Line 36: @@
 == Quantum Computers Vs. Conventional Computers<ref>What can quantum computers do that ordinary computers can't? [https://www.explainthatstuff.com/quantum-computing.html Explain That Stuff]</ref> ==
-Although people often assume that quantum computers must automatically be better than conventional ones, that's by no means certain. So far, just about the only thing we know for certain that a quantum computer could do better than a normal one is factorisation: finding two unknown prime numbers that, when multiplied together, give a third, known number. In 1994, while working at Bell Laboratories, mathematician Peter Shor demonstrated an [[algorithm]] that a quantum computer could follow to find the "prime factors" of a large number, which would speed up the problem enormously. Shor's algorithm really excited interest in quantum computing because virtually every modern computer (and every secure, online shopping and banking [[website]]) uses public-key encryption technology based on the virtual impossibility of finding prime factors quickly (it is, in other words, essentially an "intractable" computer problem). If quantum computers could indeed factor large numbers quickly, today's online security could be rendered obsolete at a stroke. But what goes around comes around, and some researchers believe quantum technology will lead to much stronger forms of encryption. (In 2017, Chinese researchers demonstrated for the first time how quantum encryption could be used to make a very secure video call from Beijing to Vienna.)
+Although people often assume that quantum computers must automatically be better than conventional ones, that's by no means certain. So far, just about the only thing we know for certain that a quantum computer could do better than a normal one is factorization: finding two unknown prime numbers that, when multiplied together, give a third, known number. In 1994, while working at Bell Laboratories, mathematician Peter Shor demonstrated an [[algorithm]] that a quantum computer could follow to find the "prime factors" of a large number, which would speed up the problem enormously. Shor's algorithm really excited interest in quantum computing because virtually every modern computer (and every secure, online shopping and banking [[website]]) uses public-key encryption technology based on the virtual impossibility of finding prime factors quickly (it is, in other words, essentially an "intractable" computer problem). If quantum computers could indeed factor large numbers quickly, today's online security could be rendered obsolete at a stroke. But what goes around comes around, and some researchers believe quantum technology will lead to much stronger forms of encryption. (In 2017, Chinese researchers demonstrated for the first time how quantum encryption could be used to make a very secure video call from Beijing to Vienna.)
-Does that mean quantum computers are better than conventional ones? Not exactly. Apart from Shor's algorithm, and a search method called Grover's algorithm, hardly any other algorithms have been discovered that would be better performed by quantum methods. Given enough time and computing [[power]], conventional computers should still be able to solve any problem that quantum computers could solve, eventually. In other words, it remains to be proven that quantum computers are generally superior to conventional ones, especially given the difficulties of actually building them. Who knows how conventional computers might advance in the next 50 years, potentially making the idea of quantum computers irrelevant—and even absurd.
+Does that mean quantum computers are better than conventional ones? Not exactly. Apart from Shor's algorithm, and a search method called Grover's algorithm, hardly any other algorithms have been discovered that would be better performed by quantum methods. Given enough time and computing power, conventional computers should still be able to solve any problem that quantum computers could solve, eventually. In other words, it remains to be proven that quantum computers are generally superior to conventional ones, especially given the difficulties of actually building them. Who knows how conventional computers might advance in the next 50 years, potentially making the idea of quantum computers irrelevant—and even absurd.
@@ Line 44: / Line 47: @@
 Of course, before the quantum effects of computing could be realized, scientists and engineers had to more fully develop the technology of traditional computers. This is why, for many years, there was little direct progress, nor even interest, in the idea of making Feynman's suggestions into reality.
-In 1985, the idea of "quantum logic gates" was put forth by the University of Oxford's David Deutsch, as a means of harnessing the quantum realm inside a computer. In fact, Deutsch's paper on the subject showed that any physical [[process]] could be modeled by a quantum computer.
+In 1985, the idea of "quantum logic gates" was put forth by the University of Oxford's David Deutsch, as a means of harnessing the quantum realm inside a computer. In fact, Deutsch's paper on the subject showed that any physical process could be modeled by a quantum computer.
 Nearly a decade later, in 1994, AT&T's Peter Shor devised an algorithm that could use only 6 qubits to perform some basic factorizations ... more cubits the more complex the numbers requiring factorization became, of course.
@@ Line 53: / Line 56: @@
 == Applications of Quantum Computing<ref>Possible Applications of Quantum Computing [https://owdt.com/the-promise-and-challenge-of-quantum-computing/ OWDT]</ref> ==
 Quantum computing could:
-*Speed up the development of drugs; improve chemical [[industry]] [[manufacturing]]; desalinate seawater; and even suck carbon dioxide out of the atmosphere to curb climate change.
+*Speed up the development of drugs; improve chemical industry manufacturing; desalinate seawater; and even suck carbon dioxide out of the atmosphere to curb climate change.
 *Result in the invention of room temperature superconductors that would be impervious to power drain during electrical transmission.
 *Handle problems of image and speech recognition, and provide real-time language translation.
-*Greatly enhance big data processing from sensors, medical records and [[stock]] fluctuations.
+*Greatly enhance big data processing from sensors, medical records and stock fluctuations.
 *And generate many other similarly important applications not yet imaginable.

@@ Line 1: / Line 1: @@
-Quantum computing is a theoretical computing [[model]] that uses a very different form of [[data]] handling to perform calculations. The emergence of quantum computing is based on a new kind of data unit that could be called non-binary, as it has more than two possible values. A traditional [[computer]] works on bits of data that are binary, or Boolean, with only two possible values: 0 or 1. In contrast, a quantum bit, or "qubit," has possible values of 1, 0 or a superposition of 1 and 0, in the case of an unknown [[value]]. According to scientists, qubits are based on physical atoms and molecular structures. However, many find it helpful to theorize a qubit as a binary data unit with superposition.<ref>Definition: What is Quantum Computing? [https://www.techopedia.com/definition/679/quantum-computing Techopedia]</ref>
+'''Quantum computing''' is a theoretical computing model that uses a very different form of [[data]] handling to perform calculations. The emergence of quantum computing is based on a new kind of data unit that could be called non-binary, as it has more than two possible values. A traditional [[computer]] works on bits of data that are binary, or Boolean, with only two possible values: 0 or 1. In contrast, a quantum bit, or "qubit," has possible values of 1, 0 or a superposition of 1 and 0, in the case of an unknown [[value]]. According to scientists, qubits are based on physical atoms and molecular structures. However, many find it helpful to theorize a qubit as a binary data unit with superposition.<ref>Definition: What is Quantum Computing? [https://www.techopedia.com/definition/679/quantum-computing Techopedia]</ref>
@@ Line 7: / Line 7: @@
 Three quantum mechanical properties — superposition, entanglement, and interference — are used in quantum computing to manipulate the state of a qubit.
-'''Superposition'''
+'''Superposition''': Superposition refers to a combination of states we would ordinarily describe independently. To make a classical analogy, if you play two musical notes at once, what you will hear is a superposition of the two notes.
 [[File:Quantum_Computing_-_Supposition.png ‎|200px|Quantum Computing - Supposition]]
-'''Entanglement'''
+'''Entanglement''': Entanglement is a famously counter-intuitive quantum phenomenon describing behavior we never see in the classical world. Entangled particles behave together as a [[system]] in ways that cannot be explained using classical logic.
@@ Line 19: / Line 17: @@
-'''Interference'''
+'''Interference''': Finally, quantum states can undergo interference due to a phenomenon known as phase. Quantum interference can be understood similarly to wave interference; when two waves are in phase, their amplitudes add, and when they are out of phase, their amplitudes cancel.
 [[File:Quantum_Computing_-_Interference.png ‎|300px|Quantum Computing - Interference]]
@@ Line 87: / Line 84: @@
 [[Data Analytics]]<br />
 [[Machine Learning]]]<br />
-[[Quantum Computing]]<br />
+[[Cognitive Computing]]<br />
 [[Statistical Analysis]]<br />

@@ Line 1: / Line 1: @@
-Quantum computing is a theoretical computing model that uses a very different form of data handling to perform calculations. The emergence of quantum computing is based on a new kind of data unit that could be called non-binary, as it has more than two possible values. A traditional computer works on bits of data that are binary, or Boolean, with only two possible values: 0 or 1. In contrast, a quantum bit, or "qubit," has possible values of 1, 0 or a superposition of 1 and 0, in the case of an unknown value. According to scientists, qubits are based on physical atoms and molecular structures. However, many find it helpful to theorize a qubit as a binary data unit with superposition.<ref>Definition: What is Quantum Computing? [https://www.techopedia.com/definition/679/quantum-computing Techopedia]</ref>
+Quantum computing is a theoretical computing [[model]] that uses a very different form of [[data]] handling to perform calculations. The emergence of quantum computing is based on a new kind of data unit that could be called non-binary, as it has more than two possible values. A traditional [[computer]] works on bits of data that are binary, or Boolean, with only two possible values: 0 or 1. In contrast, a quantum bit, or "qubit," has possible values of 1, 0 or a superposition of 1 and 0, in the case of an unknown [[value]]. According to scientists, qubits are based on physical atoms and molecular structures. However, many find it helpful to theorize a qubit as a binary data unit with superposition.<ref>Definition: What is Quantum Computing? [https://www.techopedia.com/definition/679/quantum-computing Techopedia]</ref>
@@ Line 13: / Line 13: @@
 '''Entanglement'''
-Entanglement is a famously counter-intuitive quantum phenomenon describing behavior we never see in the classical world. Entangled particles behave together as a system in ways that cannot be explained using classical logic.
+Entanglement is a famously counter-intuitive quantum phenomenon describing behavior we never see in the classical world. Entangled particles behave together as a [[system]] in ways that cannot be explained using classical logic.
@@ Line 36: / Line 36: @@
 == Quantum Computers Vs. Conventional Computers<ref>What can quantum computers do that ordinary computers can't? [https://www.explainthatstuff.com/quantum-computing.html Explain That Stuff]</ref> ==
-Although people often assume that quantum computers must automatically be better than conventional ones, that's by no means certain. So far, just about the only thing we know for certain that a quantum computer could do better than a normal one is factorisation: finding two unknown prime numbers that, when multiplied together, give a third, known number. In 1994, while working at Bell Laboratories, mathematician Peter Shor demonstrated an algorithm that a quantum computer could follow to find the "prime factors" of a large number, which would speed up the problem enormously. Shor's algorithm really excited interest in quantum computing because virtually every modern computer (and every secure, online shopping and banking website) uses public-key encryption technology based on the virtual impossibility of finding prime factors quickly (it is, in other words, essentially an "intractable" computer problem). If quantum computers could indeed factor large numbers quickly, today's online security could be rendered obsolete at a stroke. But what goes around comes around, and some researchers believe quantum technology will lead to much stronger forms of encryption. (In 2017, Chinese researchers demonstrated for the first time how quantum encryption could be used to make a very secure video call from Beijing to Vienna.)
+Although people often assume that quantum computers must automatically be better than conventional ones, that's by no means certain. So far, just about the only thing we know for certain that a quantum computer could do better than a normal one is factorisation: finding two unknown prime numbers that, when multiplied together, give a third, known number. In 1994, while working at Bell Laboratories, mathematician Peter Shor demonstrated an [[algorithm]] that a quantum computer could follow to find the "prime factors" of a large number, which would speed up the problem enormously. Shor's algorithm really excited interest in quantum computing because virtually every modern computer (and every secure, online shopping and banking [[website]]) uses public-key encryption technology based on the virtual impossibility of finding prime factors quickly (it is, in other words, essentially an "intractable" computer problem). If quantum computers could indeed factor large numbers quickly, today's online security could be rendered obsolete at a stroke. But what goes around comes around, and some researchers believe quantum technology will lead to much stronger forms of encryption. (In 2017, Chinese researchers demonstrated for the first time how quantum encryption could be used to make a very secure video call from Beijing to Vienna.)
-Does that mean quantum computers are better than conventional ones? Not exactly. Apart from Shor's algorithm, and a search method called Grover's algorithm, hardly any other algorithms have been discovered that would be better performed by quantum methods. Given enough time and computing power, conventional computers should still be able to solve any problem that quantum computers could solve, eventually. In other words, it remains to be proven that quantum computers are generally superior to conventional ones, especially given the difficulties of actually building them. Who knows how conventional computers might advance in the next 50 years, potentially making the idea of quantum computers irrelevant—and even absurd.
+Does that mean quantum computers are better than conventional ones? Not exactly. Apart from Shor's algorithm, and a search method called Grover's algorithm, hardly any other algorithms have been discovered that would be better performed by quantum methods. Given enough time and computing [[power]], conventional computers should still be able to solve any problem that quantum computers could solve, eventually. In other words, it remains to be proven that quantum computers are generally superior to conventional ones, especially given the difficulties of actually building them. Who knows how conventional computers might advance in the next 50 years, potentially making the idea of quantum computers irrelevant—and even absurd.
@@ Line 47: / Line 47: @@
 Of course, before the quantum effects of computing could be realized, scientists and engineers had to more fully develop the technology of traditional computers. This is why, for many years, there was little direct progress, nor even interest, in the idea of making Feynman's suggestions into reality.
-In 1985, the idea of "quantum logic gates" was put forth by the University of Oxford's David Deutsch, as a means of harnessing the quantum realm inside a computer. In fact, Deutsch's paper on the subject showed that any physical process could be modeled by a quantum computer.
+In 1985, the idea of "quantum logic gates" was put forth by the University of Oxford's David Deutsch, as a means of harnessing the quantum realm inside a computer. In fact, Deutsch's paper on the subject showed that any physical [[process]] could be modeled by a quantum computer.
 Nearly a decade later, in 1994, AT&T's Peter Shor devised an algorithm that could use only 6 qubits to perform some basic factorizations ... more cubits the more complex the numbers requiring factorization became, of course.
@@ Line 56: / Line 56: @@
 == Applications of Quantum Computing<ref>Possible Applications of Quantum Computing [https://owdt.com/the-promise-and-challenge-of-quantum-computing/ OWDT]</ref> ==
 Quantum computing could:
-*Speed up the development of drugs; improve chemical industry manufacturing; desalinate seawater; and even suck carbon dioxide out of the atmosphere to curb climate change.
+*Speed up the development of drugs; improve chemical [[industry]] [[manufacturing]]; desalinate seawater; and even suck carbon dioxide out of the atmosphere to curb climate change.
 *Result in the invention of room temperature superconductors that would be impervious to power drain during electrical transmission.
 *Handle problems of image and speech recognition, and provide real-time language translation.
-*Greatly enhance big data processing from sensors, medical records and stock fluctuations.
+*Greatly enhance big data processing from sensors, medical records and [[stock]] fluctuations.
 *And generate many other similarly important applications not yet imaginable.

← Older revision		Revision as of 18:30, 12 July 2019
Line 33:		Line 33:

	The quantum Turing machine is theoretically important but the direct implementation of this model is not pursued. All four models of computation have been shown to be equivalent; each can simulate the other with no more than polynomial overhead.		The quantum Turing machine is theoretically important but the direct implementation of this model is not pursued. All four models of computation have been shown to be equivalent; each can simulate the other with no more than polynomial overhead.
		+
		+
		+	== Quantum Computers Vs. Conventional Computers<ref>What can quantum computers do that ordinary computers can't? [https://www.explainthatstuff.com/quantum-computing.html Explain That Stuff]</ref> ==
		+	Although people often assume that quantum computers must automatically be better than conventional ones, that's by no means certain. So far, just about the only thing we know for certain that a quantum computer could do better than a normal one is factorisation: finding two unknown prime numbers that, when multiplied together, give a third, known number. In 1994, while working at Bell Laboratories, mathematician Peter Shor demonstrated an algorithm that a quantum computer could follow to find the "prime factors" of a large number, which would speed up the problem enormously. Shor's algorithm really excited interest in quantum computing because virtually every modern computer (and every secure, online shopping and banking website) uses public-key encryption technology based on the virtual impossibility of finding prime factors quickly (it is, in other words, essentially an "intractable" computer problem). If quantum computers could indeed factor large numbers quickly, today's online security could be rendered obsolete at a stroke. But what goes around comes around, and some researchers believe quantum technology will lead to much stronger forms of encryption. (In 2017, Chinese researchers demonstrated for the first time how quantum encryption could be used to make a very secure video call from Beijing to Vienna.)
		+
		+	Does that mean quantum computers are better than conventional ones? Not exactly. Apart from Shor's algorithm, and a search method called Grover's algorithm, hardly any other algorithms have been discovered that would be better performed by quantum methods. Given enough time and computing power, conventional computers should still be able to solve any problem that quantum computers could solve, eventually. In other words, it remains to be proven that quantum computers are generally superior to conventional ones, especially given the difficulties of actually building them. Who knows how conventional computers might advance in the next 50 years, potentially making the idea of quantum computers irrelevant—and even absurd.
		+
		+
		+
		+	== History of Quantum Computing<ref>History of Quantum Computing [https://www.thoughtco.com/what-is-a-quantum-computer-2699359 ThoughtCo]</ref> ==
		+	Quantum computing tends to trace its roots back to a 1959 speech by Richard P. Feynman in which he spoke about the effects of miniaturization, including the idea of exploiting quantum effects to create more powerful computers. This speech is also generally considered the starting point of nanotechnology.
		+
		+	Of course, before the quantum effects of computing could be realized, scientists and engineers had to more fully develop the technology of traditional computers. This is why, for many years, there was little direct progress, nor even interest, in the idea of making Feynman's suggestions into reality.
		+
		+	In 1985, the idea of "quantum logic gates" was put forth by the University of Oxford's David Deutsch, as a means of harnessing the quantum realm inside a computer. In fact, Deutsch's paper on the subject showed that any physical process could be modeled by a quantum computer.
		+
		+	Nearly a decade later, in 1994, AT&T's Peter Shor devised an algorithm that could use only 6 qubits to perform some basic factorizations ... more cubits the more complex the numbers requiring factorization became, of course.
		+
		+	A handful of quantum computers has been built. The first, a 2-qubit quantum computer in 1998, could perform trivial calculations before losing decoherence after a few nanoseconds. In 2000, teams successfully built both a 4-qubit and a 7-qubit quantum computer. Research on the subject is still very active, although some physicists and engineers express concerns over the difficulties involved in upscaling these experiments to full-scale computing systems. Still, the success of these initial steps does show that the fundamental theory is sound.
		+
		+
		+	== Applications of Quantum Computing<ref>Possible Applications of Quantum Computing [https://owdt.com/the-promise-and-challenge-of-quantum-computing/ OWDT]</ref> ==
		+	Quantum computing could:
		+	*Speed up the development of drugs; improve chemical industry manufacturing; desalinate seawater; and even suck carbon dioxide out of the atmosphere to curb climate change.
		+	*Result in the invention of room temperature superconductors that would be impervious to power drain during electrical transmission.
		+	*Handle problems of image and speech recognition, and provide real-time language translation.
		+	*Greatly enhance big data processing from sensors, medical records and stock fluctuations.
		+	*And generate many other similarly important applications not yet imaginable.
		+
		+
		+	== The Advantages and Disadvantage of Quantum Computing<ref>The Advantages and Disadvantage of Quantum Computing [https://1000projects.org/quantum-computing-advantages-and-disadvantages.html 1000projects.org]</ref> ==
		+
		+	'''Advantages of Quantum Computing'''
		+	*The main advantage of quantum computing is it can execute any task very faster when compared to the classical computer, generally the atoms changes very faster in case of the traditional computing whereas in quantum computing it changes even more faster. But all the tasks can’t be done better by quantum computing when compared to traditional computer.
		+	*In quantum computing qubit is the conventional superposition state and so there is an advantage of exponential speedup which is resulted by handle number of calculations.
		+	*The other advantage of quantum computing is even classical algorithm calculations are also performed easily which is similar to the classical computer.
		+
		+	'''Disadvantages of Quantum Computing'''
		+	*The main disadvantage of computing is the technology required to implement a quantum computer is not available at present. The reason for this is the consistent electron is damaged as soon as it is affected by its environment and that electron is very much essential for the functioning of quantum computers.
		+	*The research for this problem is still continuing the effort applied to identify a solution for this problem has no positive progress.
		+

← Older revision		Revision as of 18:27, 12 July 2019
Line 36:		Line 36:

	== See Also ==		== See Also ==
		+	[[Affective Computing]]<br />
		+	[[Cloud Computing]]<br />
		+	[[Big Data]]<br />
		+	[[Predictive Analytics]]<br />
		+	[[Artificial Intelligence (AI)]]<br />
		+	[[Artificial Neural Network (ANN)]]<br />
		+	[[Data Mining]]<br />
		+	[[Data Analysis]]<br />
		+	[[Data Analytics]]<br />
		+	[[Machine Learning]]]<br />
		+	[[Quantum Computing]]<br />
		+	[[Statistical Analysis]]<br />

@@ Line 1: / Line 1: @@
 Quantum computing is a theoretical computing model that uses a very different form of data handling to perform calculations. The emergence of quantum computing is based on a new kind of data unit that could be called non-binary, as it has more than two possible values. A traditional computer works on bits of data that are binary, or Boolean, with only two possible values: 0 or 1. In contrast, a quantum bit, or "qubit," has possible values of 1, 0 or a superposition of 1 and 0, in the case of an unknown value. According to scientists, qubits are based on physical atoms and molecular structures. However, many find it helpful to theorize a qubit as a binary data unit with superposition.<ref>Definition: What is Quantum Computing? [https://www.techopedia.com/definition/679/quantum-computing Techopedia]</ref>
@@ Line 23: / Line 45: @@
 == Further Reading ==
 *Quantum Computing: A Gntle Introduction [https://c-4tvylwolbz9x24ttyjx2ehtzzx2ejhzx2eju.g00.extremetech.com/g00/3_c-4ddd.leayltlaljo.jvt_/c-4TVYLWOLBZ9x24oaawx3ax2fx2fttyj.htzz.jhz.jux2fasix2f978479x2fD797847991375827911885.wkm_$/$/$/$?i10c.ua=1&i10c.dv=20 Eleanor Rieffel and Wolfgang Polak]
+*