04 Apr 07 Microchip-falls for Quantum Computer

Ulmer physicist realized the first microchip-falls in Europe, which is used for experiments on the way to the scalable quantum computer.

At Institut for quantum data processing of the University of Ulm Stephan Schulz and Ferdinand Schmidt Kaler realized first microchip-falls in Europe, which is used for experiments on the way to the scalable quantum computer.

The prototype of the three-dimensional linear microchip-falls stores individual Ca+ ions, which are arranged like beads on a chain. Each individual ion represents a quantum bit, similarly to the bits of an everyday computer. The future quantum computer will solve unsolvable problems made of computer science and natural science with unusual arithmetic performances by the use of the quantum bits.

In the new microchip-falls the Ca+ ions are stored by electrical fields. A multiplicity of individual control segments permitted for the first time parallel the allocation of the ion chains into separated single ions, which are shifted controlled by electrical tensions. For the operations of the quantum computer individual ions with laser pulses are manipulated and the result of computation is optically picked out.

Fig.: That microchip has a size of 11×11 mm2 and consists of 64 separately controllable electrodes. It is operated with a frequency by 24 MHz in the ultra high vacuum. (Source: University of Ulm)

 

 

The new microchip-falls is world-wide singular due to the number of their control segments. Thus it orders over a separate memory and processor range around the scaling barness of a quantum computer with individual ions to demonstrate for the first time. A goal is the storage and processing of approximately 100 quantum bits - according to an efficiency, which exceeds each conventional computer far.

This the Universtität Ulm-developed quantum devices are the reference design for the development of scalable ion quantum computers, promoted by the European Union. Similar devices are likewise developed at present in the USA.

Source: University of Ulm

Further information:

* Quantum data processing, University of Ulm: http://www.uni-ulm.de/qiv/

25 Mar 07 Quantum existence testing gives extreme solutions to increase network speed

by Liza Zyga

http://www.physorg.com/news93787328.html

Using a novel quantum computing algorithm, scientists have simplified the process for finding extreme values in a database compared with classical and earlier quantum computing methods. With its reduced time and minimal error probability, this quantum process could significantly increase the speed of computing in global and mobile networks.

Sándor Imre, an engineer at the Budapest University of Technology, calls this new computing process “quantum existence testing,” which is a special case of quantum counting. The quantum existence testing algorithm searches unsorted databases to find extreme values, attesting to the intriguing powers of the quantum mechanical effects of parallel processing.

“Compared to classical solutions, the improvement with quantum existence testing is about the square root of N in the case of a database N entry of length,” Imre explained. “For example, if you are able to classically find an extreme value in a database containing 1000 entries in 1 second, then the quantum alternative can handle 1000 such databases during the same time, or a database with 1 million entries.”