The trap technique

Quantum computing started when Peter Shor, a theoretical mathematician at Bell Labs discovered an algorithm for a quantum computer that can efficiently determine the prime factors of a large integer. Shor's algorithm has sparked a worldwide race to build a machine powerful enough to crack codes. The first step in building a quantum computer is to find a quantum bit or qubit. Since the discovery of trapped beryllium ions as qubit to perform logic operations, physicists have come up with at least half a dozen potential ways to do quantum computation. Qubit, being the heart of any quantum computer, has the ability to have two values simultaneously called the principle of superposition. It allows a register of qubits to hold exponentially more information than the register with the same number of classical bits. A set of requirements is needed if it were used as a quantum computer. These include setting the qubits to 0 at the start of the calculation, reading the answer after the calculation, qubits must last long enough to run a program, computer must carry out two fundamental operations and the system's basic architecture must be able to handle large number of qubits. The small scale quantum algorithms that scientists are running today and plan to run in the future will lead to insights that could make full-scale quantum computing.

Duke Scholars

Author Christopher R Monroe Electrical and Computer Engineering