Vn8}nìm $_b;\86IO%J7|Mܴ+) gًd^"J|I&cڿ(\n,!K$, ϗ)г [5+@$en6uwY*i*ͻEN kH:ZpADfv:RPטR s! Y}69ӕ38!_~v4}U|iXէiB.b*"Jo.(Yl6<[KxP06Қ/w>_>"fHX7, cj |QĚp?B{LIP)ф/6b;NʏW`?Bp#'\@P>e>-\ I*Fg\ 4:2|blzpzl}Zxq9Ol 8O/|F8m#ʽ@μ[0N}IR#F ۞[K<,5S.FΩ=?5/cH ̀U,XYqxBrCm@Lݢ9cUԇDj[4rlwcƱȉc>ZK;=m4]ѕ M6D3%xg]ga+eq:~L3~%,%!!Vx&~OHHB66rC 醿eu8a{?{' SE+BZPE(Rr7v:L>J6ڎV6as /'@ Oÿ D9 ^uڶ}?mq51e)1X sitvRia:e== YΡZ/íQEH$'/YyLGHÿ/W5he/U\6-m*N1AȀE/'2Ȧ喫ZU*׍G)lG<ᚥsILݬT.>vӿ**em7*}Y~m7yY+eIrc"kdi82:{cV07IR VvYz= ;;O%=Ce眊V?f9c9$3"$Ir|W<WDYZoX: =„neZ|\e2WۘZ[cu)Bk*Zi>ۑ&Zo]WⶮMP>?#Qij#֬tGA`8ݹt4ucSq#p

Bleeding Edge

Quantum Computing and Qubits

by Cyrus Ance
Apr 03,2003

 

Quantum Computing and Qubits

The idea of a quantum computer is not new. (1) The spark came from Richard Feynmann in 1982 (2) where he thought about the simulation of a quantum-mechanical object by other quantum systems. This discussion led David Deutsch to describe a quantum computer in 1985. (3)

Then began a hunt for algorithms that could take advantage of the unusual properties of a quantum computer. For a long while only contrived examples could be found and there was little challenge to the dominance of classical computers. Peter Shor came up with the killer application for quantum computers in 1994 - factorization (4), that is figuring out the unique set of prime numbers that have to be multiplied together to produce a given number. This may not sound like something of practical interest, but many encryption algorithms have their security based on the difficulty of factorizing large numbers. Today there are many examples of algorithms that are advantageously done on quantum computers including methods to search large data bases (5), finding optimal solutions (the traveling salesman problem is an example), sophisticated signal processing (SETI-like searches) and ironically methods for secure communications. Factorization and secure communications are the reasons that the NSA is a major funder of quantum computing research. New quantum computing algorithms are being found regularly.

While quantum computing shows great promise the realization of a practical quantum computer is proving to be difficult. The key is the basic building block of such a computer: the quantum bit or qubit. Qubits must have the following properties to be a part of a practical quantum computer:

  1. Individually Addressable: Each qubit has to be dealt with singly without disturbing the other qubits.
  2. Initializable: Each qubit has be set to some specific state before the algorithm is run.
  3. Readable: The state of each qubit has to be read out at the end of the algorithm to figure out the result.
  4. Long Coherence Time: The qubit has to sit in whatever state it is in long enough for the algorithm to run to completion.

A few qubit systems running simple algorithms have been realized. Options for qubits include:

  1. Trapped Ions: Individual ionized atoms can be trapped and have different quantum energy levels. These tend to be difficult to read and have short coherence time. It is very difficult to trap many ions and maintain a useful coherence time.
  2. Nuclear Spin: The spin of the nucleus of certain atoms can be controlled and read with magnetic fields. They are difficult to address individually and have short coherence time. You may ask what spin is, but that needs another column.
  3. Trapped Electrons: Looking like the best bet. Electrons, or impurities, can be trapped in nanostructures called quantum dots. The spin or energy quantum state of the electron can be controlled and read with simple electronics. Coherence time remains a problem.
  4. Photon Polarization: Not practical for computing as it is difficult to alter them without destroying them and impossible to store them for any useful time. They are ideal for quantum communication.
All of these have been demonstrated as qubits and a few have actually been used to perform the simplest of quantum algorithms to demonstrate quantum computing. There are many websites that keep track of this fast developing field.(6)

As of today it remains to be seen if a useful quantum computer can actually be built. A break through is needed to demonstrate a qubit technology satisfying all the criteria, something with long coherence time which can be easily set and read is the stumbling block, at low cost. Then millions of them could be coupled together to build a machine that could actually perform a calculation more efficiently than classical computers. The ever growing power and capabilities of classical computers means that the bar for a useful quantum computer keeps getting higher.

Roleplaying Ideas


1 - There are many books on the subject of quantum computers. The Quest for the Quantum Computer by Julian Brown and David Deutsch, one of the pioneers, is a recent good one.

2 - R. Feynman, Int. J. Theor. Phys. 21, 467 (1982).

3 - D. Deutsch, Proc. R. Soc. London A 400, 97 (1985).

4 - P.W. Shor, in Proceedings of the 35th Annual Symposium on the Foundations of Computer Science, edited by S. Goldwasser (IEEE Computer Society Press, Los Alamitos, CA), p. 124 (1994).

5 - Called Grover's algorithm.

6 - Oxford's Qubit.org and links from this site is a good starting point. Any web search on quantum computing will pull up a flood of information. .

TQo0~^DҒt< ek&Ǿ$\۵ZFȃuwݝIŃU QYir2HR2.u3MFoعq]4#A`pP5(b& )b)ⰾp7(i<[-2gL#5[f g?*rVGf8*)s'+20ϟ̑F}KB<7wSL\gbvm9WiRބYŜvd y0'p2I_Fc2>#o A )VL[Qk?3`)<У[(*W.JH ?tXCt谙 X:@ \0w ~LqĤE-rFkYœj4q 5AQ6[AxG [>w|?( fХθY䝛$c=_qNĦoǸ>O_|&/_Mi7"宥CЧk0dӷLh;TmuCGU-!Ul{ h<\bQX.~"O2*yPcz!ŠGg

What do you think?

Go to forum!\n"; $file = "http://www.rpg.net/$subdir/list2.php?f=$num"; if (readfile($file) == 0) { echo "(0 messages so far)
"; } ?>

Previous columns

Other columns at RPGnet

TQo0~^DҒt< ek&Ǿ$\۵ZFȃuwݝIŃU QYir2HR2.u3MFoعq]4#A`pP5(b& )b)ⰾp7(i<[-2gL#5[f g?*rVGf8*)s'+20ϟ̑F}KB<7wSL\gbvm9WiRބYŜvd y0'p2I_Fc2>#o A )VL[Qk?3`)<У[(*W.JH ?tXCt谙 X:@ \0w ~LqĤE-rFkYœj4q 5AQ6[AxG [>w|?( fХθY䝛$c=_qNĦoǸ>O_|&/_Mi7"宥CЧk0dӷLh;TmuCGU-!Ul{ h<\bQX.~"O2*yPcz!ŠGg