Read and understand quantum papers.
Pre-loaded papers:
Peter Shor · 1997
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. This paper considers factoring integers and finding discrete logarithms, two problems that are generally thought to be hard on a classical computer and have been used as the basis of several proposed cryptosystems. Efficient randomized algorithms are given for these two problems on a hypothetical quantum computer. These algorithms take a number of steps polynomial in the input size, e.g., factoring n takes O(log n)^3 steps.
Lov Grover · 1996
Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of 1/2, any classical algorithm (whether deterministic or probabilistic) will need to look at a minimum of O(N) names. If we are able to use quantum computation, we can solve this problem with a high probability of success using only O(sqrt(N)) operations, by exploiting the superposition and entanglement properties of quantum mechanics.
John Preskill · 2018
Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future. NISQ devices will be subject to noise and will not be able to sustain quantum error correction. Nonetheless, they might be able to perform useful tasks that are beyond the reach of classical computers. I survey the emerging NISQ landscape and discuss what we might expect from quantum computing in the next decade.
Richard Feynman · 1982
Classical computers cannot efficiently simulate quantum mechanical systems. We need a new kind of computer that operates on quantum mechanical principles. This paper, from 1982, is widely considered the starting point of quantum computing, where Feynman first suggested that a quantum computer could efficiently simulate quantum physics.
Charles H. Bennett, Gilles Brassard · 1984
A new method for secure communication is proposed, based on the principles of quantum mechanics. The method, now known as BB84, allows two parties to generate a shared random secret key known only to them, which can then be used to encrypt and decrypt messages. The security of the protocol relies on the fundamental quantum mechanical properties of non-cloning and measurement disturbance.
William K. Wootters, Wojciech H. Zurek · 1982
If an unknown quantum state could be cloned perfectly, then many fundamental quantum phenomena would be impossible. This paper proves that it is impossible to create an identical copy of an arbitrary unknown quantum state. The no-cloning theorem is a cornerstone of quantum cryptography and quantum information theory.
John F. Clauser, Michael A. Horne, Abner Shimony, Richard A. Holt · 1969
A generalized Bell inequality is derived that can be tested experimentally. The CHSH inequality provides a practical test to distinguish between quantum mechanics and local hidden-variable theories. Violation of the inequality would confirm the predictions of quantum mechanics and rule out local realism.
Aram W. Harrow, Avinatan Hassidim, Seth Lloyd · 2009
Solving linear systems of equations is a fundamental problem in science and engineering. This paper presents a quantum algorithm that solves linear systems exponentially faster than classical methods for certain well-conditioned matrices. The HHL algorithm has become a cornerstone of quantum machine learning and quantum data analysis.
Edward Farhi, Jeffrey Goldstone, Sam Gutmann · 2014
We introduce a quantum algorithm that produces approximate solutions for combinatorial optimization problems. The algorithm depends on a positive integer p and the quality of the approximation improves as p increases. The quantum circuit that implements the algorithm is shallow, making it suitable for near-term quantum devices.
Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J. Love, Alán Aspuru-Guzik, Jeremy L. O'Brien · 2014
We propose and experimentally demonstrate a variational quantum eigensolver (VQE) that uses a photonic quantum processor to find the eigenvalues of the Heisenberg and hydrogen molecular Hamiltonians. VQE combines a classical optimization routine with a quantum state preparation circuit, enabling the computation of ground state energies on near-term quantum hardware.