Jump to content

Qubit: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
Changed the first sentence about measurement outcomes to remove ambiguity
RckmRobot (talk | contribs)
I have attempted to make this page much more readable by the common man. Linkification help would be appreciated.
Line 1: Line 1:
:''A qubit is not to be confused with a [[cubit]], which is an ancient measure of length.''
:''A qubit is not to be confused with a [[cubit]], which is an ancient measure of length.''


A '''quantum bit''', or '''qubit''' (sometimes ''qbit'') is a unit of [[quantum information]]. That information is described by a [[Quantum state|state vector]] in a 2-level quantum mechanical system which is [[formally]] equivalent to a two-dimensional [[vector space]] over the [[complex number]]s. The two [[Basis_(linear algebra)|basis]] states (or [[vector space|vector]]s) are conventionally written as <math>|0 \rangle </math> and <math>|1 \rangle </math> (pronounced: 'ket 0' and 'ket 1') as this follows the usual [[bra-ket notation]] of writing [[quantum states]].
A '''quantum bit''', or '''qubit''' (sometimes ''qbit'') is a unit of [[quantum information]]. That information is described by a [[Quantum state|state vector]] in a 2-level quantum mechanical system which is [[formally]] equivalent to a two-dimensional [[vector space]] over the [[complex number]]s.

[[Benjamin Schumacher]] discovered a way of interpreting quantum states as information. He came up with a way of compressing the information in a state, and storing the information on a smaller number of states. This is now known as Schumacher compression. Schumacher is also credited with inventing the term qubit.

==Bit vs. Qubit==
A [[bit]] is the base of computer information. Regardless of its physical representation, it is always read as either a 0 or a 1. An analogy to this is a light switch - the down position can represent 0 (normally equated to ''off'') and the up position can represent 1 (normally equated to ''on'').

A qubit has some similarities to a classical bit, but is overall very different. Like a bit, a qubit can have only two possible values - normally a 0 or a 1. The difference is that whereas a bit ''must'' be either 0 or 1, a qubit can be 0, 1, or a [[superposition]] of both.

==Representation==
The states a qubit may be measured in are known as [[Basis_(linear algebra)|basis]] states (or [[vector space|vector]]s). As is the tradition with any sort of [[quantum states]], Dirac, or [[bra-ket notation]] is used to represent them.

This means that the two computational basis states are conventionally written as <math>|0 \rangle </math> and <math>|1 \rangle </math> (pronounced: 'ket 0' and 'ket 1').

==Qubit States==
A [[pure qubit state]] is a linear [[quantum superposition|superposition]] of those two states. This means that the qubit can be represented as a linear combination of <math>|0 \rangle </math> and <math>|1 \rangle</math>:


A [[pure qubit state]] is a linear [[quantum superposition]] of those two states. This means that each qubit can be represented as a linear combination of <math>|0 \rangle </math> and <math>|1 \rangle</math>:


: <math>| \psi \rangle = \alpha |0 \rangle + \beta |1 \rangle,\,</math>
: <math>| \psi \rangle = \alpha |0 \rangle + \beta |1 \rangle,\,</math>


where α and β are [[probability amplitude]]s and can in general be [[Complex number|complex]]. α and β are constrained by the equation


where α and β are [[probability amplitude]]s and can in general be [[Complex number|complex]].
: <math>| \alpha |^2 + | \beta |^2 = 1. \,</math>


When we measure this qubit in the standard basis, the probability of outcome "0" is <math>| \alpha |^2</math> and in that case the qubit is changed to state <math>|0 \rangle</math>. The probability that the outcome is "1" is <math>| \beta |^2</math> and in that case the state becomes <math>|1 \rangle</math>. Note that the two probabilities sum to 1.
When we measure this qubit in the standard basis, the probability of outcome <math>|0 \rangle </math> is <math>| \alpha |^2</math> and the probability that the outcome is <math>|1 \rangle </math> is <math>| \beta |^2</math>. Because the absolute squares of the amplitudes equate to probabilities, it follows that α and β must be constrained by the equation


In general therefore an individual qubit is in a [[superposition]] of both the <math>|0 \rangle </math> and the <math>|1 \rangle </math> states. Measurement of the qubit will collapse this superposition in to one or other of the states with the probability discussed above. This is significantly different from the state of a classical [[bit]], which can only take the value 0 or 1.


: <math>| \alpha |^2 + | \beta |^2 = 1 \,</math>
When qubits are used in a [[quantum computer|quantum computation]] the computation must be carried out a number of times such that the appropriate answer is obtained. This is due to the superposition of states that qubit is in; each measurement will give an answer in line with the probabilities associated with each [[basis state]]. In order to be confident of the answer obtained, we merely perform the calculation many times and observe the distribution of results.


An important distinguishing feature between a qubit and a classical bit is that multiple qubits can exhibit [[quantum entanglement]]. Entanglement is a [[nonlocal]] property that allows a set of qubits to express [[quantum superposition]]s of different binary strings (01010 and 11111, for example) simultaneously. Entanglement is a necessary ingredient of any quantum computation that cannot be done efficiently on a classical computer. The use of entanglement in quantum computing has been referred to as "quantum parallelism", and offers a possible explanation for the power of quantum computing: because the state of the computer can be in a quantum superposition of many different classical computational paths, these paths can all proceed concurrently.


simply because this ensures you must measure either one state or the other.
A number of qubits taken together is a [[quantum register|qubit register]]. [[Quantum computer]]s perform calculations by manipulating qubits.


The [[state space]] of a single qubit register can be represented geometrically by the [[Bloch sphere]]. This is a two dimensional space which has an underlying geometry of the surface of a sphere. This essentially means that the single qubit register space has two local degrees of freedom. An ''n''-qubit register space has 2<sup>''n''+1</sup> − 2 degrees of freedom. This is much larger than 2''n'', which is what one would expect classically with no [[quantum entanglement|entanglement]]. The reason for this difference is that a qubit can be represented by any point on the surface of the sphere, while a classical bit can only be represented by the very top or very bottom of the sphere.
Similarly, a unit of quantum information in a 3-level quantum system is called a [[qutrit]], by analogy with the unit of classical information [[trit]]. The term "'''Qudit'''" is used to denote a unit of quantum information in a ''d''-level quantum system.

==Measurement==
[[Benjamin Schumacher]] discovered a way of interpreting quantum states as information. He came up with a way of compressing the information in a state, and storing the information on a smaller number of states. This is now known as Schumacher compression. Schumacher is also credited with inventing the term qubit.
Because of [[quantum mechanics]], any measurement of a quantum system inevitably alters the system. Much like [[Schrödinger's cat]], a qubit can exist in more than one state, but measuring that qubit causes that superposition to collapse into one state or the other, according to the probabilities mentioned above.

Obviously, if measurement of the state collapses it into one of the basis states, it becomes very hard to measure the precise amplitudes α and β, or their corresponding probabilities. If one seeks to find these amplitudes, they may recreate the superposition and make multiple measurements. Other methods of finding the amplitudes without disrupting the superpositioned qubit are being studied, but have proven very difficult to implement.

==Entanglement==
An important distinguishing feature between a qubit and a classical bit is that multiple qubits can exhibit [[quantum entanglement]]. Entanglement is a [[nonlocal]] property that allows a set of qubits to express higher correlation than is possible in classical systems. Take, for example, two entangled qubits in the [[Bell state]]


<math>|\Phi^+\rangle = \frac{1}{\sqrt{2}} (|00\rangle + |11\rangle)</math>


(Note that in this state, there are equal probabilities of measuring <math>|00\rangle</math> and <math>|11\rangle</math>).
Imagine that these two entangled qubits are separated, with one each given to Alice and Bob. Alice makes a measurement of her qubit, obtaining - with equal probabilities - either <math>|0\rangle</math> or <math>|1\rangle</math>. Because of the qubits' entanglement, Bob must now get the exact same measurement as Alice, i.e. if she measured a <math>|0\rangle</math>, Bob must measure the same, as <math>|00\rangle</math> is the only state where Alice's qubit is a <math>|0\rangle</math>.

Entanglement also allows multiple states (such as are the [[Bell state]] mentioned above) to be acted on simultaneously, unlike classical bits that can only have one value at a time. Entanglement is a necessary ingredient of any quantum computation that cannot be done efficiently on a classical computer.

The use of entanglement in quantum computing has been referred to as "quantum parallelism", and offers a possible explanation for the power of quantum computing: because the state of the computer can be in a quantum superposition of many different classical computational paths, these paths can all proceed concurrently.

===Quantum Register===
A number of entangled qubits taken together is a [[quantum register|qubit register]]. [[Quantum computer]]s perform calculations by manipulating qubits within a register.


==Variations of the Qubit==
The [[state space]] of a single qubit register can be represented geometrically by the [[Bloch sphere]]. This is a two dimensional space which has an underlying geometry of the surface of a sphere. This essentially means that the single qubit register space has two local degrees of freedom. An ''n''-qubit register space has 2<sup>''n''+1</sup> − 2 degrees of freedom. This is much larger than 2''n'', which is what one would expect classically with no [[quantum entanglement|entanglement]].
Similar to the qubit, a [[qutrit]] is a unit of quantum information in a 3-level quantum system. This is analagous to the unit of classical information [[trit]]. The term "'''Qudit'''" is used to denote a unit of quantum information in a ''d''-level quantum system.


==External links==
==External links==

Revision as of 20:46, 9 June 2006

A qubit is not to be confused with a cubit, which is an ancient measure of length.

A quantum bit, or qubit (sometimes qbit) is a unit of quantum information. That information is described by a state vector in a 2-level quantum mechanical system which is formally equivalent to a two-dimensional vector space over the complex numbers.

Benjamin Schumacher discovered a way of interpreting quantum states as information. He came up with a way of compressing the information in a state, and storing the information on a smaller number of states. This is now known as Schumacher compression. Schumacher is also credited with inventing the term qubit.

Bit vs. Qubit

A bit is the base of computer information. Regardless of its physical representation, it is always read as either a 0 or a 1. An analogy to this is a light switch - the down position can represent 0 (normally equated to off) and the up position can represent 1 (normally equated to on).

A qubit has some similarities to a classical bit, but is overall very different. Like a bit, a qubit can have only two possible values - normally a 0 or a 1. The difference is that whereas a bit must be either 0 or 1, a qubit can be 0, 1, or a superposition of both.

Representation

The states a qubit may be measured in are known as basis states (or vectors). As is the tradition with any sort of quantum states, Dirac, or bra-ket notation is used to represent them.

This means that the two computational basis states are conventionally written as and (pronounced: 'ket 0' and 'ket 1').

Qubit States

A pure qubit state is a linear superposition of those two states. This means that the qubit can be represented as a linear combination of and :



where α and β are probability amplitudes and can in general be complex.

When we measure this qubit in the standard basis, the probability of outcome is and the probability that the outcome is is . Because the absolute squares of the amplitudes equate to probabilities, it follows that α and β must be constrained by the equation



simply because this ensures you must measure either one state or the other.

The state space of a single qubit register can be represented geometrically by the Bloch sphere. This is a two dimensional space which has an underlying geometry of the surface of a sphere. This essentially means that the single qubit register space has two local degrees of freedom. An n-qubit register space has 2n+1 − 2 degrees of freedom. This is much larger than 2n, which is what one would expect classically with no entanglement. The reason for this difference is that a qubit can be represented by any point on the surface of the sphere, while a classical bit can only be represented by the very top or very bottom of the sphere.

Measurement

Because of quantum mechanics, any measurement of a quantum system inevitably alters the system. Much like Schrödinger's cat, a qubit can exist in more than one state, but measuring that qubit causes that superposition to collapse into one state or the other, according to the probabilities mentioned above.

Obviously, if measurement of the state collapses it into one of the basis states, it becomes very hard to measure the precise amplitudes α and β, or their corresponding probabilities. If one seeks to find these amplitudes, they may recreate the superposition and make multiple measurements. Other methods of finding the amplitudes without disrupting the superpositioned qubit are being studied, but have proven very difficult to implement.

Entanglement

An important distinguishing feature between a qubit and a classical bit is that multiple qubits can exhibit quantum entanglement. Entanglement is a nonlocal property that allows a set of qubits to express higher correlation than is possible in classical systems. Take, for example, two entangled qubits in the Bell state



(Note that in this state, there are equal probabilities of measuring and ). Imagine that these two entangled qubits are separated, with one each given to Alice and Bob. Alice makes a measurement of her qubit, obtaining - with equal probabilities - either or . Because of the qubits' entanglement, Bob must now get the exact same measurement as Alice, i.e. if she measured a , Bob must measure the same, as is the only state where Alice's qubit is a .

Entanglement also allows multiple states (such as are the Bell state mentioned above) to be acted on simultaneously, unlike classical bits that can only have one value at a time. Entanglement is a necessary ingredient of any quantum computation that cannot be done efficiently on a classical computer.

The use of entanglement in quantum computing has been referred to as "quantum parallelism", and offers a possible explanation for the power of quantum computing: because the state of the computer can be in a quantum superposition of many different classical computational paths, these paths can all proceed concurrently.

Quantum Register

A number of entangled qubits taken together is a qubit register. Quantum computers perform calculations by manipulating qubits within a register.

Variations of the Qubit

Similar to the qubit, a qutrit is a unit of quantum information in a 3-level quantum system. This is analagous to the unit of classical information trit. The term "Qudit" is used to denote a unit of quantum information in a d-level quantum system.

Template:Link FA