Justin Trudeau, the Canadian Prime Minister, rocked the world recently by talking about quantum computers in front of reporters at Perimeter Institute…
No fault can be found in his answer, although his answer cannot be more layman. A few physicists were challenged to give a layman introduction about quantum computers, and they are equally well. (See MacLean’s article.)
The research about quantum computers has been for decades, and it is not until recently some commercial products are available in the market.
Qubits and Quantum Entanglement
Trudeau is right that in quantum computers, a bit, called a qubit, is more than just 0 and 1, but a complicated combination of them. It can be characterized by a quantum state , where and are complex numbers. Such a state can be geometrically demonstrated as a Bloch sphere, where the possibility of a state is infinitely more than simply up and down.
Besides qubits, quantum entanglement makes quantum computing unique, because with entanglement it allows algorithms to be calculated in parallel at the same time by its nature. Quantum entanglement concerns the correlation between two qubits in a way that the quantum state of the two qubits cannot be separated into two independent quantum states, each for one qubit. There are many ways to quantify the entanglement of a bipartite state (consisting of two qubits), such as entanglement entropy (similar to Shannon entropy, see this, where the probability is on the partial density matrix calculated by Schmidt decomposition), and negativity. [Peres, 1996]
The qubits and entanglement make quantum algorithms possible. It is a big research field, bordering physics and computer science. See “Quantum Algorithm Zoo” cataloged by NIST for them. Shor’s algorithm and Grover’s algorithm are some of the famous ones.
There are two types of quantum computers in general, namely, the universal quantum computer (UQC), and non-universal adiabatic quantum computer (AQC).
Universal Quantum Computer (UQC)
UQC, the quantum computers that exploit quantum properties to perform computations that are classically infeasible, has been studied for decades in academia. Not only the quantum algorithms, the realization of hardware has always been one of the hot topics of scientific research. Although much time and money has been invested, it is still far from industrial and commercial use.
The first UQC on earth was made in MIT in 1998, by Isaac Chuang and his colleagues, using NMR techniques. [Chuang et. al., 1998] There are also other experimental realization of qubits, such as optical cavity, Josephson junction, quantum dots, nanomechanical resonator etc. Representations depend on the physics systems.
If this is successfully realized in industrialized use, it speeds up a lot of computations by fully applying the quantum algorithms.
Adiabatic Quantum Computer (AQC)
AQC does not fully exploit the quantum properties. While there are qubits, the algorithms may not be fully applied. Instead, it partially exploits quantum properties to accelerate current algorithms. It takes advantage of adiabatic theorem, which states that a slow perturbation to a quantum system remains the instantaneous eigenstate. This means, if the quantum system starts at a ground state, it stays at the ground state after the slow perturbation due to some external field. This process possibly involves quantum tunneling. AQC is actually a type of quantum annealing.
There are already some commercial applications of AQC. D-Wave Systems made their first AQC in the world, and a number of big companies such as Lockheed Martin and Google purchased them. D-Wave systems are based on Josephson junctions. It is programmable, and most suited to optimization problems. One can write their own optimization problem in terms of the Ising model:
The system will start at an initial system with its ground state, and slowly changing the interactions to this Hamiltonian. The state will be the ground state, or the optimized solution, of the problem.
We can immediately see that, in the era of big data, this is very useful as machine learning problems are optimization problems. For example, QxBranch, a startup based on Washington, DC, developed tools using D-Wave Systems to perform some machine learning algorithms.
Topological Quantum Computer
In some sense, an AQC is only a partial quantum computer, which does not employ full quantum properties. However, a UQC is hard to achieve because of quantum decoherence. A state can exist for only a very short time. There exist ways to avoid this, for example, optimal dynamic decoupling. [Fu et. al., 2009] Another fascinating idea to overcome this is topological quantum computing.
A topological quantum computer is a theoretical quantum computer that is based on anyons, a two-dimensional quasi-particles with world lines crossing over in three-dimensional world. It was first introduced in 1997 by Alexei Kitaev. The idea is to exploit the ideas of topology in anyons to preserve the state, because it is extremely costly to change the topology of a system. In 2005, Das Sarma, Freedman, and Nayak proposed using fractional quantum Hall system to achieve this. [Das Sarma et. al., 2006] Some ideas such as Majorana fermions have been proposed too. All in all, topological quantum computing is still a theoretical idea.
- Aaron Hutchins, “Trudeau versus the experts: Quantum computing in 35 seconds,” MacLean’s (2016).
- “Bloch Sphere,” Wikipedia.
- L. N. Hoang, “Shannon’s Information Theory“, Science4All (2013).
- Kwan-yuet Ho, “The Legacy of Entropy,” WordPress (2015).
- “Negativity (quantum mechanics),” Wikipedia.
- A. Peres, “Separability Criterion for Density Matrices,” Phys. Rev. Lett. 77, 1413 (1996).
- Quantum Algorithm Zoo, National Institute of Standards and Technology.
- M. A. Nielsen, I. L. Chuang, Quantum Computation and Quantum Information, Cambridge, UK (2002).
- Lecture notes of “Quantum Computation” by John Preskill (Caltech) can be found at: http://www.theory.caltech.edu/people/preskill/ph229/
- B. Zeng, X. Chen, D.-L. Zhou, X.-G. Wen, “Quantum Information Meets Quantum Matter: From Quantum Entanglement to Topological Phase in Many-Body Systems,” arXiv:1508.02595 (2015).
- I. L. Chuang, L. M. K. Vandersypen, X. Zhou, D. W. Leung, S. Lloyd, “Experimental realization of a quantum algorithm,” Nature 393, 143-146 (1998).
- “Adiabatic Theorem,” Wikipedia.
- “Quantum Annealing,” Wikipedia.
- D-Wave Systems.
- QxBranch. They spoke at a Meetup for DC Data Science in March 2016: http://www.qxbranch.com/blog/2016-03-10.html.
- J. Du, X. Rong, N. Zhao, Y. Wang, J. Yang, R. B. Liu, “Preserving electron spin coherence in solids by optimal dynamical decoupling,” Nature 461, 1265-1268 (2009).
- S. Das Sarma, M. Freedman, C. Nayak, “Topological Quantum Computing,” Physics Today (July 2006). [PDF]
- Kwan-yuet Ho, “Topology in Physics and Computing,” WordPress (2015).