GetWiki
quantum computing
ARTICLE SUBJECTS
being →
database →
ethics →
fiction →
history →
internet →
language →
linux →
logic →
method →
news →
policy →
purpose →
religion →
science →
software →
truth →
unix →
wiki →
ARTICLE TYPES
essay →
feed →
help →
system →
wiki →
ARTICLE ORIGINS
critical →
forked →
imported →
original →
quantum computing
please note:
 the content below is remote from Wikipedia
 it has been imported raw for GetWiki
{{short descriptionUsing quantummechanical phenomena for computing}}File:Bloch Sphere.svgthumbThe Bloch sphere is a representation of a qubitqubitQuantum computing is the use of quantummechanical phenomena such as superposition and entanglement to perform computation. A quantum computer is used to perform such computation, which can be implemented theoretically or physically.BOOK, Quantum Computing : Progress and Prospects (2018), I5, National Academies Press, Grumbling, Emily, Horowitz, Mark, The National Academies of Sciences, Engineering, and Medicine, Washington, DC, 2019, 10.17226/25196, 9780309479691, 1081001288, {{rpI5}}The field of quantum computing is actually a subfield of quantum information science, which includes quantum cryptography and quantum communication. Quantum computing was started in the early 1980s when Richard Feynman and Yuri Manin expressed the idea that a quantum computer had the potential to simulate things that a classical computer could not.JOURNAL, Feynman, Richard, Simulating Physics with Computers, International Journal of Theoretical Physics, June 1982, 21, 6/7, 467â€“488, 10.1007/BF02650179,weblink 28 February 2019, BOOK, Manin, Yu. I., Vychislimoe i nevychislimoe, Computable and Noncomputable, 1980, Sov.Radio,weblink 13â€“15, Russian, 20130304, yes,weblink" title="web.archive.org/web/20130510173823weblink">weblink 20130510, In 1994, Peter Shor published an algorithm that is able to efficiently solve some problems that are used in asymmetric cryptography that are considered hard for classical computers.JOURNAL, Mermin, David, Breaking RSA Encryption with a Quantum Computer: Shor's Factoring Algorithm, Cornell University, Physics 481681 Lecture Notes, March 28, 2006,weblink" title="web.archive.org/web/20121115112940weblink">weblink There are currently two main approaches to physically implementing a quantum computer: analog and digital. Analog approaches are further divided into quantum simulation, quantum annealing, and adiabatic quantum computation. Digital quantum computers use quantum logic gates to do computation. Both approaches use quantum bits or qubits.{{rp213}}Qubits are fundamental to quantum computing and are somewhat analogous to bits in a classical computer. Qubits can be in a 1 or 0 quantum state. But they can also be in a superposition of the 1 and 0 states. However, when qubits are measured the result is always either a 0 or a 1; the probabilities of the two outcomes depends on the quantum state they were in.Today's physical quantum computers are very noisy and quantum error correction is a burgeoning field of research. Unfortunately existing hardware is so noisy that "faulttolerant quantum computing [is] still a rather distant dream".JOURNAL, Quantum Computing in the NISQ era and beyond, John Preskill, Quantum, 2, 79, 2018, 10.22331/q2018080679, 1801.00862, As of April 2019, no large scalable quantum hardware has been demonstrated, nor have commercially useful algorithms been published for today's small, noisy quantum computers. There is an increasing amount of investment in quantum computing by governments, established companies, and startups.WEB,weblink Quantum Computing Report: Players, 20190417, Both applications of nearterm intermediatescale device and the demonstration of quantum supremacyARXIV, Quantum computing and the entanglement frontier, John Preskill, 1203.5813, are actively pursued in academic and industrial research. the content below is remote from Wikipedia
 it has been imported raw for GetWiki
Basics
A classical computer has a memory made up of bits, where each bit is represented by either a one or a zero. A quantum computer, on the other hand, maintains a sequence of qubits, which can represent a one, a zero, or any quantum superposition of those two qubit states;BOOK, Quantum Computation and Quantum Information, Nielsen, Michael A., Chuang, Isaac L., Cambridge University Press, 2010, 9781107002173, 2nd, Cambridge, Michael A. Nielsen, Isaac Chuang, Quantum Computation and Quantum Information (book), {{rp13â€“16}} a pair of qubits can be in any quantum superposition of 4 states,{{rp16}} and three qubits in any superposition of 8 states. In general, a quantum computer with n qubits can be in any superposition of up to 2^n different states.{{rp17}} (This compares to a normal computer that can only be in one of these 2^n states at any one time).A quantum computer operates on its qubits using quantum gates and measurement (which also alters the observed state). An algorithm is composed of a fixed sequence of quantum logic gates and a problem is encoded by setting the initial values of the qubits, similar to how a classical computer works. The calculation usually ends with a measurement, collapsing the system of qubits into one of the 2^n eigenstates, where each qubit is zero or one, decomposing into a classical state. The outcome can, therefore, be at most n classical bits of information. If the algorithm did not end with a measurement, the result is an unobserved quantum state. (Such unobserved states may be sent to other computers as part of distributed quantum algorithms.)Quantum algorithms are often probabilistic, in that they provide the correct solution only with a certain known probability.WEB,weblink Lecture Notes for Ph219/CS219: Quantum Information Chapter 5, Preskill, John, 2015, 12, The term nondeterministic computing must not be used in that case to mean probabilistic (computing) because the term nondeterministic has a different meaning in computer science.An example of an implementation of qubits of a quantum computer could start with the use of particles with two spin states: "down" and "up" (typically written {downarrow}rangle and {uparrow}rangle, or 0{rangle} and 1{rangle}). This is true because any such system can be mapped onto an effective spin1/2 system.Principles of operation
{{more footnotessectiondate=February 2018}}A quantum computer with a given number of qubits is fundamentally different from a classical computer composed of the same number of classical bits. For example, representing the state of an nqubit system on a classical computer requires the storage of 2n complex coefficients, while to characterize the state of a classical nbit system it is sufficient to provide the values of the n bits, that is, only n numbers. Although this fact may seem to indicate that qubits can hold exponentially more information than their classical counterparts, care must be taken not to overlook the fact that the qubits are only in a probabilistic superposition of all of their states. This means that when the final state of the qubits is measured, they will only be found in one of the possible configurations they were in before the measurement. It is generally incorrect to think of a system of qubits as being in one particular state before the measurement. The qubits are in a superposition of states before any measurement is made, which directly affects the possible outcomes of the computation.File:Quantum computer.svgthumb200pxQubits are made up of controlled particles and the means of control (e.g. devices that trap particles and switch them from one state to another).BOOK, Waldner, JeanBaptiste, Nanocomputers and Swarm Intelligence, International Society for Technology in Education, ISTEInternational Society for Technology in Education, ISTETo better understand this point, consider a classical computer that operates on a threebit register. If the exact state of the register at a given time is not known, it can be described as a probability distribution over the 2^3=8 different threebit strings 000, 001, 010, 011, 100, 101, 110, and 111. If there is no uncertainty over its state, then it is in exactly one of these states with probability 1. However, if it is a probabilistic computer, then there is a possibility of it being in any one of a number of different states.The state of a threequbit quantum computer is similarly described by an eightdimensional vector (a_0,a_1,a_2,a_3,a_4,a_5,a_6,a_7) (or a onedimensional vector witheach vector node holding the amplitude and the state as the bit string of qubits). Here, however, the coefficients a_i are complex numbers, and it is the sum of the squares of the coefficients' absolute values, sum_i a_i^2, that must equal 1. For each i, the absolute value squared lefta_i right^2 gives the probability of the system being found in the ith state after a measurement. However, because a complex number encodes not just a magnitude but also a direction in the complex plane, the phase difference between any two coefficients (states) represents a meaningful parameter. This is a fundamental difference between quantum computing and probabilistic classical computing.JOURNAL, DiVincenzo, David P., Quantum Computation, Science, 1995, 270, 5234, 255â€“261, 10.1126/science.270.5234.255, 1995Sci...270..255D, 10.1.1.242.2165, {{subscription required}}If you measure the three qubits, you will observe a threebit string. The probability of measuring a given string is the squared magnitude of that string's coefficient (i.e., the probability of measuring 000 = a_0^2, the probability of measuring 001 = a_1^2, etc.). Thus, measuring a quantum state described by complex coefficients (a_0,a_1,a_2,a_3,a_4,a_5,a_6,a_7) gives the classical probability distribution (a_0^2,a_1^2,a_2^2,a_3^2,a_4^2,a_5^2,a_6^2,a_7^2) and we say that the quantum state "collapses" to a classical state as a result of making the measurement.An eightdimensional vector can be specified in many different ways depending on what basis is chosen for the space. The basis of bit strings (e.g., 000, 001, â€¦, 111) is known as the computational basis. Other possible bases are unitlength, orthogonal vectors and the eigenvectors of the Paulix operator. Ket notation is often used to make the choice of basis explicit. For example, the state (a_0,a_1,a_2,a_3,a_4,a_5,a_6,a_7) in the computational basis can be written as:
a_0,000rangle + a_1,001rangle + a_2,010rangle + a_3,011rangle + a_4,100rangle + a_5,101rangle + a_6,110rangle + a_7,111rangle
where, e.g.,  010rangle = left(0,0,1,0,0,0,0,0right)
The computational basis for a single qubit (two dimensions) is 0rangle = left(1,0right) and 1rangle = left(0,1right).Using the eigenvectors of the Paulix operator, a single qubit is +rangle = tfrac{1}{sqrt{2}} left(1,1right) and rangle = tfrac{1}{sqrt{2}} left(1,1right).Operation
{{unreferenced sectiondate=February 2018}}{{UnsolvedphysicsIs a universal quantum computer sufficient to efficiently simulate an arbitrary physical system?}}While a classical 3bit state and a quantum 3qubit state are each eightdimensional vectors, they are manipulated quite differently for classical or quantum computation. For computing in either case, the system must be initialized, for example into the allzeros string, 000rangle, corresponding to the vector (1,0,0,0,0,0,0,0). In classical randomized computation, the system evolves according to the application of stochastic matrices, which preserve that the probabilities add up to one (i.e., preserve the L1 norm). In quantum computation, on the other hand, allowed operations are unitary matrices, which are effectively rotations (they preserve that the sum of the squares add up to one, the Euclidean or L2 norm). (Exactly what unitaries can be applied depend on the physics of the quantum device.) Consequently, since rotations can be undone by rotating backward, quantum computations are reversible. (Technically, quantum operations can be probabilistic combinations of unitaries, so quantum computation really does generalize classical computation. See quantum circuit for a more precise formulation.)Finally, upon termination of the algorithm, the result needs to be read off. In the case of a classical computer, we sample from the probability distribution on the threebit register to obtain one definite threebit string, say 000. Quantum mechanically, one measures the threequbit state, which is equivalent to collapsing the quantum state down to a classical distribution (with the coefficients in the classical state being the squared magnitudes of the coefficients for the quantum state, as described above), followed by sampling from that distribution. This destroys the original quantum state. Many algorithms will only give the correct answer with a certain probability. However, by repeatedly initializing, running and measuring the quantum computer's results, the probability of getting the correct answer can be increased. In contrast, counterfactual quantum computation allows the correct answer to be inferred when the quantum computer is not actually running in a technical sense, though earlier initialization and frequent measurements are part of the counterfactual computation protocol.For more details on the sequences of operations used for various quantum algorithms, see universal quantum computer, Shor's algorithm, Grover's algorithm, Deutschâ€“Jozsa algorithm, amplitude amplification, quantum Fourier transform, quantum gate, quantum adiabatic algorithm and quantum error correction.Potential
Cryptography
Integer factorization, which underpins the security of public key cryptographic systems, is believed to be computationally infeasible with an ordinary computer for large integers if they are the product of few prime numbers (e.g., products of two 300digit primes).JOURNAL, Lenstra, Arjen K.,weblink Integer Factoring, Designs, Codes and Cryptography, 19, 101â€“128, 2000, 10.1023/A:1008397921377, 2/3, yes,weblink" title="web.archive.org/web/20150410234239weblink">weblink 20150410, By comparison, a quantum computer could efficiently solve this problem using Shor's algorithm to find its factors. This ability would allow a quantum computer to break many of the cryptographic systems in use today, in the sense that there would be a polynomial time (in the number of digits of the integer) algorithm for solving the problem. In particular, most of the popular public key ciphers are based on the difficulty of factoring integers or the discrete logarithm problem, both of which can be solved by Shor's algorithm. In particular, the RSA, Diffieâ€“Hellman, and elliptic curve Diffieâ€“Hellman algorithms could be broken. These are used to protect secure Web pages, encrypted email, and many other types of data. Breaking these would have significant ramifications for electronic privacy and security.However, other cryptographic algorithms do not appear to be broken by those algorithms.Daniel J. Bernstein, Introduction to PostQuantum Cryptography. Introduction to Daniel J. Bernstein, Johannes Buchmann, Erik Dahmen (editors). Postquantum cryptography. Springer, Berlin, 2009. {{isbn9783540887010}}See also pqcrypto.org, a bibliography maintained by Daniel J. Bernstein and Tanja Lange on cryptography not known to be broken by quantum computing. Some publickey algorithms are based on problems other than the integer factorization and discrete logarithm problems to which Shor's algorithm applies, like the McEliece cryptosystem based on a problem in coding theory.Robert J. McEliece. "A publickey cryptosystem based on algebraic coding theory." Jet Propulsion Laboratory DSN Progress Report 42â€“44, 114â€“116. Latticebased cryptosystems are also not known to be broken by quantum computers, and finding a polynomial time algorithm for solving the dihedral hidden subgroup problem, which would break many lattice based cryptosystems, is a wellstudied open problem.JOURNAL, Kobayashi, H., Gall, F.L., Dihedral Hidden Subgroup Problem: A Survey, 2006, Information and Media Technologies, 1, 1, 178â€“185,weblink It has been proven that applying Grover's algorithm to break a symmetric (secret key) algorithm by brute force requires time equal to roughly 2n/2 invocations of the underlying cryptographic algorithm, compared with roughly 2n in the classical case,Bennett C.H., Bernstein E., Brassard G., Vazirani U., "The strengths and weaknesses of quantum computation". SIAM Journal on Computing 26(5): 1510â€“1523 (1997). meaning that symmetric key lengths are effectively halved: AES256 would have the same security against an attack using Grover's algorithm that AES128 has against classical bruteforce search (see Key size). Quantum cryptography could potentially fulfill some of the functions of public key cryptography. Quantumbased cryptographic systems could, therefore, be more secure than traditional systems against quantum hacking.JOURNAL,weblink What are quantum computers and how do they work? WIRED explains, Wired UK, 20180216,Quantum search
Besides factorization and discrete logarithms, quantum algorithms offering a more than polynomial speedup over the best known classical algorithm have been found for several problems,Quantum Algorithm Zoo {{Webarchiveurl=https://web.archive.org/web/20180429014516weblink date=20180429 }} â€“ Stephen Jordan's Homepage including the simulation of quantum physical processes from chemistry and solid state physics, the approximation of Jones polynomials, and solving Pell's equation. No mathematical proof has been found that shows that an equally fast classical algorithm cannot be discovered, although this is considered unlikely.BOOK, Jon Schiller, Phd,weblinkisbn=9781439243497, 20090619, However, quantum computers offer polynomial speedup for some problems. The most wellknown example of this is quantum database search, which can be solved by Grover's algorithm using quadratically fewer queries to the database than that are required by classical algorithms. In this case, the advantage is not only provable but also optimal, it has been shown that Grover's algorithm gives the maximal possible probability of finding the desired element for any number of oracle lookups. Several other examples of provable quantum speedups for query problems have subsequently been discovered, such as for finding collisions in twotoone functions and evaluating NAND trees.Problems that can be addressed with Grover's algorithm have the following properties:
Quantum simulationSince chemistry and nanotechnology rely on understanding quantum systems, and such systems are impossible to simulate in an efficient manner classically, many believe quantum simulation will be one of the most important applications of quantum computing.JOURNAL,weblink The Father of Quantum Computing, Wired, Quinn, Norton, 20070215, Quantum simulation could also be used to simulate the behavior of atoms and particles at unusual conditions such as the reactions inside a collider.WEB,weblink What Can We Do with a Quantum Computer?, Andris, Ambainis, Spring 2014, Institute for Advanced Study,Quantum annealing and adiabatic optimizationQuantum annealing or Adiabatic quantum computation relies on the adiabatic theorem to undertake calculations. A system is placed in the ground state for a simple Hamiltonian, which is slowly evolved to a more complicated Hamiltonian whose ground state represents the solution to the problem in question. The adiabatic theorem states that if the evolution is slow enough the system will stay in its ground state at all times through the process.Solving linear equationsThe Quantum algorithm for linear systems of equations or "HHL Algorithm", named after its discoverers Harrow, Hassidim, and Lloyd, is expected to provide speedup over classical counterparts.JOURNAL, 0811.3171, Ambainis, Andris, Hassidim, Avinatan, Lloyd, Seth, Quantum algorithm for solving linear systems of equations, Physical Review Letters, 103, 15, 150502, 2008, 10.1103/PhysRevLett.103.150502, 19905613,Quantum supremacyJohn Preskill has introduced the term quantum supremacy to refer to the hypothetical speedup advantage that a quantum computer would have over a classical computer in a certain field.JOURNAL, Characterizing Quantum Supremacy in NearTerm Devices, Nature Physics, 14, 6, 595â€“600, Sergio, Boixo, Sergei V., Isakov, Vadim N., Smelyanskiy, Ryan, Babbush, Nan, Ding, Zhang, Jiang, Michael J., Bremner, John M., Martinis, Hartmut, Neven, 2018, 1608.00263, 10.1038/s415670180124x, Google announced in 2017 that it expected to achieve quantum supremacy by the end of the year though that did not happen. IBM said in 2018 that the best classical computers will be beaten on some practical task within about five years and views the quantum supremacy test only as a potential future benchmark.WEB,weblink Quantum Computers Compete for "Supremacy", Neil, Savage, Quantum supremacy has not been achieved yet, and skeptics like Gil Kalai doubt that it will ever be.WEB,weblink Quantum Supremacy and Complexity, 23 April 2016, WEB, Kalai, Gil, The Quantum Computer Puzzle,weblink AMS, Bill Unruh doubted the practicality of quantum computers in a paper published back in 1994.JOURNAL, Unruh, Bill, Maintaining coherence in Quantum Computers, Physical Review A, 51, 2, 992â€“997, hepth/9406058, 1995PhRvA..51..992U, 1995, 10.1103/PhysRevA.51.992, Paul Davies argued that a 400qubit computer would even come into conflict with the cosmological information bound implied by the holographic principle.WEB, Davies, Paul, The implications of a holographic universe for quantum information science and the nature of physical law,weblink Macquarie University,ObstaclesThere are a number of technical challenges in building a largescale quantum computer,JOURNAL, Dyakonov, Mikhail,weblink The Case Against Quantum Computing, IEEE Spectrum, 20181115, and thus far quantum computers have yet to solve a problem faster than a classical computer. David DiVincenzo, of IBM, listed the following requirements for a practical quantum computer:JOURNAL, quantph/0002077, The Physical Implementation of Quantum Computation, DiVincenzo, David P., 20000413, 10.1002/15213978(200009)48:9/113.0.CO;2E, 48, 9â€“11, Fortschritte der Physik, 771â€“783, 2000ForPh..48..771D,
Quantum decoherenceOne of the greatest challenges is controlling or removing quantum decoherence. This usually means isolating the system from its environment as interactions with the external world cause the system to decohere. However, other sources of decoherence also exist. Examples include the quantum gates, and the lattice vibrations and background thermonuclear spin of the physical system used to implement the qubits. Decoherence is irreversible, as it is effectively nonunitary, and is usually something that should be highly controlled, if not avoided. Decoherence times for candidate systems in particular, the transverse relaxation time T2 (for NMR and MRI technology, also called the dephasing time), typically range between nanoseconds and seconds at low temperature. Currently, some quantum computers require their qubits to be cooled to 20 millikelvins in order to prevent significant decoherence.JOURNAL, Jones, Nicola, Computing: The quantum company, Nature, 19 June 2013, 498, 7454, 286â€“288, 10.1038/498286a, 23783610, 2013Natur.498..286J, As a result, timeconsuming tasks may render some quantum algorithms inoperable, as maintaining the state of qubits for a long enough duration will eventually corrupt the superpositions.ARXIV, Amy, Matthew, Matteo, Olivia, Gheorghiu, Vlad, Mosca, Michele, Parent, Alex, Schanck, John, Estimating the cost of generic quantum preimage attacks on SHA2 and SHA3, November 30, 2016, 1603.09383, quantph, These issues are more difficult for optical approaches as the timescales are orders of magnitude shorter and an oftencited approach to overcoming them is optical pulse shaping. Error rates are typically proportional to the ratio of operating time to decoherence time, hence any operation must be completed much more quickly than the decoherence time.As described in the Quantum threshold theorem, if the error rate is small enough, it is thought to be possible to use quantum error correction to suppress errors and decoherence. This allows the total calculation time to be longer than the decoherence time if the error correction scheme can correct errors faster than decoherence introduces them. An often cited figure for the required error rate in each gate for faulttolerant computation is 10âˆ’3, assuming the noise is depolarizing.Meeting this scalability condition is possible for a wide range of systems. However, the use of error correction brings with it the cost of a greatly increased number of required qubits. The number required to factor integers using Shor's algorithm is still polynomial, and thought to be between L and L2, where L is the number of qubits in the number to be factored; error correction algorithms would inflate this figure by an additional factor of L. For a 1000bit number, this implies a need for about 104 bits without error correction.JOURNAL, Is FaultTolerant Quantum Computation Really Possible?, Dyakonov, M. I., 20061014, 4â€“18, Future Trends in Microelectronics. Up the Nano Creek, S. Luryi, J. Xu, A. Zaslavsky, quantph/0610117, 2006quant.ph.10117D, With error correction, the figure would rise to about 107 bits. Computation time is about L2 or about 107 steps and at 1 MHz, about 10 seconds.A very different approach to the stabilitydecoherence problem is to create a topological quantum computer with anyons, quasiparticles used as threads and relying on braid theory to form stable logic gates.JOURNAL, Freedman, Michael H., Michael Freedman
, Kitaev, Alexei, Alexei Kitaev , Larsen, Michael J., Michael J. Larsen , Wang, Zhenghan , quantph/0101025 , 10.1090/S0273097902009643 , 1 , Bulletin of the American Mathematical Society , 1943131 , 31â€“38 , Topological quantum computation , 40 , 2003, JOURNAL, Monroe, Don,weblink Anyons: The breakthrough quantum computing needs?, New Scientist, 20081001, DevelopmentsQuantum computing modelsThere are a number of quantum computing models, distinguished by the basic elements in which the computation is decomposed. The four main models of practical importance are:
Physical realizationsFor physically implementing a quantum computer, many different candidates are being pursued, among them (distinguished by the physical system used to realize the qubits):
 LAST=KAMINSKY  YEAR=2004, (qubit implemented by the state of small superconducting circuits (Josephson junctions))
 issue = 2, 248â€“260, 10.1134/1.2034610  ACCESSDATE=20070604  FIRST=WOLFGANG  DEADURL=YES  ARCHIVEDATE=20070604, JOURNAL, Science, June 6, 2008, Multipartite Entanglement Among Single Spins in Diamond, Neumann, P., 320, 5881, 1326â€“1329, 10.1126/science.1157233, 18535240, 2008Sci...320.1326N, 1, Mizuochi, N., Rempp, F., Hemmer, P., Watanabe, H., Yamasaki, S., Jacques, V., Gaebel, T., Jelezko, F., (qubit realized by the electronic or nuclear spin of nitrogenvacancy centers in diamond)
 bibcode = 2004PhRvL..93m0503L, (qubit realized by the internal electronic state of dopants in optical fibers)
TimelineIn 1959, Richard Feynman, in his lecture "There's Plenty of Room at the Bottom", states the possibility of using quantum effects for computation.In 1980, Paul Benioff described quantum mechanical Hamiltonian models of computersJOURNAL, Benioff, Paul, The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines, Journal of Statistical Physics, 22, 5, 563â€“591, 1980, 10.1007/bf01011339, 1980JSP....22..563B, and the Russian mathematician Yuri Manin motivated the development of quantum computers.WEB, Manin, Yu I, 1980, Vychislimoe i nevychislimoe, Computable and Noncomputable, ru, Sov.Radio, 13â€“15,weblinkweblink" title="web.archive.org/web/20130510173823weblink">weblink May 10, 2013, October 20, 2017, In 1981, at a conference coorganized by MIT and IBM, physicist Richard Feynman urged the world to build a quantum computer. He said, "Nature isn't classical, dammit, and if you want to make a simulation of nature, you'd better make it quantum mechanical, and by golly, it's a wonderful problem because it doesn't look so easy."NEWS, Gil, Dario, The Dawn of Quantum Computing is Upon Us,weblink May 4, 2016, May 4, 2016, In 1984, IBM scientists Charles Bennett and Gilles Brassard published BB84, the world's first quantum cryptography protocol.In 1985, David Deutsch describes the first universal quantum computer. Just as a Universal Turing machine can simulate any other Turing machine efficiently (ChurchTuring thesis), so the universal quantum computer is able to simulate any other quantum computer with at most a polynomial slowdown.In 1989, Bikas K. Chakrabarti & collaborators proposes the idea that quantum fluctuations could help explore rough 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.In 1992, David Deutsch and Richard Jozsa propose a computational problem that can be solved efficiently with the determinist 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 welldefined computational task more efficiently than any classical computer.In 1993, an international group of six scientists, including Charles Bennett, showed that perfect quantum teleportation is possibleJOURNAL, Bennett, C. H., Teleporting an unknown quantum state via dual classical and Einsteinâ€“Podolskyâ€“Rosen channels, Physical Review Letters, 29 March 1993, 70, 13, 1895â€“1899,weblink 1993PhRvL..70.1895B, 10.1103/PhysRevLett.70.1895, 10053414, in principle, but only if the original is destroyed.In 1994, Peter Shor, at AT&T's Bell Labs, discovered an important quantum algorithm, which allows a quantum computer to factor large integers exponentially much faster than the best known classical algorithm. Shor's algorithm can theoretically break many of the Publickey cryptography systems in use today,JOURNAL, Ekert, Artur, Josza, Richard, Quantum computation and Shor's factoring algorithm, Rev. Mod. Phys., 68, 3, 733â€“753, 1996, 10.1103/RevModPhys.68.733, 1996RvMP...68..733E, sparking a tremendous interest in quantum computers.In 1996, the DiVincenzo's criteria are published, which are a list of conditions that are necessary for constructing a quantum computer, proposed by the theoretical physicist David P. DiVincenzo in his 2000 paper "The Physical Implementation of Quantum Computation".In 2001, researchers demonstrated Shor's algorithm to factor 15 using a 7qubit NMR computer.JOURNAL, 10.1038/414883a, Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance, 2001, Vandersypen, Lieven M. K., Steffen, Matthias, Breyta, Gregory, Yannoni, Costantino S., Sherwood, Mark H., Chuang, Isaac L., Nature, 414, 6866, 883â€“7, 11780055, quantph/0112176, 2001Natur.414..883V, 10.1.1.251.8799, In 2005, researchers at the University of Michigan built a semiconductor chip ion trap. Such devices from standard lithography may point the way to scalable quantum computing.WEB,weblink UM develops scalable and massproducible quantum computer chip, University of Michigan, 20061117, 20051212, In 2009, researchers at Yale University created the first solidstate quantum processor. The 2qubit superconducting chip had artificial atom qubits made of a billion aluminum atoms that acted like a single atom that could occupy two states.JOURNAL, Demonstration of 2qubit algorithms with a superconducting quantum processor, DiCarlo, L., Chow, J. M., Gambetta, J. M., Bishop, Lev S., Johnson, B. R., Schuster, D. I., Majer, J., Blais, A., Frunzio, L., S. M. Girvin, Robert J. Schoelkopf, R. J. Schoelkopf, 9 July 2009, Nature (journal), Nature, 10.1038/nature08121, 19561592, 460, 7252, 240â€“4, 2009Natur.460..240D, 0903.2030, WEB,weblink Scientists Create First Electronic Quantum Processor, Yale University, 20090702, 20090702, yes,weblink" title="web.archive.org/web/20100611010021weblink">weblink 20100611, A team at the University of Bristol also created a silicon chip based on quantum optics, able to run Shor's algorithm.WEB,weblink Codebreaking quantum algorithm runs on a silicon chip, 20091014, New Scientist, 20090904, Further developments were made in 2010.WEB, New Trends in Quantum Computation,weblink Simons Conference on New Trends in Quantum Computation 2010: Program, C.N. Yang Institute for Theoretical Physics, Springer publishes a journal, Quantum Information Processing, devoted to the subject."Quantum Information Processing". Springer.com. Retrieved on 20110519.In February 2010, Digital Combinational Circuits like an adder, subtractor etc. are designed with the help of Symmetric Functions organized from different quantum gates.JOURNAL,weblink Digital Combinational Circuits Design by QCA Gates, Bhattacharjee, Pijush Kanti, 2010, International Journal of Computer and Electrical Engineering, 2, 1, 67â€“72, JOURNAL,weblink Digital Combinational Circuits Design with the Help of Symmetric Functions Considering Heat Dissipation by Each QCA Gate, Bhattacharjee, Pijush Kanti, International Journal of Computer and Electrical Engineering, 2, 4, 666â€“672, 2010, In April 2011, a team of scientists from Australia and Japan made a breakthrough in quantum teleportation, successfully transferring a complex set of quantum data with full transmission integrity, without affecting the qubits' superpositions.WEB,weblink Quantum teleporter breakthrough, University of New South Wales, 20110415,weblink" title="web.archive.org/web/20110418200747weblink">weblink 20110418, WEB, Lai, Richard,weblink First light wave quantum teleportation achieved, opens door to ultra fast data transmission, Engadget, 20110418, File:DWave 128chip.jpgthumbPhotograph of a chip constructed by DWave Systems Inc. Mounted and wirebonded in a sample holder. The DWave processor is designed to use 128 superconducting logic elements that exhibit controllable and tunable coupling to perform operations.]]In 2011, DWave Systems announced the first commercial quantum annealer, the DWave One, claiming a 128qubit processor. On 25 May 2011, Lockheed Martin agreed to purchase a DWave One system.WEB,weblink DWave Systems sells its first Quantum Computing System to Lockheed Martin Corporation, 20110530, 20110525, DWave, Lockheed and the University of Southern California (USC) will house the DWave One at the newly formed USC Lockheed Martin Quantum Computing Center.WEB,weblink Operational Quantum Computing Center Established at USC, 20111206, 20111029, University of Southern California, DWave's engineers designed the chips with an empirical approach, focusing on solving particular problems. Investors liked this more than academics, who said DWave had not demonstrated that they really had a quantum computer. Criticism softened after a DWave paper in Nature that proved that the chips have some quantum properties.JOURNAL, Quantum annealing with manufactured spins, Nature, 473, 194â€“198, 12 May 2011, 7346, 10.1038/nature10012, 21562559, Johnson, M. W., Amin, M. H. S., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A. J., Johansson, J., Bunyk, P., Chapple, E. M., Enderud, C., Hilton, J. P., Karimi, K., Ladizinsky, E., Ladizinsky, N., Oh, T., Perminov, I., Rich, C., Thom, M. C., Tolkacheva, E., Truncik, C. J. S., Uchaikin, S., Wang, J., Wilson, B., Rose, G., 2011Natur.473..194J, JOURNAL,weblink The CIA and Jeff Bezos Bet on Quantum Computing, Technology Review, October 4, 2012, Tom, Simonite, Two published papers have suggested that the DWave machine's operation can be explained classically, rather than requiring quantum models.ARXIV, 1401.7087, How "Quantum" is the DWave Machine?, 20140502, Seung Woo Shin, Smith, Graeme, Smolin, John A., Vazirani, Umesh, quantph, JOURNAL, 1304.4595, Quantum Annealing With More Than 100 Qbits, Nature Physics, 10, 3, 218â€“224, 2014, Boixo, Sergio, RÃ¸nnow, Troels F., Isakov, Sergei V., Wang, Zhihui, Wecker, David, Lidar, Daniel A., Martinis, John M., Troyer, Matthias, 10.1038/nphys2900, 2014NatPh..10..218B, Later work showed that classical models are insufficient when all available data is considered.JOURNAL, 1409.3827, Reexamining classical and quantum models for the DWave One processor, The European Physical Journal Special Topics, 224, 111, 111â€“129, 20140912, Albash, Tameem, RÃ¸nnow, Troels F., Troyer, Matthias, Lidar, Daniel A., 10.1140/epjst/e2015023460, 2015EPJST.224..111A, Experts remain divided on the ultimate classification of the DWave systems though their quantum behavior was established concretely with a demonstration of entanglement.JOURNAL, Entanglement in a quantum annealing processor, Physical Review X, 4, 2, 021041, 20140529, 10.1103/PhysRevX.4.021041, Lanting, T., Przybysz, A. J., Smirnov, A. Yu., Spedalieri, F. M., Amin, M. H., Berkley, A. J., Harris, R., Altomare, F., Boixo, S., Bunyk, P., Dickson, N., Enderud, C., Hilton, J. P., Hoskinson, E., Johnson, M. W., Ladizinsky, E., Ladizinsky, N., Neufeld, R., Oh, T., Perminov, I., Rich, C., Thom, M. C., Tolkacheva, E., Uchaikin, S., Wilson, A. B., Rose, G., 1401.3500, 2014PhRvX...4b1041L, During the same year, researchers at the University of Bristol created an allbulk optics system that ran a version of Shor's algorithm to successfully factor 21.JOURNAL, Implementation of an iterative quantum order finding algorithm, Lopez, Enrique Martin, Laing, Anthony, Lawson, Thomas, Alvarez, Roberto, XiaoQi, Zhou, O'Brien, Jeremy L., 2012, 10.1038/nphoton.2012.259, Nature Photonics, 6, 11, 773â€“776, 1111.4147, 2012NaPho...6..773M, In September 2011, researchers proved quantum computers can be made with a Von Neumann architecture (separation of RAM).JOURNAL, 1109.3743, Quantum computer with Von Neumann architecture, Science, 334, 6052, 61â€“65, Mariantoni, Matteo, Wang, H., Yamamoto, T., Neeley, M., Bialczak, Radoslaw C., Chen, Y., Lenander, M., Lucero, Erik, O'Connell, A. D., Sank, D., Weides, M., Wenner, J., Yin, Y., Zhao, J., Korotkov, A. N., Cleland, A. N., Martinis, John M., 2011, 10.1126/science.1208517, 21885732, 2011Sci...334...61M, In November 2011, researchers factorized 143 using 4 qubits.JOURNAL, 1111.3726, Quantum Factorization of 143 on a DipolarCoupling NMR system, Physical Review Letters, 109, 26, 269902, Xu, Nanyang, Zhu, Jing, Lu, Dawei, Zhou, Xianyi, Peng, Xinhua, Du, Jiangfeng, 2011, 10.1103/PhysRevLett.109.269902, 2012PhRvL.109z9902X, In February 2012, IBM scientists said that they had made several breakthroughs in quantum computing with superconducting integrated circuits.WEB,weblink IBM Says It's 'On the Cusp' of Building a Quantum Computer, PCMAG, 20141026, In April 2012, a multinational team of researchers from the University of Southern California, the Delft University of Technology, the Iowa State University of Science and Technology, and the University of California, Santa Barbara constructed a 2qubit quantum computer on a doped diamond crystal that can easily be scaled up and is functional at room temperature. Two logical qubit directions of electron spin and nitrogen kernels spin were used, with microwave pulses. This computer ran Grover's algorithm, generating the right answer on the first try in 95% of cases.WEB,weblink Quantum computer built inside diamond, Futurity, 20141026, 20120409, In September 2012, Australian researchers at the University of New South Wales said the world's first quantum computer was just 5 to 10 years away, after announcing a global breakthrough enabling the manufacture of its memory building blocks. A research team led by Australian engineers created the first working qubit based on a single atom in silicon, invoking the same technological platform that forms the building blocks of modernday computers.WEB, Australian engineers write quantum computer 'qubit' in global breakthrough,weblink The Australian, 20121003, WEB, Breakthrough in bid to create first quantum computer,weblink University of New South Wales, 20121003, 20120919, In October 2012, Nobel Prizes were awarded to David J. Wineland and Serge Haroche for their basic work on understanding the quantum world, which may help make quantum computing possible.NEWSPAPER, Frank, Adam, Cracking the Quantum Safe,weblink October 14, 2012, The New York Times, 20121014, NEWSPAPER, Overbye, Dennis, A Nobel for Teasing Out the Secret Life of Atoms,weblink October 9, 2012, The New York Times, 20121014, In November 2012, the first quantum teleportation from one macroscopic object to another was reported by scientists at the University of Science and Technology of China.WEB, First Teleportation from One Macroscopic Object to Another: The Physics arXiv Blog,weblink November 15, 2012, MIT Technology Review, 20121117, JOURNAL, Bao, XiaoHui, Xu, XiaoFan, Li, CheMing, Yuan, ZhenSheng, Lu, ChaoYang, Pan, Jianwei, Quantum teleportation between remote atomicensemble quantum memories, Proceedings of the National Academy of Sciences, 109, 50, 20347â€“20351, November 13, 2012, 1211.2892, 10.1073/pnas.1207329109, 23144222, 3528515, 2012PNAS..10920347B, In December 2012, 1QBit, the first dedicated quantum computing software company, was founded in Vancouver, BC.WEB, 1QBit Founded,weblink 1QBit.com, 20140622,weblink" title="web.archive.org/web/20140619083509weblink">weblink 20140619, yes, 1QBit is the first company to focus exclusively on commercializing software applications for commercially available quantum computers, including the DWave Two. 1QBit's research demonstrated the ability of superconducting quantum annealing processors to solve realworld problems.WEB, 1QBit Research,weblink 1QBit.com, 20140622,weblink" title="web.archive.org/web/20140619053448weblink">weblink 20140619, yes, In February 2013, a new technique, boson sampling, was reported by two groups using photons in an optical lattice that is not a universal quantum computer, but may be good enough for practical problems.JOURNAL, Spring, Justin, Metcalf, Benjamin, Humphreys, Peter, Kolthammer, Steven, Jin, XianMin, Barbieri, Marco, Datta, Animesh, ThomasPeter, Nicholas, Langford, Nathan, Kundys, Dmytro, Gates, James, Smith, Brian, Smith, Peter, Walmsley, Ian, Boson sampling on a photonic chip, Science, 2013, 339, 6121, 798â€“801, 10.1126/science.1231692, 1212.2622, 2013Sci...339..798S, 23258407, In May 2013, Google announced that it was launching the Quantum Artificial Intelligence Lab, hosted by NASA's Ames Research Center, with a 512qubit DWave quantum computer. The Universities Space Research Association (USRA) will invite researchers to share time on it with the goal of studying quantum computing for machine learning.WEB, Launching the Quantum Artificial Intelligence Lab,weblink Research@Google Blog, 20130516, Weâ€™ve already developed some quantum machine learning algorithms. One produces very compact, efficient recognizers  very useful when youâ€™re short on power, as on a mobile device. Another can handle highly polluted training data, where a high percentage of the examples are mislabeled, as they often are in the real world. And weâ€™ve learned some useful principles: e.g., you get the best results not with pure quantum computing, but by mixing quantum and classical computing., Google added that they had "already developed some quantum machine learning algorithms" and had "learned some useful principles", such as that "best results" come from "mixing quantum and classical computing".In early 2014, based on documents provided by former NSA contractor Edward Snowden, it was reported that the U.S. National Security Agency (NSA) is running a $79.7 million research program titled "Penetrating Hard Targets", to develop a quantum computer capable of breaking vulnerable encryption.NEWS, NSA seeks to build quantum computer that could crack most types of encryption,weblink Washington Post, January 2, 2014, In 2014, a group of researchers from ETH ZÃ¼rich, USC, Google, and Microsoft reported a definition of quantum speedup, and were not able to measure quantum speedup with the DWave Two device, but did not explicitly rule it out.JOURNAL, 1401.2910v1, Ambainis, Andris, Wang, Z., Job, J., Boixo, S., Isakov, S. V., Wecker, D., Martinis, J. M., Lidar, D. A., Troyer, M., Defining and detecting quantum speedup, Science, 345, 6195, 420â€“424, 2014, 10.1126/science.1252319, 25061205, 2014Sci...345..420R, JOURNAL,weblink Quantum Chaos: After a Failed Speed Test, the DWave Debate Continues, Scientific American, 20140619, In 2014, researchers at University of New South Wales used silicon as a protectant shell around qubits, making them more accurate, increasing the length of time they will hold information, and possibly making quantum computers easier to build.JOURNAL,weblink Researchers use silicon to push quantum computing toward reality, Computer World, 23 October 2014, Sharon, Gaudin, In April 2015, IBM scientists claimed two critical advances towards the realization of a practical quantum computer, claiming the ability to detect and measure both kinds of quantum errors simultaneously, as well as a new, square quantum bit circuit design that could scale to larger dimensions.WEB,weblink IBM achieves critical steps to first quantum computer, 29 April 2015, www03.ibm.com, In October 2015, QuTech successfully conducted the Loopholefree Bell inequality violation test using electron spins separated by 1.3 kilometres.JOURNAL, Loopholefree Bell inequality violation using electron spins separated by 1.3 kilometres, B, Hensen, Nature, 526, 7575, 682â€“686, 10.1038/nature15759, 26503041, 2015, 2015Natur.526..682H, 1508.05949, In October 2015, researchers at the University of New South Wales built a quantum logic gate in silicon for the first time.WEB,weblink World's First Silicon Quantum Logic Gate Brings Quantum Computing One Step Closer, Jamie, Condliffe, In December 2015, NASA publicly displayed the world's first fully operational quantum computer made by DWave Systems at the Quantum Artificial Intelligence Lab at its Ames Research Center. The device was purchased in 2013 via a partnership with Google and Universities Space Research Association. The presence and use of quantum effects in the DWave quantum processing unit is more widely accepted.WEB, 3Q: Scott Aaronson on Google's new quantumcomputing paper,weblink MIT News, 20160105, In some tests, it can be shown that the DWave quantum annealing processor outperforms Selbyâ€™s algorithm.ARXIV, 1508.05087, Ambainis, Andris, Benchmarking a quantum annealing processor with the timetotarget metric, quantph, 2015, Only two of these computers have been made so far.In May 2016, IBM Research announcedNEWS, IBM Makes Quantum Computing Available on IBM Cloud to Accelerate Innovation,weblink May 4, 2016, May 4, 2016, that for the first time ever it is making quantum computing available to members of the public via the cloud, who can access and run experiments on IBMâ€™s quantum processor, calling the service the IBM Quantum Experience. The quantum processor is composed of five superconducting qubits and is housed at IBM's Thomas J. Watson Research Center.In August 2016, scientists at the University of Maryland successfully built the first reprogrammable quantum computer.WEB, MacDonald, Fiona, Researchers have built the first reprogrammable quantum computer,weblink ScienceAlert, 8 August 2016, In October 2016, the University of Basel described a variant of the electronhole based quantum computer, which instead of manipulating electron spins, uses electron holes in a semiconductor at low (mK) temperatures, which are much less vulnerable to decoherence. This has been dubbed the "positronic" quantum computer, as the quasiparticle behaves as if it has a positive electrical charge.WEB,weblink A new Type of Quantum Bit, www.unibas.ch, In March 2017, IBM announced an industryfirst initiative, called IBM Q, to build commercially available universal quantum computing systems. The company also released a new API for the IBM Quantum Experience that enables developers and programmers to begin building interfaces between its existing 5qubit cloudbased quantum computer and classical computers, without needing a deep background in quantum physics.In May 2017, IBM announcedNEWS, IBM Builds Its Most Powerful Universal Quantum Computing Processors,weblink 17 May 2017, 17 May 2017, that it had successfully built and tested its most powerful universal quantum computing processors. The first is a 16qubit processor that will allow for more complex experimentation than the previously available 5qubit processor. The second is IBM's first prototype commercial processor with 17 qubits, and leverages significant materials, device, and architecture improvements to make it the most powerful quantum processor created to date by IBM.In July 2017, a group of U.S. researchers announced a quantum simulator with 51 qubits. The announcement was made by Mikhail Lukin of Harvard University at the International Conference on Quantum Technologies in Moscow.MAGAZINE, Reynolds, Matt, Quantum simulator with 51 qubits is largest ever,weblink New Scientist, 23 July 2017, A quantum simulator differs from a computer. Lukinâ€™s simulator was designed to solve one equation. Solving a different equation would require building a new system, whereas a computer can solve many different equations.In September 2017, IBM Research scientists used a 7qubit device to model beryllium hydride molecule, the largest molecule to date by a quantum computer.NEWS, IBM Pioneers New Approach to Simulate Chemistry with Quantum Computing,weblink 13 September 2017, 13 September 2017, The results were published as the cover story in the peerreviewed journal Nature.In October 2017, IBM Research scientists successfully "broke the 49qubit simulation barrier" and simulated 49 and 56qubit shortdepth circuits, using the Lawrence Livermore National Laboratory's Vulcan supercomputer, and the University of Illinois' Cyclops Tensor Framework (originally developed at the University of California).ARXIV, Breaking the 49Qubit Barrier in the Simulation of Quantum Circuits, 1710.05867, 16 October 2017, Pednault, Edwin, Gunnels, John A, Nannicini, Giacomo, Horesh, Lior, Magerlein, Thomas, Solomonik, Edgar, Wisnieff, Robert, quantph, In November 2017, the University of Sydney research team successfully made a microwave circulator, an important quantum computer part, that was 1000 times smaller than a conventional circulator, by using topological insulators to slow down the speed of light in a material.WEB,weblink Key component for quantum computing invented: University of Sydney team develop microcircuit based on Nobel Prize research, In December 2017, IBM announcedNEWS, IBM Announces Collaboration with Leading Fortune 500 Companies, Academic Institutions and National Research Labs to Accelerate Quantum Computing,weblink 14 December 2017, 14 November 2017, its first IBM Q Network clients. The companies, universities, and labs that will explore practical business and science quantum applications, using IBM Q 20qubit commercial systems, include: JPMorgan Chase, Daimler AG, Samsung, JSR Corporation, Barclays, Hitachi Metals, Honda, Nagase, Keio University, Oak Ridge National Lab, Oxford University and University of Melbourne.In December 2017, Microsoft released a preview version of a "Quantum Development Kit",WEB,weblink Microsoft Quantum Development Kit: Introduction and stepbystep demo, Microsoft Mechanics, 11 December 2017, YouTube, which includes a programming language, Q# that can be used to write programs that are run on an emulated quantum computer.In 2017, DWave was reported to be selling a 2,000qubit quantum computer.MAGAZINE,weblink Got a spare $15 million? Why not buy your very own DWave quantum computer, Wired, James, Temperton, 26 January 2017, 13 May 2018, In late 2017 and early 2018, IBM,WEB,weblink IBM Raises the Bar with a 50Qubit Quantum Computer, Will Knight, 20171110, MIT Technology Review, 20171213, Intel,WEB, Hsu, Jeremy, CES 2018: Intel's 49Qubit Chip Shoots for Quantum Supremacy,weblink Institute of Electrical and Electronics Engineers, July 5, 2018, January 9, 2018, and GoogleNEWS,weblink Google aims for quantum supremacy, Susan Curtis, PhysicsWorld, 20180306, 20180912, enUS, each reported testing quantum processors containing 50, 49, and 72 qubits, respectively, all realized using superconducting circuits. By number of qubits, these circuits are approaching the range in which simulating their quantum dynamics is expected to become prohibitive on classical computers, although it has been argued that further improvements in error rates are needed to put classical simulation out of reach.NEWS,weblink Google, Alibaba Spar Over Timeline for "Quantum Supremacy", Tom Simonite, 20180519, Wired, 20180912, In February 2018, scientists reported, for the first time, the discovery of a new form of light, which may involve polaritons, that could be useful in the development of quantum computers.WEB, Hignett, Katherine, Physics Creates New Form Of Light That Could Drive The Quantum Computing Revolution,weblink 16 February 2018, Newsweek, 17 February 2018, JOURNAL, Liang, QiYu, etal, Observation of threephoton bound states in a quantum nonlinear medium, 16 February 2018, Science (journal), Science, 359, 6377, 783â€“786, 10.1126/science.aao7293, 29449489, 6467536, 1709.01478, 2018Sci...359..783L, In February 2018, QuTech reported successfully testing a siliconbased twospinqubits quantum processor.NEWS, Giles, Martin, Oldfashioned silicon might be the key to building ubiquitous quantum computers,weblink July 5, 2018, MIT Technology Review, February 15, 2018, In June 2018, Intel began testing a siliconbased spinqubit processor, manufactured in the company's D1D Fab in Oregon.NEWS, Forrest, Conner, Why Intel's smallest spin qubit chip could be a turning point in quantum computing,weblink July 12, 2018, TechRepublic, June 12, 2018, In July 2018, a team led by the University of Sydney achieved the world's first multiqubit demonstration of a quantum chemistry calculation performed on a system of trapped ions, one of the leading hardware platforms in the race to develop a universal quantum computer.NEWS,weblink Worldfirst quantum computer simulation of chemical bonds using trapped ions: Quantum chemistry expected to be one of the first applications of fullscale quantum computers, ScienceDaily, 20180813, en, In December 2018, IonQ reported that its machine could be built as large as 160 qubits.WEB,weblink This Could Be the Best Quantum Computer Yet, Mandelbaum, Ryan F., Gizmodo, enUS, 20181224, In January 2019, IBM launched IBM Q System One, its first integrated quantum computing system for commercial use.NEWS, IBM Unveils World's First Integrated Quantum Computing System for Commercial Use,weblink 8 January 2019, IBM, 14 January 2019, NEWS, IBM unveils its first commercial quantum computer,weblink 8 January 2019, Tech Crunch, 14 January 2019, IBM Q System One is designed by industrial design company Map Project Office and interior design company Universal Design StudioWEB,weblink IBM collaborates with British designers to create first standalone quantum supercomputer, Magazine, Wallpaper*, 20190108, Wallpaper*, 20190218, .In March 2019, a group of Russian scientists used the openaccess IBM quantum computer to demonstrate a protocol for the complex conjugation of the probability amplitudes needed for time reversal of a physical process,G. B. Lesovik, I. A. Sadovskyy, M. V. Suslov, A. V. Lebedev & V. M. Vinokur (13 March 2019) Arrow of time and its reversal on the IBM quantum computer. Nature Scientific Reports volume 9, Article number: 4396 (2019) in this case, for an electron scattered on a twolevel impurity, a twoqubit experiment. However, for the threequbit experiment, the amplitude fell below 50%(failure of time reversal, due to its increased complexity).Aakash Jhaveri (14 March 2019) Scientists Were Able to Reverse Time, But There's A CatchRelation to computational complexity theory(File:BQP complexity class diagram.svgthumbThe suspected relationship of BQP to other problem spaces.Nielsen, p. 42)The class of problems that can be efficiently solved by quantum computers is called BQP, for "bounded error, quantum, polynomial time". Quantum computers only run probabilistic algorithms, so BQP on quantum computers is the counterpart of BPP ("bounded error, probabilistic, polynomial time") on classical computers. It is defined as the set of problems solvable with a polynomialtime algorithm, whose probability of error is bounded away from one half.Nielsen, p. 41 A quantum computer is said to "solve" a problem if, for every instance, its answer will be right with high probability. If that solution runs in polynomial time, then that problem is in BQP.BQP is contained in the complexity class #P (or more precisely in the associated class of decision problems P#P),JOURNAL, Bernstein, Ethan, Vazirani, Umesh, 10.1137/S0097539796300921, Quantum Complexity Theory, 1997, 1411â€“1473, 26, SIAM Journal on Computing,weblink 5, 10.1.1.144.7852, which is a subclass of PSPACE.BQP is suspected to be disjoint from NPcomplete and a strict superset of P, but that is not known. Both integer factorization and discrete log are in BQP. Both of these problems are NP problems suspected to be outside BPP, and hence outside P. Both are suspected to not be NPcomplete. There is a common misconception that quantum computers can solve NPcomplete problems in polynomial time. That is not known to be true, and is generally suspected to be false.The capacity of a quantum computer to accelerate classical algorithms has rigid limitsâ€”upper bounds of quantum computation's complexity. The overwhelming part of classical calculations cannot be accelerated on a quantum computer.JOURNAL, Ozhigov, Yuri, Quantum Computers Speed Up Classical with Probability Zero, 1999, 1707â€“1714, 10, Chaos, Solitons & Fractals, quantph/9803064, 1998quant.ph..3064O, 10.1016/S09600779(98)002264, 10, A similar fact prevails for particular computational tasks, like the search problem, for which Grover's algorithm is optimal.JOURNAL, Ozhigov, Yuri, Lower Bounds of Quantum Search for Extreme Point, 1999, 2165â€“2172, A455, Proceedings of the London Royal Society, quantph/9806001, 1999RSPSA.455.2165O, 10.1098/rspa.1999.0397, 1986, Bohmian Mechanics is a nonlocal hidden variable interpretation of quantum mechanics. It has been shown that a nonlocal hidden variable quantum computer could implement a search of an Nitem database at most in O(sqrt[3]{N}) steps. This is slightly faster than the O(sqrt{N}) steps taken by Grover's algorithm. Neither search method will allow quantum computers to solve NPComplete problems in polynomial time.WEB,weblink Quantum Computing and Hidden Variables, Aaronson, Scott, Although quantum computers may be faster than classical computers for some problem types, those described above cannot solve any problem that classical computers cannot already solve. A Turing machine can simulate these quantum computers, so such a quantum computer could never solve an undecidable problem like the halting problem. The existence of "standard" quantum computers does not disprove the Churchâ€“Turing thesis.Nielsen, p. 126 It has been speculated that theories of quantum gravity, such as Mtheory or loop quantum gravity, may allow even faster computers to be built. Currently, defining computation in such theories is an open problem due to the problem of time, i.e., there currently exists no obvious way to describe what it means for an observer to submit input to a computer and later receive output.JOURNAL, Scott Aaronson, NPcomplete Problems and Physical Reality, ACM SIGACT News, 2005, quantph/0502072, 2005, 2005quant.ph..2072A, See section 7 "Quantum Gravity": "[â€¦] to anyone who wantsa test or benchmark for a favorite quantum gravity theory,[author's footnote: That is, one without all the bother of making numerical predictions and comparing them to observation] let me humbly propose the following: can you define Quantum Gravity PolynomialTime? [â€¦] until we can say what it means for a 'user' to specify an 'input' andâ€˜later' receive an 'output'â€”there is no such thing as computation, not even theoretically." (emphasis in original)See also{hide}columnslistcolwidth=20em
References{{Reflist30em}}Further reading{{Too much further readingdate=May 2019reason=No indication why any of these are justified here; if used as references, they should be incorporated into the article; if not, each entry should be justified. This is turning into a deadtree equivalent of a link farm, primarily to promote the text and papers listed.}}
External links{{CommonsQuantum computer}}

 content above as imported from Wikipedia
 "quantum computing" does not exist on GetWiki (yet)
 time: 6:19am EDT  Sat, Aug 24 2019
 "quantum computing" does not exist on GetWiki (yet)
 time: 6:19am EDT  Sat, Aug 24 2019
[ this remote article is provided by Wikipedia ]
LATEST EDITS [ see all ]
GETWIKI 09 JUL 2019
Eastern Philosophy
History of Philosophy
History of Philosophy
GETWIKI 09 MAY 2016
GetMeta:About
GetWiki
GetWiki
GETWIKI 18 OCT 2015
M.R.M. Parrott
Biographies
Biographies
GETWIKI 20 AUG 2014
GetMeta:News
GetWiki
GetWiki
GETWIKI 19 AUG 2014
© 2019 M.R.M. PARROTT  ALL RIGHTS RESERVED