| An entangled state of two photons produced by shining a laser through a nonlinear crystal (see above) All computers used today follow a classical physics approach. That is, a 'bit' of information is stored in a physical system (as a voltage, magnetic spin or light pulse) which can take two sharp values, 0 and 1. However, by harnessing quantum properties, which are quite different from classical ones, totally new types of computing processes could be developed. The crucial feature of a quantum system - for example, a photon or an atom - is that it may not exist in a sharply defined state (like an 'up' or 'down' magnetic spin) but in a so-called superposition of states (both 'up' and 'down' simultaneously). This means that a single quantum bit, called a qubit, can be in two states at the same time and thus encode two values. A two-particle system, such as a pair of interacting atoms or photons, gives a superposition of four states; a three-particle system eight states and so on. Such an approach offers extraordinary possibilities - for example, mathematical operations on multiple numbers could be performed simultaneously to create a superfast, massively parallel computer. Towards a real quantum computer The concept of quantum computing started with theorist Richard Feynman who showed that a classical computer could not simulate quantum processes efficiently; a quantum computation was required. Later in 1985, David Deutsch, in a leap of imagination, proposed that a universal computer operating on quantum principles could simulate any physical process. Deutsch with Richard Josza then showed how a quantum computer could answer a set problem more quickly than by any classical route, giving a clear hint of its potential. At first, quantum computing seemed to have little practical value. Then in 1994, Peter Shor at AT&T Bell Laboratories in New Jersey came up with a quantum algorithm for factorising large numbers very efficiently. It is extremely difficult to factorise such numbers by classical means; a 1000-digit number would take longer than the age of the Universe. For this reason, factorising large numbers is fundamental to the security of encoded systems in use today. However, a quantum computer could do it in a fraction of a second! More recently, Lov Grover at Bell Labs in Murray Hill, New Jersey developed an incredibly fast quantum search algorithm. Since most computer operations involve searching, such a program would speed up computing immensely. Recognising the potential power of quantum computing, researchers worldwide are now investigating physical quantum systems in which the superposition of states could be manipulated (a quantum logic gate) so as to form the basis of a practical computer. One way to achieve a superposition of states is to shine a laser on an ion trapped in a cage of magnetic fields. A laser pulse of the right frequency and certain duration excites the ion from its ground state to an excited state (from state 0 to 1). A pulse lasting only half that time pushes the ion into a quantum superposition of both states. Researchers are currently experimenting with logic gates based on lasers and arrays of cooled ions in traps. Another promising approach exploits nuclear magnetic resonance, in which a combination of strong magnetic and radio-frequency fields is used to control the nuclear spin states of hydrogen and carbon atoms in organic molecules. Each nucleus can either be spin-up or spin-down, thus encoding the qubit, and each molecule acts as an individual computer. Researchers at Oxford, for example, are currently experimenting with the DNA base cytosine. Other techniques involve using photons in nonlinear crystals and optical fibres, and electronic states in quantum dots. One of the main obstacles to quantum computing is the phenomenon of decoherence. Coherent superpositions remain stable only as long as they do not interact with their environment, otherwise they collapse into one of the constituent values. While some people think that decoherence is an insurmountable problem, others such as Shor, Deutsch and Andrew Steane at Oxford have been designing quantum error correction methods to compensate for decoherence. Like their classical counterparts, these methods are based on building-in redundancy, so that the same information is spread over many qubits. BT's quantum cryptography system. The two computers are connected by 28 kilometres of optical fibre in the Ipswich area of BT's public network Universal quantum computers may still be some way off, but one particular application - using quantum phenomena in secret communications - is nearer to commercial viability (see below). Quantum cryptography relies on a simple one-qubit set-up which may be encoded in the polarisations or phases of a string of photons. BT has already carried out a demonstration over 28 kilometres of optical fibre looped between Martlesham and Ipswich. Another intriguing application of quantum processing is the 'teleportation' of a particle state over a large distance without physically moving the particle. The future At the moment researchers are designing 'toy quantum computers with just a handful of qubits. Realistically, systems of thousands of qubits would be needed to create a useful computer. There are already plans to design larger arrays of qubits in solid-state systems that would be more compatible with current silicon and optical fibre technology. We can expect some exciting developments in the near future. |