Research Papers

This is the *start* of a list of research papers about quantum computing.  Please send any additional suggestions using the Contact form.

14th May 2018 – How many qubits are needed for quantum supremacy? – ArXiv, Quantum Physics – applied mathematics paper from the MIT physics department. Discusses the hard limit for the minimum number of qubits needed to solve problems which are genuinely intractable with classical computers.

20th February 2018 – Paper relating to work done in Chalmers University, Sweden, to create a topological superconductor, which could be used in a topological quantum computer, the technology Microsoft are currently working on (see associated article – 20th February 2018 – Researchers at Chalmers University of Technology edge closer to quantum computing breakthroughV3 )

14th February 2018 – A programmable two-qubit quantum processor in siliconNature go via this article on Futurism to get to a full copy of the paper.

27th January 2018 – Quantum Computing in the NISQ era and beyond – Arxiv – Quantum Physics – an accessible yet in depth overview of the state of quantum computing as it stands, presented for a keynote address by physicist John Preskill of CalTech. Well-referenced, and the short section on D-Wave and quantum annealing is especially worth reading.

8th December 2017 – Induced unconventional superconductivity on the surface states of Bi2Te3 topological insulatorNature Communications

27th October 2015 – Majorana zero modes and topological quantum computation – Nature – a scientific overview of the progress that has been made on a current hopeful to realize a topological quantum computer: a Majorana zero mode.

30th August 1995 – Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer – Arxiv – Quantum Physics Peter Schor’s discrete mathematics paper in which he introduces his now famous algorithm. One of a series of groundbreaking papers by Schor and others that gave real motivation for the applications of quantum computing.