This is a timeline of quantum computing.

1960s

1968

• Stephen Wiesner invents conjugate coding (published in ACM SIGACT News 15(1): 78–88).^[1]

1970s

1970

• James Park articulates the no-cloning theorem.^[2]

1973

• Alexander Holevo publishes a paper showing that n qubits can carry more than n classical bits of information, but at most n classical bits are accessible (a result known as "Holevo's theorem" or "Holevo's bound").
• Charles H. Bennett shows that computation can be done reversibly.^[3]

1975

• R. P. Poplavskii publishes "Thermodynamical models of information processing" (in Russian)^[4] which shows the computational infeasibility of simulating quantum systems on classical computers, due to the superposition principle.

1976

• Roman Stanisław Ingarden, a Polish mathematical physicist, publishes the paper "Quantum Information Theory" in Reports on Mathematical Physics, vol. 10, pp. 43–72, 1976 (The paper was submitted in 1975). It is one of the first attempts at creating a quantum information theory, showing that Shannon information theory cannot directly be generalized to the quantum case, but rather that it is possible to construct a quantum information theory, which is a generalization of Shannon's theory, within the formalism of a generalized quantum mechanics of open systems and a generalized concept of observables (the so-called semi-observables).

1980s

1980

• Paul Benioff describes the first quantum mechanical model of a computer. In this work, Benioff showed that a computer could operate under the laws of quantum mechanics by describing a Schrödinger equation description of Turing machines, laying a foundation for further work in quantum computing. The paper^[5] was submitted in June 1979 and published in April 1980.
• Yuri Manin briefly motivates the idea of quantum computing.^[6]
• Tommaso Toffoli introduces the reversible Toffoli gate,^[7] which (together with initialized ancilla bits) is functionally complete for reversible classical computation.

1981

• At the first Conference on the Physics of Computation, held at the Massachusetts Institute of Technology (MIT) in May,^[8] Paul Benioff and Richard Feynman give talks on quantum computing. Benioff's built on his earlier 1980 work showing that a computer can operate under the laws of quantum mechanics. The talk was titled “Quantum mechanical Hamiltonian models of discrete processes that erase their own histories: application to Turing machines”.^[9] In Feynman's talk, he observed that it appeared to be impossible to efficiently simulate an evolution of a quantum system on a classical computer, and he proposed a basic model for a quantum computer.^[10]

1982

• Paul Benioff further develops his original model of a quantum mechanical Turing machine.^[11]
• William Wootters and Wojciech Zurek,^[12] and independently Dennis Dieks^[13] rediscover the no-cloning theorem of James Park.

1984

• Charles Bennett and Gilles Brassard employ Wiesner's conjugate coding for distribution of cryptographic keys.^[14]

1985

• David Deutsch, at the University of Oxford, describes the first universal quantum computer. Just as a Universal Turing machine can simulate any other Turing machine efficiently (Church–Turing thesis), so the universal quantum computer is able to simulate any other quantum computer with at most a polynomial slowdown.
• Asher Peres points out the need for quantum error correction schemes and discusses a repetition code for amplitude errors.^[15]

1988

• Yoshihisa Yamamoto and K. Igeta propose the first physical realization of a quantum computer, including Feynman's CNOT gate.^[16] Their approach uses atoms and photons and is the progenitor of modern quantum computing and networking protocols using photons to transmit qubits and atoms to perform two-qubit operations.

1989

• Gerard J. Milburn proposes a quantum-optical realization of a Fredkin gate.^[17]
• Bikas K. Chakrabarti & collaborators from Saha Institute of Nuclear Physics, Kolkata, India, propose that quantum fluctuations could help explore rugged energy landscapes by escaping from local minima of glassy systems having tall but thin barriers by tunneling (instead of climbing over using thermal excitations), suggesting the effectiveness of quantum annealing over classical simulated annealing.^[18][19]

1990s

1991

• Artur Ekert at the University of Oxford, proposes entanglement-based secure communication.^[20]

1992

• David Deutsch and Richard Jozsa propose a computational problem that can be solved efficiently with the deterministic Deutsch–Jozsa algorithm on a quantum computer, but for which no deterministic classical algorithm is possible. This was perhaps the earliest result in the computational complexity of quantum computers, proving that they were capable of performing some well-defined computational task more efficiently than any classical computer.
• Ethan Bernstein and Umesh Vazirani propose the Bernstein–Vazirani algorithm. It is a restricted version of the Deutsch–Jozsa algorithm where instead of distinguishing between two different classes of functions, it tries to learn a string encoded in a function. The Bernstein–Vazirani algorithm was designed to prove an oracle separation between complexity classes BQP and BPP.
• Research groups at Max Planck Institute of Quantum Optics (Garching)^[21][22] and shortly after at NIST (Boulder)^[23] experimentally realize the first crystallized strings of laser-cooled ions. Linear ion crystals constitute the qubit basis for most quantum computing and simulation experiments with trapped ions.

1993

• Dan Simon, at Université de Montréal, invent an oracle problem, Simon's problem, for which a quantum computer would be exponentially faster than a conventional computer. This algorithm introduces the main ideas which were then developed in Peter Shor's factorization algorithm.

1994

• Peter Shor, at AT&T's Bell Labs in New Jersey, publishes Shor's algorithm. It would allow a quantum computer to factor large integers quickly. It solves both the factoring problem and the discrete log problem. The algorithm can theoretically break many of the cryptosystems in use today. Its invention sparked a tremendous interest in quantum computers.
• The first United States Government workshop on quantum computing is organized by NIST in Gaithersburg, Maryland, in autumn.
• Isaac Chuang and Yoshihisa Yamamoto propose a quantum-optical realization of a quantum computer to implement Deutsch's algorithm.^[24] Their work introduced dual-rail encoding for photonic qubits.
• In December, Ignacio Cirac, at University of Castilla-La Mancha at Ciudad Real, and Peter Zoller at the University of Innsbruck propose an experimental realization of the controlled-NOT gate with cold trapped ions.

1995

• The first United States Department of Defense workshop on quantum computing and quantum cryptography is organized by United States Army physicists Charles M. Bowden, Jonathan P. Dowling, and Henry O. Everitt; it took place in February at the University of Arizona in Tucson.
• Peter Shor proposes the first schemes for quantum error correction.^[25]
• Christopher Monroe and David Wineland at NIST (Boulder, Colorado) experimentally realize the first quantum logic gate – the controlled-NOT gate – with trapped ions, following the Cirac-Zoller proposal.^[26]
• independently, Subhash Kak and Ronald Chrisley propose the first quantum neural network^[27][28]

1996

• Lov Grover, at Bell Labs, invents the quantum database search algorithm. The quadratic speedup is not as dramatic as the speedup for factoring, discrete logs, or physics simulations. However, the algorithm can be applied to a much wider variety of problems. Any problem that can be solved by random, brute-force search, may take advantage of this quadratic speedup in the number of search queries.
• The United States Government, particularly in a joint partnership of the Army Research Office (now part of the Army Research Laboratory) and the National Security Agency, issues the first public call for research proposals in quantum information processing.
• Andrew Steane designs Steane codes for error correction.^[29]
• David P. DiVincenzo, of IBM, proposes a list of minimal requirements for creating a quantum computer,^[30] now called DiVincenzo's criteria.

1997

• David Cory, Amr Fahmy and Timothy Havel, and at the same time Neil Gershenfeld and Isaac L. Chuang at MIT publish the first papers realizing gates for quantum computers based on bulk nuclear spin resonance, or thermal ensembles. The technology is based on a nuclear magnetic resonance (NMR) machine, which is similar to the medical magnetic resonance imaging machine.
• Alexei Kitaev describes the principles of topological quantum computation as a method for dealing with the problem of decoherence.^[31]
• Daniel Loss and David P. DiVincenzo propose the Loss-DiVincenzo quantum computer, using as qubits the intrinsic spin-1/2 degree of freedom of individual electrons confined to quantum dots.^[32]

1998

• The first experimental demonstration of a quantum algorithm is reported. A working 2-qubit NMR quantum computer was used to solve Deutsch's problem by Jonathan A. Jones and Michele Mosca at Oxford University and shortly after by Isaac L. Chuang at IBM's Almaden Research Center, in California, and Mark Kubinec and the University of California, Berkeley together with coworkers at Stanford University and MIT.^[33]
• The first working 3-qubit NMR computer is reported.
• Bruce Kane proposes a silicon-based nuclear spin quantum computer, using nuclear spins of individual phosphorus atoms in silicon as the qubits and donor electrons to mediate the coupling between qubits.^[34]
• The first execution of Grover's algorithm on an NMR computer is reported.^[35]
• Hidetoshi Nishimori & colleagues from Tokyo Institute of Technology show that a quantum annealing algorithm can perform better than classical simulated annealing under certain conditions.^[36]
• Daniel Gottesman and Emanuel Knill independently prove that a certain subclass of quantum computations can be efficiently emulated with classical resources (Gottesman–Knill theorem).^[37]

1999edit

• Samuel L. Braunstein and collaborators show that none of the bulk NMR experiments performed to date contain any entanglement; the quantum states being too strongly mixed. This is seen as evidence that NMR computers would likely not yield a benefit over classical computers. It remains an open question, however, whether entanglement is necessary for quantum computational speedup.^[38]
• Gabriel Aeppli, Thomas Felix Rosenbaum and colleagues demonstrate experimentally the basic concepts of quantum annealing in a condensed matter system.
• Yasunobu Nakamura and Jaw-Shen Tsai demonstrate that a superconducting circuit can be used as a qubit.^[39]

2000sedit

2000edit

• Arun K. Pati and Samuel L. Braunstein prove the quantum no-deleting theorem. This is dual to the no-cloning theorem which shows that one cannot delete a copy of an unknown qubit. Together with the stronger no-cloning theorem, the no-deleting theorem has the implication that quantum information can neither be created nor be destroyed.
• The first working 5-qubit NMR computer is demonstrated at the Technical University of Munich, Germany.
• The first execution of order finding (part of Shor's algorithm) at IBM's Almaden Research Center and Stanford University is demonstrated.
• The first working 7-qubit NMR computer is demonstrated at the Los Alamos National Laboratory in New Mexico.
• The textbook, Quantum Computation and Quantum Information, by Michael Nielsen and Isaac Chuang is published.

2001edit

• The first execution of Shor's algorithm at IBM's Almaden Research Center and Stanford University is demonstrated. The number 15 was factored using 10¹⁸ identical molecules, each containing seven active nuclear spins.
• Noah Linden and Sandu Popescu prove that the presence of entanglement is a necessary condition for a large class of quantum protocols. This, coupled with Braunstein's result (see 1999 above), called the validity of NMR quantum computation into question.^[40]
• Emanuel Knill, Raymond Laflamme, and Gerard Milburn show that optical quantum computing is possible with single-photon sources, linear optical elements, and single-photon detectors, establishing the field of linear optical quantum computing.
• Robert Raussendorf and Hans Jürgen Briegel propose measurement-based quantum computation.^[41]

2002edit

• The Quantum Information Science and Technology Roadmapping Project, involving some of the main participants in the field, lays out the Quantum computation roadmap.
• The Institute for Quantum Computing is established at the University of Waterloo in Waterloo, Ontario by Mike Lazaridis, Raymond Laflamme and Michele Mosca.^[42]
• A group led by Gerhard Birkl (now at TU Darmstadt) demonstrates the first 2D array of optical tweezers with trapped atoms for quantum computation with atomic qubits.^[43]

2003edit

• Implementation of the Deutsch–Jozsa algorithm on an ion-trap quantum computer at the University of Innsbruck is reported.^[44]
• Todd D. Pittman and collaborators at Johns Hopkins University, Applied Physics Laboratory, and independently Jeremy L. O'Brien and collaborators at the University of Queensland, demonstrate quantum controlled-not gates using only linear optical elements.^[45][46]
• The first implementation of a CNOT quantum gate, according to the Cirac–Zoller proposal, is reported by a team at the University of Innsbruck led by Rainer Blatt.^[47]
• The DARPA Quantum Network becomes fully operational on October 23, 2003.
• The Institute for Quantum Optics and Quantum Information (IQOQI) is established in Innsbruck and Vienna, Austria, by the founding directors Rainer Blatt, Hans Jürgen Briegel, Rudolf Grimm, Anton Zeilinger and Peter Zoller.

2004edit

• The first working pure state NMR quantum computer (based on parahydrogen) is demonstrated at Oxford University, England and University of York, England.
• Physicists at the University of Innsbruck show deterministic quantum-state teleportation between a pair of trapped calcium ions.^[48]
• The first five-photon entanglement is demonstrated by Jian-Wei Pan's team at the University of Science and Technology of Chin; the minimal number of qubits required for universal quantum error correction.^[49]

2005edit

• University of Illinois at Urbana–Champaign scientists demonstrate quantum entanglement of multiple characteristics, potentially allowing multiple qubits per particle.
• Two teams of physicists measure the capacitance of a Josephson junction for the first time. The methods could be used to measure the state of quantum bits in a quantum computer without disturbing the state.^[50]
• In December, W-states of quantum registers with up to 8 qubits implemented using trapped ions are demonstrated at the Institute for Quantum Optics and Quantum Information and the University of Innsbruck in Austria.^[51]
• Harvard University and Georgia Institute of Technology researchers succeed in transferring quantum information between "quantum memories" – from atoms to photons and back again.^{[citation needed]}

2006edit

• The Materials Science Department of Oxford University, England cage a qubit in a "buckyball" (a molecule of buckminsterfullerene) and demonstrated quantum "bang-bang" error correction.^[52]

• Researchers from the University of Illinois at Urbana–Champaign use the Zeno Effect, repeatedly measuring the properties of a photon to gradually change it without actually allowing the photon to reach the program, to search a database using counterfactual quantum computation.^[53]
• Vlatko Vedral of the University of Leeds and colleagues at the universities of Porto and Vienna find that the photons in ordinary laser light can be quantum mechanically entangled with the vibrations of a macroscopic mirror.^[54]
• Samuel L. Braunstein at the University of York along with the University of Tokyo and the Japan Science and Technology Agency give the first experimental demonstration of quantum telecloning.^[55]
• Professors at the University of Sheffield develop a means to efficiently produce and manipulate individual photons at high efficiency at room temperature.^[56]
• A new error checking method is theorized for Josephson junction computers.^[57]
• The first 12-qubit quantum computer is benchmarked by researchers at the Institute for Quantum Computing and the Perimeter Institute for Theoretical Physics in Waterloo, Ontario as well as at MIT, Cambridge.^[58]
• A two-dimensional ion trap is developed for quantum computing.^[59]
• Seven atoms are placed in a stable line, a step on the way to constructing a quantum gate, at the University of Bonn.^[60]
• A team at Delft University of Technology in the Netherlands creates a device that can manipulate the "up" or "down" spin-states of electrons on quantum dots.^[61]
• The University of Arkansas develops quantum dot molecules.^[62]
• The spinning new theory on particle spin brings science closer to quantum computing.^[63]
• The University of Copenhagen develops quantum teleportation between photons and atoms.^[64]
• University of Camerino scientists develop a theory of macroscopic object entanglement, which has implications for the development of quantum repeaters.^[65]
• Tai-Chang Chiang, at Illinois at Urbana–Champaign, finds that quantum coherence can be maintained in mixed-material systems.^[66]
• Cristophe Boehme, University of Utah, demonstrates the feasibility of reading data using the nuclear spin on a silicon-phosphorus Kane quantum computer.^[67]

2007edit

• Subwavelength waveguide is developed for light.^[68]
• A single-photon emitter for optical fibers is developed.^[69]
• The first one-way quantum computers are built,^[70] where measurement (collapse) of an entangled cluster state is the main driving force of computation,^[71] and shown to perform simple computations, such as Deutsch's algorithm.^[72]
• A new material is proposed for quantum computing.^[73]
• A single-atom single-photon server is devised.^[74]
• The University of Cambridge develops an electron quantum pump.^[75]
• A superior method of qubit coupling is developed.^[76]
• A successful demonstration of controllably coupled qubits is reported.^[77]
• A breakthrough in applying spin-based electronics to silicon is reported.^[78]
• Scientists demonstrate a quantum state exchange between light and matter.^[79]
• A diamond quantum register is developed.^[80]
• Controlled-NOT quantum gates on a pair of superconducting quantum bits are realized.^[81]
• Scientists contain and study hundreds of individual atoms in 3D array.^[82]
• Nitrogen in a buckyball molecule is used in quantum computing.^[83]
• A large number of electrons are quantum coupled.^[84]
• Spin–orbit interaction of electrons are measured.^[85]
• Atoms are quantum manipulated in laser light.^[86]
• Light pulses are used to control electron spins.^[87]
• Quantum effects are demonstrated across tens of nanometers.^[88]
• Light pulses are used to accelerate quantum computing development.^[89]
• A quantum RAM blueprint is unveiled.^[90]
• A model of a quantum transistor is developed.^[91]
• Long distance entanglement is demonstrated.^[92]
• Photonic quantum computing is used to factor a number by two independent labs.^[93]
• A quantum bus is developed by two independent labs.^[94]
• A superconducting quantum cable is developed.^[95]
• The transmission of qubits is demonstrated.^[96]
• Superior qubit material is devised.^[97]
• A single-electron qubit memory is reported.^[98]
• Bose–Einstein condensate quantum memory is developed.^[99]
• D-Wave Systems demonstrates use of a 28-qubit quantum annealing computer.^[100]
• A new cryonic method reduces decoherence and increases interaction distance, and thus quantum computing speed.^[101]
• A photonic quantum computer is demonstrated.^[102]
• Graphene quantum dot spin qubits are proposed.^[103]

2008edit

• The HHL algorithm for solving linear equations is published.^[104]
• Graphene quantum dot qubits are described.^[105]
• Scientists succeed in storing a quantum bit.^[106]
• 3D qubit-qutrit entanglement is demonstrated.^[107]
• Analog quantum computing is devised.^[108]
• Control of quantum tunneling is devised.^[109]
• Entangled memory is developed.^[110]
• A superior NOT gate is developed.^[111]
• Qutrits are developed.^[112]
• Quantum logic gate in optical fiber^[113]
• A superior quantum Hall Effect is discovered.^[114]
• Enduring spin states in quantum dots are reported.^[115]
• Molecular magnets are proposed for quantum RAM.^[116]
• Quasiparticles offer hope of stable quantum computers.^[117]
• Image storage may have better storage of qubits is reported.^[118]
• Quantum entangled images are reported.^[119]
• Quantum state is intentionally altered in a molecule.^[120]
• Electron position is controlled in a silicon circuit.^[121]
• A superconducting electronic circuit pumps microwave photons.^[122]
• Amplitude spectroscopy is developed.^[123]
• A superior quantum computer test is developed.^[124]
• An optical frequency comb is devised.^[125]
• The concept of Quantum Darwinism is supported.^[126]
• Hybrid qubit memory is developed.^[127]
• A qubit is stored for over 1 second in an atomic nucleus.^[128]
• Faster electron spin qubit switching and reading is developed.^[129]
• The possibility of non-entanglement quantum computing is described.^[130]
• D-Wave Systems claim to have produced a 128 qubit computer chip, though this claim had yet to be verified.^[131]

2009edit

• Carbon 12 is purified for longer coherence times.^[132]
• The lifetime of qubits is extended to hundreds of milliseconds.^[133]
• Improved quantum control of photons is reported.^[134]
• Quantum entanglement is demonstrated over 240 micrometres.^[135]
• Qubit lifetime is extended by a factor of 1000.^[136]
• The first electronic quantum processor is created.^[137]
• Six-photon graph state entanglement is used to simulate the fractional statistics of anyons living in artificial spin-lattice models.^[138]
• A single-molecule optical transistor is devised.^[139]
• NIST is reads and writes individual qubits.^[140]
• NIST demonstrates multiple computing operations on qubits.^[141]
• The first large-scale topological cluster state quantum architecture is developed for atom-optics.^[142]
• A combination of all of the fundamental elements required to perform scalable quantum computing through the use of qubits stored in the internal states of trapped atomic ions is shown.^[143]
• Researchers at University of Bristol demonstrate Shor's algorithm on a silicon photonic chip.^[144]
• Quantum Computing with an Electron Spin Ensemble is reported.^[145]
• A so-called photon machine gun is developed for quantum computing.^[146]
• The first universal programmable quantum computer is unveiled.^[147]
• Scientists electrically control quantum states of electrons.^[148]
• Google collaborates with D-Wave Systems on image search technology using quantum computing.^[149]
• A method for synchronizing the properties of multiple coupled CJJ rf-SQUID flux qubits with a small spread of device parameters due to fabrication variations is demonstrated.^[150]
• Universal Ion Trap Quantum Computation with decoherence free qubits is realized.^[151]
• The first chip-scale quantum computer is reported.^[152]

2010sedit

2010edit

• Ions were trapped in an optical trap.^[153]
• An optical quantum computer with three qubits calculated the energy spectrum of molecular hydrogen to high precision.^[154]
• The first germanium laser advanced the state of optical computers.^[155]
• A single-electron qubit was developed^[156]
• The quantum state in a macroscopic object was reported.^[157]
• A new quantum computer cooling method was developed.^[158]
• Racetrack ion trap was developed.^[159]
• Evidence for a Moore-Read state in the $$Zdroj:https://en.wikipedia.org?pojem=2021_in_quantum_computing_and_communication
  Text je dostupný za podmienok Creative Commons Attribution/Share-Alike License 3.0 Unported; prípadne za ďalších podmienok. Podrobnejšie informácie nájdete na stránke Podmienky použitia.

  ---