Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Spectrum

Could trapping tiny ions crack the toughest codes?

JR Minkel

Published Mar 1, 2003• 0 citations
Publisher

Abstract

Computers that harness the weirdness of quantum mechanics could smash conventional encryption systems by factoring gigantic numbers fast-and factoring the product of two large prime numbers is the only way standard codes can be broken. The job would take conventional computers decades, not minutes. Encrypted data is still safe for the moment, because a powerful enough quantum computer is still many years away. But physicists have now demonstrated that quantum calculations can be done in a version of a quantum computer that could, in theory at least, be scaled up sufficiently. Rainer Blatt and his colleagues at the University of Innsbruck (Austria), in collaboration with Isaac Chuang of the Massachusetts Institute of Technology (MIT), have run a simple quantum algorithm in a computer that consists of only a single, very cold calcium ion. They employed a standard ion-trapping technique and a series of carefully tuned laser pulses to turn the ion into a computer that calculates using qubits-bits that can exist, seemingly paradoxically, as both a 1 and a 0 simultaneously. The Innsbruck-M IT team put this property of qubits to work in the Deutsch-Jozsa algorithm.

DOI
10.1109/mspec.2003.1184445

Related papers

The Trap Technique

Daniel Stick, Jonathan D. Stern, Christopher R. Monroe

A full-scale quantum computer would work like the standard desktop computer, in that it would have a place to store data, a place where a program manipulates the data, and interconnections to move the data from one to the other. In the computer you are using now, bits of data - stored as quantity of charge or its absence - are transferred from memory to a processor in the form of levels of voltage. At the processor the computer's program determines which logic operations the bits will be subjected to. Once the logic operations are completed, the bits are converted to amounts of charge and stored in memory again. Similarly, in an ion-trap computer, stored qubits would be called from a storage trap to a logic trap, the kind we've been building so far. The two traps would be connected by a long trap that acts like an interconnect or a data bus. It sounds simple, but such a structure would have to be repeated and connected many dozens of times on the same chip to handle the number of ions we'd need. Therefore, a quantum computer equivalent of very-large-scale integration would be required to handle the control circuitry just to move the ions around. The small-scale quantum algorithms that scientists are running today and plan to run in the near future will almost certainly lead to insights that could make full-scale quantum computing, if not easy, at least more tractable.

IEEE Spectrum•Aug 1, 2007•3 citations

Making unbreakable code

Justin Mullins

A product is on the way that relies on the quantum properties of photons to keep out eavesdroppers. All of them. The battle between codemakers and codebreakers is centuries old, but at the start of the 21st century, could it finally be drawing to a close? Physicists are putting the finishing touches to a method of encrypting messages that is more secure than anything that has gone before. Unlike the ciphers of the past, this new method has the potential to be absolutely unbreakable, not just practically unbreakable, but theoretically unbreakable. Mathematicians believe they can prove it. Central to the technique are the strange laws of quantum mechanics. Already experimental messages encrypted using quantum mechanics are being sent over tens of kilometers of optical fibers and received securely. Researchers are confident that it will not be long before ultra-secret messages are routinely transmitted in this way. But while quantum cryptography may be perfect in theory, practical considerations introduce security loopholes that an eavesdropper can exploit. The seriousness of these is still unclear, and physicists believe they can plug most of the holes with more efficient equipment. Still, enough cracks remain to maintain a healthy interest among cryptographers.

IEEE Spectrum•May 1, 2002•12 citations

A Programmable Five Qubit Quantum Computer Using Trapped Atomic Ions

Shantanu Debnath

Quantum computers can solve certain problems more efficiently compared to conventional classical methods. In the endeavor to build a quantum computer, several competing platforms have emerged that can implement certain quantum algorithms using a few qubits. However, the demonstrations so far have been done usually by tailoring the hardware to meet the requirements of a particular algorithm implemented for a limited number of instances. Although such proof of principal implementations are important to verify the working of algorithms on a physical system, they further need to have the potential to serve as a general purpose quantum computer allowing the flexibility required for running multiple algorithms and be scaled up to host more qubits. Here we demonstrate a small programmable quantum computer based on five trapped atomic ions each of which serves as a qubit. By optically resolving each ion we can individually address them in order to perform a complete set of single-qubit and fully connected two-qubit quantum gates and alsoperform efficient individual qubit measurements. We implement a computation architecture that accepts an algorithm from a user interface in the form of a standard logic gate sequence and decomposes it into fundamental quantum operations that are native to the hardware using a set of compilation instructions that are defined within the software. These operations are then effected through a pattern of laser pulses that perform coherent rotations on targeted qubits in the chain. The architecture implemented in the experiment therefore gives us unprecedented flexibility in the programming of any quantum algorithm while staying blind to the underlying hardware. As a demonstration we implement the Deutsch-Jozsa and Bernstein-Vazirani algorithms on the five-qubit processor and achieve average success rates of 95 and 90 percent, respectively. We also implement a five-qubit coherent quantum Fourier transform and examine its performance in the period finding and phase estimation protocol. We find fidelities of 84 and 62 percent, respectively. While maintaining the same computation architecture the system can be scaled to more ions using resources that scale favorably (O(N^2)) with the number of qubits N.

Bulletin of the American Physical Society•Jan 1, 2016•15 citations

QnAs with Christopher Monroe

Chris Samoray

Classic computing can take credit for technology ranging from mobile phones to supercomputers. But in recent years, a budding counterpart to these conventional devices has emerged: quantum computers. Whereas classic computing sometimes fails to solve complex calculations, such as factoring hundred-digit numbers, quantum computing holds the potential to easily tackle such problems. The field of quantum computing has attracted researchers, such as National Academy of Sciences member Christopher Monroe. An experimental atomic physicist at the University of Maryland and fellow of the Joint Quantum Institute and the Joint Center for Quantum Information and Computer Science in Maryland, Monroe uses lasers to exploit atomic particles to study complex computational problems. Monroe spoke to PNAS about how quantum computing might evolve. Christopher Monroe. > PNAS:Can you describe some of the basic mechanics of quantum computing? > Monroe:It all comes down to the superposition principle, in which a quantum system can exist in multiple states at the same time. Consider the fundamental unit of information: the bit. A bit is binary information that can be a 0 or a 1. A quantum bit, or qubit, can be in a superposition of both 0 and 1 as long as it’s isolated and unobserved. A single qubit is pretty trivial, but when you put many qubits together, there become exponentially many possibilities. > > Let’s consider 300 qubits. That’s an interesting number because the number of possible configurations, 2300, is more than the number of particles in the universe. You could never simulate what happens with 300 qubits on a classical machine; there’s not enough stuff in the universe to do it. The magic with quantum is the power of exponential growth: every time you add a qubit, you double the number of configurations. > > But to control these qubits and exploit this massive storage, we …

Proceedings of the National Academy of Sciences•Apr 10, 2017•0 citations

Decoherence limits to quantum computation using trapped ions

Martin Bodo Plenio, P. L. Knight

We investigate the problem of factorization of large numbers on a quantum computer which we imagine to be realized within a linear ion trap. We derive upper bounds on the size of the numbers that can be factorized on such a quantum computer. These upper bounds are independent of the power of the applied laser. We investigate two possible ways to implement qubits, in metastable optical transitions and in Zeeman sublevels of a stable ground state, and show that in both cases the numbers that can be factorized are not large enough to be of practical interest. We also investigate the effect of quantum error correction on our estimates and show that in realistic systems the impact of quantum error correction is much smaller than expected. Again no number of practical interest can be factorized.

arXiv:quant-ph/9610015•Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Oct 8, 1997•107 citations

Simulation of quantum growing network / Ong Boon Teong

Boon Teong Ong

Over the past 40 years there has been a dramatic miniaturization in computer technology. If current trends continue, by the year 2020 the basic memory components of a computer will be the size of individual atoms. At such scales, the current model of computation, based on a mathematical idealization known as the Universal Turing Machine, is simply invalid. A new field, called "quantum computing" is emerging that is re-inventing the foundations of computer science and information theory in a way that is consistent with quantum physics - the most accurate model of reality that is currently known. Remarkably this new theory predicts that quantum computers can perform tasks exponentially faster than any conventional computer. Moreover, quantum effects allow unprecedented tasks to be performed such as teleporting information, breaking supposedly "unbreakable" codes, generating true random numbers, and communicating with messages that betray the presence of eavesdropping. These capabilities are of significant practical importance to banks and government agencies. lndeed, a quantum scheme for sending and receiving ultra-secure messages has already been implemented over a distance of 30km-far enough to wire the financial district of any major city. Modem microprocessors have to be designed with quantum mechanics in mind in order to ensure that they function correctly. In essence they use quantum effects to ensure that their classical computations are upheld. What no current processor does is to fully exploit quantum effects Recently, it took 1,600 computers communicating over the Internet 8 months to solve the factorisation of a 129-digit number. Should it be possible to build a microprocessor which fully exploits quantum mechanics then it may be possible to carry out such factorisations in remarkably less time. The RSA algorithm, a widely used encryption system, is safe only if such factorisations cannot be performed quickly. Although modem computers already exploit some quantum phenomena they do not make use of the full repertoire of quantum phenomena that Nature provides. Harnessing these phenomena will take computing technology to the very brink of what is possible in this Universe.

•Jan 1, 2003•0 citations
Computers that harness the weirdness of quantum mechanics could smash conventional encryption systems by factoring gigantic numbers fast-and factoring the product of two large prime numbers is the only way standard codes can be broken. The job would take conventional computers decades, not minutes. Encrypted data is still safe for the moment, because a powerful enough quantum computer is still many years away. But physicists have now demonstrated that quantum calculations can be done in a version of a quantum computer that could, in theory at least, be scaled up sufficiently. Rainer Blatt and his colleagues at the University of Innsbruck (Austria), in collaboration with Isaac Chuang of the Massachusetts Institute of Technology (MIT), have run a simple quantum algorithm in a computer that consists of only a single, very cold calcium ion. They employed a standard ion-trapping technique and a series of carefully tuned laser pulses to turn the ion into a computer that calculates using qubits-bits that can exist, seemingly paradoxically, as both a 1 and a 0 simultaneously. The Innsbruck-M IT team put this property of qubits to work in the Deutsch-Jozsa algorithm.
A full-scale quantum computer would work like the standard desktop computer, in that it would have a place to store data, a place where a program manipulates the data, and interconnections to move the data from one to the other. In the computer you are using now, bits of data - stored as quantity of charge or its absence - are transferred from memory to a processor in the form of levels of voltage. At the processor the computer's program determines which logic operations the bits will be subjected to. Once the logic operations are completed, the bits are converted to amounts of charge and stored in memory again. Similarly, in an ion-trap computer, stored qubits would be called from a storage trap to a logic trap, the kind we've been building so far. The two traps would be connected by a long trap that acts like an interconnect or a data bus. It sounds simple, but such a structure would have to be repeated and connected many dozens of times on the same chip to handle the number of ions we'd need. Therefore, a quantum computer equivalent of very-large-scale integration would be required to handle the control circuitry just to move the ions around. The small-scale quantum algorithms that scientists are running today and plan to run in the near future will almost certainly lead to insights that could make full-scale quantum computing, if not easy, at least more tractable.
A product is on the way that relies on the quantum properties of photons to keep out eavesdroppers. All of them. The battle between codemakers and codebreakers is centuries old, but at the start of the 21st century, could it finally be drawing to a close? Physicists are putting the finishing touches to a method of encrypting messages that is more secure than anything that has gone before. Unlike the ciphers of the past, this new method has the potential to be absolutely unbreakable, not just practically unbreakable, but theoretically unbreakable. Mathematicians believe they can prove it. Central to the technique are the strange laws of quantum mechanics. Already experimental messages encrypted using quantum mechanics are being sent over tens of kilometers of optical fibers and received securely. Researchers are confident that it will not be long before ultra-secret messages are routinely transmitted in this way. But while quantum cryptography may be perfect in theory, practical considerations introduce security loopholes that an eavesdropper can exploit. The seriousness of these is still unclear, and physicists believe they can plug most of the holes with more efficient equipment. Still, enough cracks remain to maintain a healthy interest among cryptographers.
Quantum computers can solve certain problems more efficiently compared to conventional classical methods. In the endeavor to build a quantum computer, several competing platforms have emerged that can implement certain quantum algorithms using a few qubits. However, the demonstrations so far have been done usually by tailoring the hardware to meet the requirements of a particular algorithm implemented for a limited number of instances. Although such proof of principal implementations are important to verify the working of algorithms on a physical system, they further need to have the potential to serve as a general purpose quantum computer allowing the flexibility required for running multiple algorithms and be scaled up to host more qubits. Here we demonstrate a small programmable quantum computer based on five trapped atomic ions each of which serves as a qubit. By optically resolving each ion we can individually address them in order to perform a complete set of single-qubit and fully connected two-qubit quantum gates and alsoperform efficient individual qubit measurements. We implement a computation architecture that accepts an algorithm from a user interface in the form of a standard logic gate sequence and decomposes it into fundamental quantum operations that are native to the hardware using a set of compilation instructions that are defined within the software. These operations are then effected through a pattern of laser pulses that perform coherent rotations on targeted qubits in the chain. The architecture implemented in the experiment therefore gives us unprecedented flexibility in the programming of any quantum algorithm while staying blind to the underlying hardware. As a demonstration we implement the Deutsch-Jozsa and Bernstein-Vazirani algorithms on the five-qubit processor and achieve average success rates of 95 and 90 percent, respectively. We also implement a five-qubit coherent quantum Fourier transform and examine its performance in the period finding and phase estimation protocol. We find fidelities of 84 and 62 percent, respectively. While maintaining the same computation architecture the system can be scaled to more ions using resources that scale favorably (O(N^2)) with the number of qubits N.
Classic computing can take credit for technology ranging from mobile phones to supercomputers. But in recent years, a budding counterpart to these conventional devices has emerged: quantum computers. Whereas classic computing sometimes fails to solve complex calculations, such as factoring hundred-digit numbers, quantum computing holds the potential to easily tackle such problems. The field of quantum computing has attracted researchers, such as National Academy of Sciences member Christopher Monroe. An experimental atomic physicist at the University of Maryland and fellow of the Joint Quantum Institute and the Joint Center for Quantum Information and Computer Science in Maryland, Monroe uses lasers to exploit atomic particles to study complex computational problems. Monroe spoke to PNAS about how quantum computing might evolve. Christopher Monroe. > PNAS:Can you describe some of the basic mechanics of quantum computing? > Monroe:It all comes down to the superposition principle, in which a quantum system can exist in multiple states at the same time. Consider the fundamental unit of information: the bit. A bit is binary information that can be a 0 or a 1. A quantum bit, or qubit, can be in a superposition of both 0 and 1 as long as it’s isolated and unobserved. A single qubit is pretty trivial, but when you put many qubits together, there become exponentially many possibilities. > > Let’s consider 300 qubits. That’s an interesting number because the number of possible configurations, 2300, is more than the number of particles in the universe. You could never simulate what happens with 300 qubits on a classical machine; there’s not enough stuff in the universe to do it. The magic with quantum is the power of exponential growth: every time you add a qubit, you double the number of configurations. > > But to control these qubits and exploit this massive storage, we …
We investigate the problem of factorization of large numbers on a quantum computer which we imagine to be realized within a linear ion trap. We derive upper bounds on the size of the numbers that can be factorized on such a quantum computer. These upper bounds are independent of the power of the applied laser. We investigate two possible ways to implement qubits, in metastable optical transitions and in Zeeman sublevels of a stable ground state, and show that in both cases the numbers that can be factorized are not large enough to be of practical interest. We also investigate the effect of quantum error correction on our estimates and show that in realistic systems the impact of quantum error correction is much smaller than expected. Again no number of practical interest can be factorized.
Over the past 40 years there has been a dramatic miniaturization in computer technology. If current trends continue, by the year 2020 the basic memory components of a computer will be the size of individual atoms. At such scales, the current model of computation, based on a mathematical idealization known as the Universal Turing Machine, is simply invalid. A new field, called "quantum computing" is emerging that is re-inventing the foundations of computer science and information theory in a way that is consistent with quantum physics - the most accurate model of reality that is currently known. Remarkably this new theory predicts that quantum computers can perform tasks exponentially faster than any conventional computer. Moreover, quantum effects allow unprecedented tasks to be performed such as teleporting information, breaking supposedly "unbreakable" codes, generating true random numbers, and communicating with messages that betray the presence of eavesdropping. These capabilities are of significant practical importance to banks and government agencies. lndeed, a quantum scheme for sending and receiving ultra-secure messages has already been implemented over a distance of 30km-far enough to wire the financial district of any major city. Modem microprocessors have to be designed with quantum mechanics in mind in order to ensure that they function correctly. In essence they use quantum effects to ensure that their classical computations are upheld. What no current processor does is to fully exploit quantum effects Recently, it took 1,600 computers communicating over the Internet 8 months to solve the factorisation of a 129-digit number. Should it be possible to build a microprocessor which fully exploits quantum mechanics then it may be possible to carry out such factorisations in remarkably less time. The RSA algorithm, a widely used encryption system, is safe only if such factorisations cannot be performed quickly. Although modem computers already exploit some quantum phenomena they do not make use of the full repertoire of quantum phenomena that Nature provides. Harnessing these phenomena will take computing technology to the very brink of what is possible in this Universe.