"Quantum freeze" rescues world’s fastest computers

Whilst western Europe is feeling the effects of global warming, a “freeze” has come to the rescue of quantum computing.

Quantum Computers – computers so fast they could break any code devised for a digital computer – have a fatal flaw which has until now made it impossible to build really fast quantum computers. They make so many operations that very rare and tiny errors occur rapidly and are amplified, making them unable to function properly.

The Institute of Physics and German Physical Society journal New Journal of Physics today publishes a paper which describes a phenomenon which could eliminate the majority of these errors and allow these computers to operate at incredible speeds successfully.

Tomaz Prosen and Marko Znidaric, researchers from the University of Ljubljana in Slovenia, have successfully produced what they call a “quantum freeze of fidelity” which under certain conditions eliminates a whole set of errors. Their idea describes the stability of quantum dynamics in a general class of mathematical models. It is believed that the application of this idea in quantum computation will allow scientists to target the most dangerous errors and eliminate them, making super-fast quantum computers possible.

Dr. Prosen said: “The mechanism of the quantum freeze of fidelity, which drastically enhances the stability of quantum computation, is simple and yet has no analogue in classical physics. It is a kind of quantum demon at work. We hope it can be employed in a practical quantum computation.”

At present, quantum computers of about four qubits have been built. A qubit (or quantum bit) represents an arbitrary superposition of zero and one at the same time, e.g. 30% zero and 70% one. Two qubits represent an amplitude (or probability) for every possible two-bit number (e.g. 00, 01, 10, 11). Each additional qubit increases the number of possible numbers exponentially. So, twenty qubits represent every number from 0 to more than one million, 30 qubits represent every number from 0 to more than one billion, and 40 qubits represent every number from 0 to more than one trillion. A quantum computer acts on a set of particles by influencing the probabilities of the particles’’ spins (posing the problem) so that when the particles leave their quantum state the resulting spins represent a specific number (getting the answer).

Quantum computers have the potential to be a thousand times faster than today’s computers because they operate on all the particles – and thus all the possible numbers – simultaneously.

Media Contact

David Reid alfa

Weitere Informationen:

http://stacks.iop.org/1367-2630/5/109

Alle Nachrichten aus der Kategorie: Information Technology

Here you can find a summary of innovations in the fields of information and data processing and up-to-date developments on IT equipment and hardware.

This area covers topics such as IT services, IT architectures, IT management and telecommunications.

Zurück zur Startseite

Kommentare (0)

Schreib Kommentar

Neueste Beiträge

Cyanobacteria: Small Candidates …

… as Great Hopes for Medicine and Biotechnology In the coming years, scientists at the Chair of Technical Biochemistry at TU Dresden will work on the genomic investigation of previously…

Do the twist: Making two-dimensional quantum materials using curved surfaces

Scientists at the University of Wisconsin-Madison have discovered a way to control the growth of twisting, microscopic spirals of materials just one atom thick. The continuously twisting stacks of two-dimensional…

Big-hearted corvids

Social life as a driving factor of birds’ generosity. Ravens, crows, magpies and their relatives are known for their exceptional intelligence, which allows them to solve complex problems, use tools…

By continuing to use the site, you agree to the use of cookies. more information

The cookie settings on this website are set to "allow cookies" to give you the best browsing experience possible. If you continue to use this website without changing your cookie settings or you click "Accept" below then you are consenting to this.

Close