A step toward quantum computers Nov. 22, 2006

Courtesy University of Utah and World Science staff

Physicists say they’ve taken a step toward building computers that work at blinding speeds thanks to the weird realities of quantum physics, the science of subatomic particles. Physicist Christoph Boehme works with equipment that he uses to show the feasibility of a quantum computer's reading data stored in the form of atomic "spins." (Courtesy John Lupton, U. of Utah) In a study to appear in the December issue of the research journal Nature Physics, they claim to show the possibility of reading data stored in the form of the “spins” of atoms. These spins “can be measured by very subtle electric currents passing through,” said the University of Utah’s Christoph Boehme, one of the researchers. This resolves “a major obstacle for building a particular kind of quantum computer,” called the phosphorus-and-silicon type, he added. The problem involves how to get the computer to read data. Many roadblocks remain, he cautioned. “If you want to compare the development of quantum computers with classical computers, we probably would be just before the discovery of the abacus.” Modern computers contain transistors, electrical switches that store data in pieces called bits. A bit is a chunk of information consisting of either a 0 or a 1, representing either no electrical charge, or some charge, respectively. A computer with three bits thus contains eight possible combinations of the two digits: 111, 011, 101, 110, 000, 100, 010 and 001. Three bits in an ordinary, digital computer can store only one of those eight groups at a time. Quantum computers would be based on the strange principles of quantum mechanics, in which the smallest particles can be in different places at the same time. In a quantum computer, one “qubit,” or quantum bit, could be 0 and 1 simultaneously. So with three qubits, the device could store all eight combinations at once, and calculate eight times faster than a three-bit digital computer. With more bits, the quantum computer’s advantage grows exponentially. A quantum computer with 64 qubits would be faster by 2 to the 64th power, or about 18 billion billion times, than a typical personal computer. A question is how to physically represent the 0s and 1s in a quantum computer. One approach is to encode this as the “spins” of the nuclei, or cores, of atoms. Subatomic particles have a property known as spin, which is akin, though not identical, to actual spinning: in short, they can act somewhat as though they were spinning. Scientists infer this from the fact that they act as tiny magnets, and also are electrically charged. A moving charge creates a magnetic field according to certain rules. For subatomic particles, a spinning motion can account for the measured magnetic fields. The calculations show that particles can spin in two opposite directions, termed “up” and “down.” The reason actual spinning isn’t believed to occur is that if it did, at the speed required, parts of the particle’s surface would move faster than light. That would violate Einstein’s well-established Theory of Relativity. In a spin-based quantum computer, down and up spins would represent 0 and 1. One qubit could have a both values simultaneously. Boehme’s study follows a quantum computing strategy proposed in 1998 by Australian physicist Bruce Kane. In such a computer, phosphorus atoms would be sprinkled into a stick of silicon, the semiconductor used in digital computer chips. The goal is to keep phosphorus atoms from being too close together, which would let them interact in a way that disrupts the information. Data would be encoded in the spins of those atoms’ nuclei. Externally applied electric fields could serve to read the spins. In this way, Boehme and colleagues wrote that they were able to read the combined spin of 10,000 of the nuclei and electrons—charge-carrying particles—of phosphorus atoms near the silicon’s surface. A real computer would need to read the spins of single particles, not thousands. But past efforts, based on a technique called magnetic resonance, were able to read only the combined spins of the electrons of 10 billion phosphorus atoms, Boehme said. So the new work represents a million-fold improvement, and shows single spins are readable in principle—though it would take another 10,000-fold improvement, Boehme argues. But the study’s point, he added, is that it shows one can electrically “read” data stored as not only electron spins but as the more stable spins of nuclei. The researchers used a sliver of silicon crystal about three times the width of a human hair. The nuclear spin of one phosphorus atom would store one qubit. The scientists then allowed a tiny electrical current to run through the device. The current’s exact size would depend on the spin direction of the phosphorus electrons. That gives “a readout of phosphorus electron spins,” which in turn also reveals the spins of the nuclei, since the two have a known relationship, Boehme said.
http://www.world-science.net/othernews/061120_quantum-computer.htm


Qubits poised to reveal our best-kept secrets

Quantum computers could soon be breaking the codes that protect our data from prying eyes

IF RSA IS CRACKED,HERE IS PLAN B
News that researchers have finally built a quantum computer capable of reliably running Shor's algorithm has left cryptographers split over its implications. Some say that quantum computers are nowhere near ready for real-world code breaking, while others believe that cryptography will be forced to move on from its cosy prime-number- based encryption technologies. The power of Shor's algorithm lies in its potential to use quantum processes to factorise large prime numbers. Just about every strong encryption system relies on the inability of today's computers to do this in any kind of reasonable time. The nightmare for cryptographers would be to find that someone has developed a quantum computer capable of using a massively parallel algorithm, such as Shor's, that would speed this process up to the point at which it became practical and that is precisely what White and Lu's teams say will now be possible.

UNRESOLVED FACTORS
Some cryptographers are not worried. "Nothing has changed," says Bill Munro of the quantum information processes group at Hewlett-Packard's research laboratories in Bristol, UK. "Going from factoring 15 to factoring a large number is a huge challenge."
John Callas, head of technology at the cryptographic software house PGP in Palo Alto, California - maker of the RSA- based Pretty Good Privacy encryption system - says the task fadng the wannabe quantum RSA code breakers is the difference between making one transistor and making a 370-million transistor Pentium processor. White and Lu's work used just four qubits. "We currently use about 4000 bits in RSA," Callas says. Cracking that would require a quantum computer with about 50 trillion qubits, he calculates. "We haven't even put that many transistors down on a microchip yet."
What's more, the goalposts are moving. The length of keys is getting longer as traditional computers, thanks to Moore's law, become more powerful, which will push the number of qubits required even higher, (alias says. This is not to say that the number of qubits in quantum computers won't increase. "The major stumbling block to scaling at the moment is to make single-photon sources and detectors that are very efficient," says Daniel Browne of University College London, who is a member of Lu's team.
Research into quantum-dot-based sources and detectors is improving them fast, however. Eventually, the number ofqubits in quantum computers is expected to increase to a point where they can outperform traditional computers and eventually a limit to the length of encryption keys will be reached, but that could be 50 years away. When it eventually happens, where will that leave encryption? "cryptographers are smart guys," says Munro. "Shor's algorithm may be a problem for factoring-based codes but there are other cryptographic systems out there that don't use primes." Hash chains, which use sequential encoding processes, are one example, says Callas. At the moment there is no known way to break these using a quantum computer. "The whole reason that a quantum computer is so fast is that it can be massively parallel," says (alias. "But that doesn't help with a computation that by definition requires you to wait to calculate one thing before you calculate another."

QUANTUM vs QUANTUM
Cryptographers can also turn the quantum beast against itself, of course. Quantum cryptography, which uses entanglement to securely exchange cryptographic keys, currently only works on point-to-point links over relatively short distances and relies on optical networks for its transmission. This makes it impractical for low-end security applications such as buying goods online - but that could all change. By the time quantum computers become a real threat, this may not be the case. "If we have 10 years' warning we can move out of the way of the quantum train," Callas says. "If we have only three years, we may have to hustle. But we could still probably outrun it."
Duncan Graham-Rowe

SASWATO DAS, NEW YORK CITY

IT MIGHT seem like an esoteric achievement of interest to only a handful of computer scientists, but the advent of quantum computers that can run a routine called Shor's algorithm could have profound consequences. It means the most dangerous threat posed by quantum computing the ability to break the codes that protect our banking, business and e-commerce data - is now a step nearer reality.
Adding to the worry is the fact that this feat has been performed by not one but two research groups, independently of each other. One team is led by Andrew White at the University of Queensland in Brisbane, Australia, and the other by Chao- Yang Lu of the University of Science and Technology of China, in Hefei. Both groups have built rudimentary laser-based quantum computers that can implement Shor's algorithm - a mathematical routine capable of defeating today's most common encryption systems, such as RSA.
RSA is an example of public key cryptography, in which a user holds a pair of mathematically related strings of data, known as a public key and a private key. The public key is widely distributed and used to encrypt messages, while the private key is kept secret and used to decrypt them. An attacker who does not have the private key needs to work out the two very large prime numbers which, multiplied together, make up the public key. Find those factors and you can work out the private key. RSA's security rests on the extreme difficulty of doing this: today's digital computers are just not powerful enough to find the factors of a large key in any practical length of time.
For instance, to find the prime factors of a 10-digit public key, approximately 100,000 calculations are needed; for a 50-digit number about 10 trillion trillion are required. IBM's Blue Gene supercomputer would take a fraction of a second to crack a 10-digit key, but about 100 years for a 50-digit key. And keys are now much longer than 50 digits.
In 1994, mathematician Peter Shor at Bell Labs in New Jersey developed a routine that radically reduces the time required to make those calculations. There was just one rather large catch: it could only run on a computer that exploits quantum mechanics.
Shor's algorithm provides a short cut to finding prime factors by looking for telltale patterns in remainders when a key is divided by a prime factor. Because of the vast number of possible factors for a long key, Shor's algorithm needs to perform a huge number of mathematical operations in parallel - an ability only offered by the quantum bits, or qubits, that carry information in a quantum computer. Thanks to quantum superposition, qubits can inhabit multiple logical states simultaneously, whereas a digital bit can only exist in one state at a time.
The difficulty now is building a quantum computer big enough to carry out the calculations in a reasonable time. Approaches currently being researched include lasers, superconductors, ion traps and quantum dots. The first implementation of Shor's algorithm was achieved in 2001, when an IBM-led team built a quantum computer using nuclear magnetic resonance (NMR) to run calculations in fluorocarbon molecules. The five fluorine nuclei and two carbon nuclei in a molecule acted as seven qubits: the magnetic spin of each nucleus represented the qubit's state - say, up for 1 and down for 0. Because spin is a quantum property the researchers reckoned the nuclei could be "entangled" into a state that is a mix of both spin up and spin down at the same time - allowing the quantum computer to make calculations in parallel.How long will our banks be safe?

Using NMR, the researchers manipulated nuclear spins and coaxed the qubits through Shor's algorithm. As they had hoped, it  gave the correct prime factors for 15 as 5 and 3, but doubts emerged over the experiment's quantum credentials."The NMR was valuable early work. But it is not clear that there was any quantum entanglement in it," White says, and Lu agrees. And there is another problem with NMR: the technology does not scale up. "As the number of NMR qubits increases, the signal disappears in thermal noise," says Carl Williams, of the US National Institute of Standards and Technology in Gaithersburg, Maryland. Instead of manipulating nuclear spin, both White and Lu's teams plumped for photonic quantum computers. Both used femtosecond lasers to generate photon pairs, which they passed through polarising bismuth borate crystals to create entangled qubits. Using optical devices such as filters, they manipulated the qubits to cajole them into running Shor's algorithm - once again factorising 15 into its constituent primes and reading the results using polarisers and single photon detectors. Despite the fact that both teams have, like the IBM-led NMR group, only factored the number 15, California-based IT security specialist Bruce Schneier says the way the scientists have done it - with standard lab optics - means problems for encryption may not be far away. Scaling up to solve bigger problems "is now more or less an engineering problem", he says. "There is no need to panic right now," Schneier says, as cryptography would survive even if RSA was cracked. "RSA has lived with the possibility of being cracked for many years. There are lots of other algorithms, and we'll shift to those." Computers like White and Lu's are not powerful enough to pose a threat to the world's data, but that may not last. "If we could perform calculations for much larger numbers, then fundamental changes would be needed in cryptography," says White. "And there are paths to a fully scalable quantum computer." So what does he expect to become of the RSA system when such a quantum computer is finally built? "It will go overnight," he says.
15 September 2007 New Scientist


www.000webhost.com