Quantum Computing


Contents

Qubit and Entanglement
Quantum Logic Processing
Factoring and Encryption
Searching
Teleportation
Error Correction
Footnotes

Qubit and Entanglement

Quantum Computing Physics and Computer science have combined to create a new field: quantum computing and quantum information. The spark that ignited world wide interest in this new field sprang forth in 1994 with Peter Shor's discovery of a theoretical way to use quantum mechanical resources to unravel a mathematical problem at the heart of electronic commerce and cryptography.

Basic steps towards the creation of a quantum computer have been taken, with the demonstrations of elementary data storage and manipulation using photons and atoms or trapped ions as the quantum bits, or "qubits". Recently, it has been shown that it is possible to build solid-state qubits made from tiny samples of superconducting material. Figure 01 shows some of the subjects, which are currently being investigated in the field of quantum computing.

Figure 01 Qunatum Computing [view large image]

    There are several requirements for a working quantum computer:

  1. It must be scalable: it needs a set of qubits that can be added to indefinitely.
  2. It must be possible to set all of the qubits to a simple initial state, such as all 0.
  3. The interactions between qubits must be controllable enough to make quantum logic gates.
  4. To perform operations using these gates, the decoherence times must be much longer than the gate-operation time (typically milliseconds to seconds).
  5. There must be some readout capability.
  6. To link up the computer's circuitry, it must be possible to convert memory qubits into processing qubits, and vice versa.
  7. It must be possible to move processing qubits accurately between specified locations.
Qubit Qunatum computing exploits two resources offered by the laws of quantum mechanics: the principle of superposition of states and the concept of entanglement. Superposition is a "one-particle" property; while entanglement is a characteristic of two or more particles.

Consider a particle with spin such as the electron. With reference to a given axis (say along the z axis), the spin of the particle can point in two opposite directions, say "up" or "down", and the spin states can be denoted as |1 and |0. But by the laws of quantum mechanics, the particle can exist in a superposition of these two states (or wave of probability), corresponding to arbitrary orientation as shown in Figure 02.

Figure 02 Qubit [view large image]

Mathematically, the superposition of these two states can be written as:
|f = a |1 + b |0 ------ (1)
where a and b are related to the probability of finding the electron in state |1 and |0 respectively satisfying
|a|2 + |b|2 = 1. This normalization defines the total probability of finding the electron to be 1. In general, the
|1 and |0 states can be represented by any two-states entity such as "on" and "off", horizontal and vertical polarization of a photon, one particle vs no particle, ... etc.
|f is called a qubit. If a photon in state |f passes through a polarizing beamsplitter -- a device that reflects (or transmits) horizontally (or vertically) polarized photons -- it will be found in the reflected (or transmitted) beam with probability |a|2 (or |b|2). Then the general state |f has been projected either onto |1 or onto |0 by the action of the measurement (sometimes it is referred as collapse or decoherence of |f). Thus according to the rule of quantum mechanics, a measurement of the qubit would yield either
|1 or |0 but not |f (See Figure 02).
Entanglement1 Entanglement2 Now, consider a two-particle state: there are four "basis states",
|11|12, |01|02, |11|02 and
|01|12, where the subscript indicates particle 1 and 2. Again, superpositions can be made of these states, including in particular, the four "maximally entangled Bell states":
|11|12 + |01|02 ------ (2)
|11|12 - |01|02   ------ (3)

Figure 03 Entangle-ment [view large image]

Figure 04 Entanglement Implementation
[view large image]

|11|02 + |01|12  ------ (4)
|11|02 - |01|12   ------ (5)
Such Bell states have the peculiar property that the particles always "know" about each other, even if they are separated by huge distances; this property is commonly associated with the "non-locality" of quantum mechanics. Entanglement such as this is a basic ingredient of quantum computing. Figure 03 shows that a measurement of one entangled member will determine the outcome for the other member -- either in the same state if the Bell state is Eq.(2), Eq.(3) or in the opposite state if the Bell state is Eq.(4), Eq.(5). Figure 04 shows an experiment that implements the entangled states of two photons.
Teleportation Suppose particle 1 which Alice wants to teleport is in the initial state:
|f1 = a |11 + b |01 ------ (6)
and the entangled pair of particles 2 and 3 shared by Alice and Bob is in the state:
|f23 = (|12|03 - |02|13)/21/2 ------ (7)
which is produced by an Einstein-Podolsky-Rosen (EPR) source1.
The teleportation scheme works as follows. Alice has the particle 1 in the initial state |f >1 and particle 2. Particle 2 is entangled with particle 3 in the hands of Bob. The essential point is to perform a joint Bell-state measurement (BSM)2 on particles 1 and 2 which projects them onto the entangled state:

Figure 05 Teleportation [view large image]

|f12 = (|11|02 - |01|12)/21/2 ------ (8)
This is only one of four possible Bell states into which the two particles can be entangled. The state given in Eq.(8) distinguishes itself from the others by the fact that it changes sign upon interchanging particle 1 and 2. This unique anti- symmetric feature plays an important role in the experiment.

According to the rule of quantum physics once particles 1 and 2 are projected into |f12, particle 3 is instantaneously projected into the initial state of particle 1. (See top portion of Figure 05). This is because when we observe particles 1 and 2 in the state |f12 we know that whatever the state of particles 1 is, particle 2 must be in the opposite state. But we had initially prepared particle 2 and 3 in the state |f23, which means particle 2 must be in the opposite state of particle 3. This is only possible if particle 3 is in the same state particle 1 was initially. The final state of particle 3 is therefore:

|f3 = a |13 + b |03 ------ (9)

Note that during the Bell-state measurement particle 1 loses its identity because it becomes entangled with particle 2. Therefore the state |f1 is destroyed on Alice's side during teleportation.

The transfer of quantum information from particle 1 to
particle 3 can happen instantly over arbitrary distances, hence the name teleportation. Experimentally, quantum entanglement has been shown to survive over distances of the order of 10 km. In the teleportation scheme it is not necessary for Alice to know where Bob is. Furthermore, the initial state of particle 1 can be completely unknown not only to Bob but to anyone. It could even be quantum mechanically completely undefined at the time the Bell-state measurement takes place. This is the case when particle 1 itself is a member of an entangled pair and therefore has no well-defined properties on its own. This ultimately leads to entanglement swapping (See lower portion of Figure 05).

A complete Bell-state measurement not only give the result that the two particles 1 and 2 are in the antisymmetric state in Eq.(8), but with equal probabilities of 25% we could find them in any one the remaining three Bell states. When this happens, the state of particle 3 is determined by one of these three different states. Therefore Alice has to inform Bob, via a classical communication channel, which of the Bell state result was obtained; depending on the message, Bob leaves the particle unaltered or changes it to the opposite state. Either way it ends up a replica of particle 1. It should be emphasized that even if it can be demonstrated for only one of the four Bell states as discussed above, teleportation is successfully achieved, albeit only in a quarter of the cases.
Type Qubit Initialization Interaction Data Transmission Detection Coherence
Time
Error Rate(%)
1 or 2 Qubits
Infrared Photon Polarization Stimulated Emission Beam Splitter Waveguide Avalanche Photodiode 0.1 ms 0.016/1
Trapped Ion Energy Levels
(Occupancy)
Optical Pumping Electric Fields Induced Vibrations Optical Fluorescence 15 s 0.48/0.7
Trapped Atom Energy Levels
(Occupancy)
Optical Pumping Atomic Interaction Laser Beams Optical Fluorescence 3 s 5
Liquid Molecule Nuclear Spins Spin Orientations Radio-frequency Pulse Molecular Electron Coupling Radio-frequency Pulse Induced Current 2 s 0.01/0.47
e- Spin (GaAs Quantum Dot) Electron Spin States Optical Pumping Electrical or Optical Voltage Variation Spin-to-Charge Conversion 3 s 5
e- Spin (P in Si) Electron Spin or P Nuclear Spin Optical Pumping e--Nuclear Hyperfine Coupling Voltage Variation Optical Pulses QND Measurement 0.6 s 5
29Si Nuclear Spin in 28Si Nuclear Spin of 29Si Optical Pumping e--Nuclear Hyperfine Coupling Voltage Variation Optical Pulses QND Measurement 25 s 5
NV Center in Diamond Spin State of N + C-Vacancy Optical Pumping Resonant Microwave Voltage Variation Optical Microscope 2 ms 2/5
Superconducting Circuit Energy Levels RF Pulse Capacitive or Inductive Coupling resonant cable Magnetometer or Electrometer 4 s 0.7/10

Table 01 Types of Qubit

Photonic Entanglement Quantum computing requires entanglement between qubits. It is usually produced by sending a single photon through a certain type of crystal lattice (such as the beam splitter). The process is not very reliable until recently in June 2010, a technique has been found to generate an entangled pair of photon from a quantum dot with 82% reliability. The InAs quantum dot is embedded in a GaAs LED. When the LED is supplied with electric current, two electrons hop into two positively charged "holes" in the quantum dot's lattice, releasing a pair of entangled photon (Figure 06c). There are rooms for improvement in producing more reliable quantum dot (that can be used to generate entangled pair) and in raising the operating temperature from 5oK.

Figure 06c Photonic Entanglement

In Figure 06c The "R" and "L" in the Bell state represent right- and left-handed circularly polarization and the first label denotes photon #1 (blue), the second label for photon #2 (green), e.g., |RL> means photon #1 in right polarization, photon #2 in left polarization.

[Top]


Quantum Logic Processing

Logic Gates Controlled-NOT Conventional computers process information by breaking it up into its component bits and operating of those bits a few at a time. These computers consist primarily of electronic circuits including bits, wires, and gates. Bits can be implemented by ferrite cores (in memory), magnetic spots (in hard-disk), or the on and off of the voltages. These bits can be sent along wires to the logic gates for processing. It has been shown that any desired logical expression, including complex mathematical calculations, can be built up out of the OR, AND, NOT, and COPY gates (see Figure 06d).

Figure 06d Logic Gates
[view large image]

Figure 07 Controlled-NOT Operation

In quantum computing the bits can be implemented by nuclear spins (up or down), polarization of the photons (horizontal or vertical), superconducting loop (clockwise or counter-clockwise of the supercurrent loop), ... etc. Each bit is now associated with states |1 or |0 corresponding to, e.g., spin up or spin down. The states can be superposed to form |1 + |0 or
|1 - |0 corresponding to rotate the spinning axis 90o or 270 o respectively. The spinning axis can be flipped by radio wave matching the hyperfine structure (the energy difference between the spin up and down states) of the nuclear spin. The axis would be rotated by 90o if the wave is applied for 1/4 of the time it takes for the spin to precess one cycle, and so on.

Entanglement is achieved by the controlled-NOT logic operation as shown in Figure 07. It transforms the quantum states:
|0|0 to |0|0,
|0|1 to |0|1,
|1|0 to |1|1,
|1|1 to |1|0.
That is, the controlled-NOT operation flips the input state whenever the control state is |1. Such controlled-NOT logic gate can be constructed by interaction with the kind of radio wave mentioned above. It has been shown that the rotations of individual quantum bits, together with the controlled-NOT operations constitute a universal set of quantum logic operations similar to the classical logic operations in Figure 06d.

The advantage with quantum computing associates mainly with "quantum parallelism", which allows a single quantum processor to performs several tasks at once. For example considering the |1 + |0 state, each one of the two components can be
Number of Entangled States Quantum Parallelism processed individually at the same time, i.e., a quantum computer can perform two computations simultaneously. The concept can be generalized to more than two input states by superposing many input states into a single entangled state (Figure 08a). It is like the individual instruments in a symphony (Figure 08b), each one plays its own notes. The combination of all the different tones makes the music rich and pleasing. One of the problems with quantum computing is that the processing cannot be

Figure 08a Number of Entangled States

Figure 08b Symphonic Parallelism
[view large image]


disturbed in the middle of its run, otherwise the operation will be terminated prematurely by decoherence.


Quantum Computing Example

Figure 08c Quantum Computing Example [view large image]


[Top]


Factoring and Encryption

Factoring is one of the hard problems that can be solved relatively easy by quantum computing. A number is factorizable if it can be produced by multiplying two or more integers greater than 1. Some number such as 2, 3, 5, 7, 11, 13, ... are not factorizable. They are called prime numbers. The result of multiplying two large prime numbers each with 200 digits is a 400 digits number. The run time increases linearly with additional number of digits. Thus, the forward operation is tedious, but the reverse becomes very difficult. It requires essentially the examination of all possible 200 digits numbers in turn until the one that can divide the 400-digit number. The run time now increases exponentially with additional number of digits until the resources reach a state of exhaustion for some large but finite number of digits. It is called intractable in technical jargon. One of the largest classical computations ever performed was factoring a 200-digit number a few years ago. It was shown in 1994 that even a relatively small quantum computer, with only a few thousand qubits, could factor a 400-digit number with ease via quantum parallelism. In the real world only the number 15 has been factored by a 7-qubit computer a few years ago.

Encryption Factoring large numbers is the basis for a powerful method of information protection. It utilizes a technique called public key cryptography. For example (see Figure 09), Alice sends a public key consisting of a large number (equals to the product of two smaller prime numbers) to Bob. Bob uses this public key to scramble or encode the returning message. Alice then decode the message with the private key consisting of the two original prime numbers. Since it is very difficult to factor the public key, the information is secure, that is, until the arrival of the quantum computing age.

Figure 09 Encry- ption

Recalling that data encryption is used to protect messages and files from prying eavesdroppers. In its simplest form, a coded
Quantum Encryption message can be created in which each letter is substituted with the letter that is two down from it in the alphabet. So "A" becomes "C", "B" becomes "D", ... and so on. The recipient was told that the code (key) is: "Shift by 2". He/she can then decodes the message accordingly. Anyone else will only see a garbled message. Modern encryption employs two keys to provide greater security. The sender selects a public-key such as 1525381, which is the product of two prime numbers: 10667 and 143. This key is used to convert a block of text via an algorithm (a formula for combining the key with the text). The recipent must used a private key such as 143 to decode the encrypted text in the reverse process. The security of public-key cryptography depends on factorization - the fact that it is easy to compute the product of two large numbers but extremely hard to factor it back into the primes. But the

Figure 10 Quantum Encryption

advent of the quantum information era - and, in particular, the capability of quantum computers to rapidly perform monstrously challenging factorizations - may portend the eventual demise of such cryptographic scheme.
    Unlike public-key cryptography, quantum cryptography should remain secure when quantum computers arrive on the scene. One way of sending a quantum-cryptographic key between sender and receiver requires that a very low intensity laser transmits single photons that are polarized in one of two modes as shown in Figure 10. Followings illustrate the steps in establishing the key (see Figure 10):

  1. Alice sends a photon through either the 0 or 1 slot of the rectilinear or diagonal polarizing filters, while making a record of the various orientations.
  2. For each incoming bit, Bob chooses randomly which filter slot he uses for detection and writes down both the polarization and the bit value.
  3. After all the photons have reached Bob, he tells Alice over a public channel, perhaps by telephone or an e-mail, the sequence of filters he used for the incoming photons, but not the bit value of the photons.
  4. Alice tells Bob during the same conversation which filters he chose correctly. Those instances constitute the bits that Alice and Bob will use to form the key that they will use to encrypt messages.
  5. If Eve the eavesdropper tries to spy on the train of photons, she may create errors when wrong filters are used to intercept the photons. The crucial safeguard is in hiding the key established by Alice and Bob.
Beginning in 2003, two companies introduced commercial products that send a quantum-cryptographic key beyond the 30 cm in the initial experiment. It has been shown that the use of fibre-optic cable can extend the transmission distance to 60-100 km. Other companies are trying to improve the products with transmission distance up to 150 km. The problem with transmission distance is related to the low laser intensity and the inability to use repeater (to amplify the signal). Similar to Eve's unsuccessful attempt, the repeater would introduce errors to the key.

[Top]


Searching

Searching is another hard problem that quantum computers are potentially good at solving. Only 10 quantum searches are required for searching something that could be in 100 possible places, whereas it needs 50 classical searches to find the object. In general, the number of quantum searches required to locate something is the square root of the number of places in which it could be found. This is the Grover's algorithm for searching an unsorted database with N entries in N1/2 time and using log N storage space. It was invented by Lov Grover of Bell Laboratories in 1996.

In order to exploit the symphonic nature of quantum parallelism, all parts of the quantum computation must be allowed to interfere with one another. But like writing a symphony, arranging the necessary quantum interference is tricky, so much so that there are only a few quantum algorithms, such as factoring and searching, are currently better than their classical analogs.

[Top]


Teleportation

The actual experimental setup for teleportation is shown in Figure 11 completed successfully over a distance of 600 meters across the River Danube. According to the usual convention, Bob's photon 3 was transported inside an 800 meter long optical fibre in a public sewer located underneath the river, where it is exposed to temperature fluctuations and other environmental factors (the real world). The entangled photon pairs (0,1) and (2,3) are created in the beta-barium borate (BBO) crystal by a pulsed UV laser. Photon 0 serves as the trigger. Photons 1 and 2 are guide into a optical-fibre beam splitter (BS) connected to
Teleportation over River Danube the polarizing beam splitters (PBS) for Bell-state measurement (BSM). The logic electronics identify the Bell state and convey the result through the microwave channel (RF unit) to Bob's electro-optic modulator (EOM). Depending on the message, it either leaves the photon state unaltered or changes it to the opposite state. Note that because of the reduced velocity of light within the fibre-based quantum channel, the classical signal arrives about 1.5 microseconds before photon 3. Thus, there is enough time to set the EOM correctly before photon 3 arrives. Polarization rotation (which introduces errors) in the fibres is corrected by polarization controllers (PC) before each run of measurements.

Figure 11 Teleportation over River Danube [view large image]

Polarization stability proved to be better than 10o on the fibre between Alice and Bob, corresponding to an ideal teleportation fidelity of 0.97.

[Top]


Error Correction

Quantum error correction is essential if quantum computer is to work properly because of the fragility of quantum states in the presence of noise. In conventional computer, error correction methods usually involve the gathering of information from the system (such as creating redundant bits). For a quantum system this would cause the unavoidable disturbance associated with observation. It is not possible to generate copies of the original state without destroying it.
    Therefore, quantum error correction is performed differently as shown in the followings:
  1. Prepare the primary physical qubit such as P = a |1 + b |0, which is to be protected from error.
  2. Prepare two auxiliary A1 = |1, A2 = |1, which are then entangled with the primary qubit to form a logical state.
  3. Noise (causing random error) is applied to this logical state, which is represented by P, A1, A2 in Figure 13.
  4. The primary qubit is decoded from the auxiliary qubits. Now P is separated from A1, A2.
  5. Syndrome measurement, which can determine if the error is a bit flip, or a sign (of the phase) flip, or both, is performed on the four possibilities for the auxiliary states A1, A2, e.g.,
    1. |1|1 for no error - association of the most often outcome with the most easily distinguishable measurement.
    2. |1|0 for auxiliary state 2 flipped - no correction required.
    3. |0|1 for auxiliary state 1 flipped - no correction required.
    4. |0|0 for primary qubit flipped - e.g., both the bit and sign are flipped: P = -a |0 + b |1.
  6. The primary state has been altered in Case 4. Appropriate correction is applied to recover the primary qubit initial state.
Error Correction Such error-correction protocols have been implemented in 2004 using three beryllium atomic-ion qubits (the qubits comprise the two electronic ground state hyperfine levels, which are equated to the two spin 1/2 states - up and down) confined to a linear, multi-zone trap. The trap acts like a quantum register with the internal state of each ion playing the role of a qubit. It has been demonstrated that fidelity of 0.7 - 0.8 can be achieved in the experiments. However, the method works well only when at most one of the three qubits undergoes a spin-flip error. Figure 13 shows the transportation of the ions in the trap during the error-correction protocol as a function of time. Each experiment requires approximately 4 ms to perform. The ions are kept together by careful tuning of the phases of the optical-dipole force. Refocusing operations are required to counteract qubit dephasing caused by fluctuations in the local magnetic field.

Figure 13 Quantum Error Correction [view large image]

There is a fundamental obstacle before quantum computers can become a practical reality: decoherence, which is the loss of the very quantum property (superposition) that such computers would rely on. Decoherence stems from the tiniest stray interactions with the ambient environment, and thus most quantum computer designs seek to isolate the sensitive working elements from their surroundings. It is found that even perfect isolation would not keep dechoherence at bay. A process called spontaneous symmetry breaking will ruin the delicate state required for quantum computing. In the case of one proposed device based on superconducting qubits, it is predicted that this new source of decoherence would degrade the qubits after just a few seconds. However, quantum error correction may come to the rescue once the coherence time is long enough. By running on batches of qubits that each last for only a second, a quantum computer as a whole can continue working indefinitely.

[Top]


Footnotes

1An EPR-source is used to provide an entangled pair. An example is the decay of the pi meson into an electron-positron pair. Since the spin for the pi meson is 0, the spin for the electron-positron pair must be opposite according to the conservation of angular momentum. Therefore, no matter how far apart are the members of this pair, if the spin is flipped for one of the member, the spin for the other member will also be flipped to the opposite at precisely the same moment. This non-local influence (non-locality) occur instantaneously, as if some form of communication, which Einstein called a "spooky action at a distance", operates not just faster than the speed of light, but infinitely fast. Figure 04 is another method to prepare entangled pair. In this case, it is the entanglement of the horizontal and vertical polarizations of the photon. It has been demonstrated recently in 2004 that entanglement and teleportation is possible using pair of trapped ions such as Ca+ or Be+.

2To achieve projection of photon 1 and 2 into a Bell state the two photons are superposed at a beam splitter.