no code implementations • 10 Apr 2013 • Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J. Love, Alán Aspuru-Guzik, Jeremy L. O'Brien
Quantum computers promise to efficiently solve important problems that are intractable on a conventional computer.
Quantum Physics Chemical Physics
no code implementations • 17 Nov 2011 • Enrique Martin-Lopez, Anthony Laing, Thomas Lawson, Roberto Alvarez, Xiao-Qi Zhou, Jeremy L. O'Brien
Shor's quantum algorithm for fast number factoring is a key example and the prime motivator in the international effort to realise a quantum computer.
Quantum Physics
no code implementations • 12 Sep 2010 • Thaddeus D. Ladd, Fedor Jelezko, Raymond Laflamme, Yasunobu Nakamura, Christopher Monroe, Jeremy L. O'Brien
Quantum mechanics---the theory describing the fundamental workings of nature---is famously counterintuitive: it predicts that a particle can be in two places at the same time, and that two remote particles can be inextricably and instantaneously linked.
Quantum Physics
no code implementations • 4 Mar 2010 • Anthony Laing, Valerio Scarani, John G. Rarity, Jeremy L. O'Brien
We describe a quantum key distribution protocol based on pairs of entangled qubits that generates a secure key between two partners in an environment of unknown and slowly varying reference frame.
Quantum Physics
no code implementations • 6 Nov 2009 • Alberto Politi, Jonathan C. F. Matthews, Jeremy L. O'Brien
Shor's quantum factoring algorithm finds the prime factors of a large number exponentially faster than any other known method a task that lies at the heart of modern information security, particularly on the internet.
Quantum Physics
