In my previous question I asked who invented a quantum computer using qubits.

As a follow-up to this question I want to ask who built the first quantum computer using at least two qubits.

During my research I have discovered that in 1998, Jonathan A. Jones and Michele Mosca developed a quantum computer using two qubits specifically to solve Deutsch's problem. Have there been other working quantum computers before to solve other problems or general attempts not specifically bound to one problem?

  • $\begingroup$ @Blue, is it better now? $\endgroup$ Commented Mar 24, 2018 at 20:17
  • 5
    $\begingroup$ Great question. I am unaware of any demonstrable quantum computer before this, but have access to a ton of old research materials and will do some digging this weekend to see what I can find. $\endgroup$
    – whurley
    Commented Mar 24, 2018 at 20:27

4 Answers 4


What is a qubit? And what is a quantum computer? Any claim about about which is first will depend on our definitions.

One suggestion might be the 1981 experiment by Aspect, Grangier and Roger to demonstrate a violation of Bell’s inequality.

My arguments for this are:

  • It uses a physical degree of freedom (photon polarization) which has since been considered for qubits.
  • It performs a task (Bell’s inequality violation) that has since been used in quantum information theoretic tasks (like cryptography).

So though the authors would have had no concept of their setup being a two qubit quantum computer at the time, I’d say that it was.

For some other early two qubit systems, see references 7, 8 and 9 in this paper (which has arguably the first 3 qubit system).


It's difficult to define the point where an experimental setup is a quantum computer. But the crucial feature of a quantum computer is that it's able to perform a quantum computation. The first experimental realization of an algorithm was indeed Jones' and Mosca's implementation of the Deutsch algorithm in 1998 using an NMR setup.

Of course previous experiments showed components that could be used in a quantum computer.

However, it is quite reasonable to demand that a quantum computer is able to perform arbitrary arithmetics, whether programmable or by minor adjustments to the setup. By this definition we don't have a quantum computer, yet. This is related to the DiVincenzo Criteria for Quantum Computers.


An honorable mention might go to Bennett, Brassard, Ekert, Smolin, and friends' prototype tabletop machine for implementing the BB84 protocol, built in the late '80s and described in Scientific American in 1992.

In his article on the history of quantum cryptography, Brassard states:

Essentially without any special budget allocated to the project, we were able, in late October 1989, to establish history’s first secret quantum transmission, over a staggering distance of 32.5 centimetres...!

This used a plurality of qubits, way more than two as in the question, but all in a product state. It's more akin to a quantum computer in the same way that the Enigma machine is akin to a (Turing-complete) classical computer.

Nonetheless Brassard comments that the act of building the prototype did cause physicists to start paying attention to quantum cryptography, and I would offer by extension, to quantum computing.

Bb84 Prototype

I remember seeing it in my copy of Scientific American when it was published in '92. About two years after the SciAm article, Shor announced his factoring algorithm. (Shor has suggested that he was aware of BB84, and presumably of this machine in particular, prior to the development of the factoring algorithm.) All of this was before the word "qubit" was even coined.

Such a lovely piece of history. I wonder whether any pieces of the prototype still exists.


Another noteworthy example of an early quantum computer may be Kwiat, Weinfurter, Herzog, Zeilinger, and Kasevic's early-90's instantiation of their improved bomb-tester, based on the quantum Zeno effect. See a pdf of their Phys Rev Letters article. See also a pdf of their Scientific American article, from which the below image was taken:

Kwiat et al. bomb tester

This device uses interaction-free measurement to freeze a polarized photon in a particular orientation, or otherwise to let the photon slowly rotate to a different basis, depending on whether a bomb is present or not.

I think it can be argued that this is a "quantum computer" that uses "qubits" in the sense that it performs quantum operations (rotations) to make a decision on whether or not a bomb is present, in a manner that is completely non-classical.

Also, although an idealized version has been described as a "one-qubit" computer, at least the specific implementation of Kwiat et al. utilized spontaneous parametric down-conversion that generated two entangled photons/qubits, with one photon being measured to herald the presence of the other.

This is from the mid-90's and doesn't pre-date Aspect, Grangier, and Roger's Bell violation experiment of the early 80's, but I would argue it is a bit more computational in a certain sense, and hints at more to come of the potential power of quantum computation. The experimental results were submitted to PRL in '94, which makes it pretty contemporaneous with Shor's algorithm.

Both Zeilinger and Aspect are Nobel laureates, for good reason! But Zeilinger's work here on the bomb tester wasn't explicitly mentioned by the Nobel committee, although Aspect's work mentioned by @JamesWootton on the Bell violations was.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.