A major contributor to this article appears to have a close connection with its subject.(September 2018) (Learn how and when to remove this template message) |

Part of a series on |

Quantum mechanics |
---|

**Quantum machine learning** is the integration of quantum algorithms within machine learning programs.^{ [1] }^{ [2] }^{ [3] }^{ [4] }^{ [5] }^{ [6] }^{ [7] } The most common use of the term refers to machine learning algorithms for the analysis of classical data executed on a quantum computer, i.e. *quantum-enhanced machine learning*.^{ [8] }^{ [9] }^{ [10] }^{ [11] } While machine learning algorithms are used to compute immense quantities of data, quantum machine learning utilizes qubits and quantum operations or specialized quantum systems to improve computational speed and data storage done by algorithms in a program.^{ [12] } This includes hybrid methods that involve both classical and quantum processing, where computationally difficult subroutines are outsourced to a quantum device.^{ [13] }^{ [14] }^{ [15] } These routines can be more complex in nature and executed faster on a quantum computer.^{ [2] } Furthermore, quantum algorithms can be used to analyze quantum states instead of classical data.^{ [16] }^{ [17] } Beyond quantum computing, the term "quantum machine learning" is also associated with classical machine learning methods applied to data generated from quantum experiments (i.e. * machine learning of quantum systems *), such as learning the phase transitions of a quantum system^{ [18] }^{ [19] } or creating new quantum experiments.^{ [20] }^{ [21] }^{ [22] }^{ [23] } Quantum machine learning also extends to a branch of research that explores methodological and structural similarities between certain physical systems and learning systems, in particular neural networks. For example, some mathematical and numerical techniques from quantum physics are applicable to classical deep learning and vice versa.^{ [24] }^{ [25] }^{ [26] } Furthermore, researchers investigate more abstract notions of learning theory with respect to quantum information, sometimes referred to as "quantum learning theory".^{ [27] }^{ [28] }

- Machine learning with quantum computers
- Linear algebra simulation with quantum amplitudes
- Quantum machine learning algorithms based on Grover search
- Quantum-enhanced reinforcement learning
- Quantum annealing
- Quantum sampling techniques
- Quantum neural networks
- Hidden Quantum Markov Models
- Fully quantum machine learning
- Classical learning applied to quantum problems
- Quantum learning theory
- Implementations and experiments
- Skepticism
- See also
- References

Quantum-enhanced machine learning refers to quantum algorithms that solve tasks in machine learning, thereby improving and often expediting classical machine learning techniques. Such algorithms typically require one to encode the given classical data set into a quantum computer to make it accessible for quantum information processing. Subsequently, quantum information processing routines are applied and the result of the quantum computation is read out by measuring the quantum system. For example, the outcome of the measurement of a qubit reveals the result of a binary classification task. While many proposals of quantum machine learning algorithms are still purely theoretical and require a full-scale universal quantum computer to be tested, others have been implemented on small-scale or special purpose quantum devices.

A number of quantum algorithms for machine learning are based on the idea of *amplitude encoding*, that is, to associate the amplitudes of a quantum state with the inputs and outputs of computations.^{ [31] }^{ [32] }^{ [33] }^{ [34] } Since a state of qubits is described by complex amplitudes, this information encoding can allow for an exponentially compact representation. Intuitively, this corresponds to associating a discrete probability distribution over binary random variables with a classical vector. The goal of algorithms based on amplitude encoding is to formulate quantum algorithms whose resources grow polynomially in the number of qubits , which amounts to a logarithmic growth in the number of amplitudes and thereby the dimension of the input.

Many quantum machine learning algorithms in this category are based on variations of the quantum algorithm for linear systems of equations ^{ [35] } (colloquially called HHL, after the paper's authors) which, under specific conditions, performs a matrix inversion using an amount of physical resources growing only logarithmically in the dimensions of the matrix. One of these conditions is that a Hamiltonian which entrywise corresponds to the matrix can be simulated efficiently, which is known to be possible if the matrix is sparse^{ [36] } or low rank.^{ [37] } For reference, any known classical algorithm for matrix inversion requires a number of operations that grows at least quadratically in the dimension of the matrix, but they are not restricted to sparse matrices.

Quantum matrix inversion can be applied to machine learning methods in which the training reduces to solving a linear system of equations, for example in least-squares linear regression,^{ [32] }^{ [33] } the least-squares version of support vector machines,^{ [31] } and Gaussian processes.^{ [34] }

A crucial bottleneck of methods that simulate linear algebra computations with the amplitudes of quantum states is state preparation, which often requires one to initialise a quantum system in a state whose amplitudes reflect the features of the entire dataset. Although efficient methods for state preparation are known for specific cases,^{ [38] }^{ [39] } this step easily hides the complexity of the task.^{ [40] }^{ [41] }

Another approach to improving classical machine learning with quantum information processing uses amplitude amplification methods based on Grover's search algorithm, which has been shown to solve unstructured search problems with a quadratic speedup compared to classical algorithms. These quantum routines can be employed for learning algorithms that translate into an unstructured search task, as can be done, for instance, in the case of the k-medians ^{ [42] } and the k-nearest neighbors algorithms.^{ [8] } Another application is a quadratic speedup in the training of perceptron.^{ [43] }

An example of amplitude amplification being used in a machine learning algorithm is Grover's search algorithm minimization. In which a subroutine uses Grover's search algorithm to find an element less than some previously defined element. This can be done with an oracle that determines whether or not a state with a corresponding element is less than the predefined one. Grover's algorithm can then find an element such that our condition is met. The minimization is initialized by some random element in our data set, and iteratively does this subroutine to find the minimum element in the data set. This minimization is notably used in quantum k-medians, and it has a speed up of at least compared to classical versions of k-medians, where is the number of data points and is the number of clusters.^{ [42] }

Amplitude amplification is often combined with quantum walks to achieve the same quadratic speedup. Quantum walks have been proposed to enhance Google's PageRank algorithm^{ [44] } as well as the performance of reinforcement learning agents in the projective simulation framework.^{ [45] }

Reinforcement learning is a branch of machine learning distinct from supervised and unsupervised learning, which also admits quantum enhancements.^{ [46] }^{ [45] }^{ [47] }^{ [48] } In quantum-enhanced reinforcement learning, a quantum agent interacts with a classical environment and occasionally receives rewards for its actions, which allows the agent to adapt its behavior—in other words, to learn what to do in order to gain more rewards. In some situations, either because of the quantum processing capability of the agent,^{ [45] } or due to the possibility to probe the environment in superpositions,^{ [30] } a quantum speedup may be achieved. Implementations of these kinds of protocols in superconducting circuits^{ [49] } and in systems of trapped ions^{ [50] }^{ [51] } have been proposed.

Quantum annealing is an optimization technique used to determine the local minima and maxima of a function over a given set of candidate functions. This is a method of discretizing a function with many local minima or maxima in order to determine the observables of the function. The process can be distinguished from Simulated annealing by the Quantum tunneling process, by which particles tunnel through kinetic or potential barriers from a high state to a low state. Quantum annealing starts from a superposition of all possible states of a system, weighted equally. Then the time-dependent Schrödinger equation guides the time evolution of the system, serving to affect the amplitude of each state as time increases. Eventually, the ground state can be reached to yield the instantaneous Hamiltonian of the system.

Sampling from high-dimensional probability distributions is at the core of a wide spectrum of computational techniques with important applications across science, engineering, and society. Examples include deep learning, probabilistic programming, and other machine learning and artificial intelligence applications.

A computationally hard problem, which is key for some relevant machine learning tasks, is the estimation of averages over probabilistic models defined in terms of a Boltzmann distribution. Sampling from generic probabilistic models is hard: algorithms relying heavily on sampling are expected to remain intractable no matter how large and powerful classical computing resources become. Even though quantum annealers, like those produced by D-Wave Systems, were designed for challenging combinatorial optimization problems, it has been recently recognized as a potential candidate to speed up computations that rely on sampling by exploiting quantum effects.^{ [52] }

Some research groups have recently explored the use of quantum annealing hardware for training Boltzmann machines and deep neural networks.^{ [53] }^{ [54] }^{ [55] }^{ [56] }^{ [57] }^{ [58] } The standard approach to training Boltzmann machines relies on the computation of certain averages that can be estimated by standard sampling techniques, such as Markov chain Monte Carlo algorithms. Another possibility is to rely on a physical process, like quantum annealing, that naturally generates samples from a Boltzmann distribution. The objective is to find the optimal control parameters that best represent the empirical distribution of a given dataset.

The D-Wave 2X system hosted at NASA Ames Research Center has been recently used for the learning of a special class of restricted Boltzmann machines that can serve as a building block for deep learning architectures.^{ [55] } Complementary work that appeared roughly simultaneously showed that quantum annealing can be used for supervised learning in classification tasks.^{ [53] } The same device was later used to train a fully connected Boltzmann machine to generate, reconstruct, and classify down-scaled, low-resolution handwritten digits, among other synthetic datasets.^{ [54] } In both cases, the models trained by quantum annealing had a similar or better performance in terms of quality. The ultimate question that drives this endeavour is whether there is quantum speedup in sampling applications. Experience with the use of quantum annealers for combinatorial optimization suggests the answer is not straightforward.

Inspired by the success of Boltzmann machines based on classical Boltzmann distribution, a new machine learning approach based on quantum Boltzmann distribution of a transverse-field Ising Hamiltonian was recently proposed.^{ [59] } Due to the non-commutative nature of quantum mechanics, the training process of the quantum Boltzmann machine can become nontrivial. This problem was, to some extent, circumvented by introducing bounds on the quantum probabilities, allowing the authors to train the model efficiently by sampling. It is possible that a specific type of quantum Boltzmann machine has been trained in the D-Wave 2X by using a learning rule analogous to that of classical Boltzmann machines.^{ [54] }^{ [56] }^{ [60] }

Quantum annealing is not the only technology for sampling. In a prepare-and-measure scenario, a universal quantum computer prepares a thermal state, which is then sampled by measurements. This can reduce the time required to train a deep restricted Boltzmann machine, and provide a richer and more comprehensive framework for deep learning than classical computing.^{ [61] } The same quantum methods also permit efficient training of full Boltzmann machines and multi-layer, fully connected models and do not have well-known classical counterparts. Relying on an efficient thermal state preparation protocol starting from an arbitrary state, quantum-enhanced Markov logic networks exploit the symmetries and the locality structure of the probabilistic graphical model generated by a first-order logic template.^{ [62] } This provides an exponential reduction in computational complexity in probabilistic inference, and, while the protocol relies on a universal quantum computer, under mild assumptions it can be embedded on contemporary quantum annealing hardware.

Quantum analogues or generalizations of classical neural nets are often referred to as quantum neural networks. The term is claimed by a wide range of approaches, including the implementation and extension of neural networks using photons, layered variational circuits or quantum Ising-type models. Quantum neural networks are often defined as an expansion on Deutsch's model of a quantum computational network.^{ [63] } Within this model, nonlinear and irreversible gates, dissimilar to the Hamiltonian operator, are deployed to speculate the given data set.^{ [63] } Such gates make certain phases unable to be observed and generate specific oscillations.^{ [63] } Quantum neural networks apply the principals quantum information and quantum computation to classical neurocomputing.^{ [64] } Current research shows that QNN can exponentially increase the amount of computing power and the degrees of freedom for a computer, which is limited for a classical computer to its size.^{ [64] } A quantum neural network has computational capabilities to decrease the number of steps, qubits used, and computation time.^{ [63] } The wave function to quantum mechanics is the neuron for Neural networks. To test quantum applications in a neural network, quantum dot molecules are deposited on a substrate of GaAs or similar to record how they communicate with one another. Each quantum dot can be referred as an island of electric activity, and when such dots are close enough (approximately 10±20 nm)^{ [65] } electrons can tunnel underneath the islands. An even distribution across the substrate in sets of two create dipoles and ultimately two spin states, up or down. These states are commonly known as qubits with corresponding states of and in Dirac notation.^{ [65] }

Hidden Quantum Markov Models^{ [66] } (HQMMs) are a quantum-enhanced version of classical Hidden Markov Models (HMMs), which are typically used to model sequential data in various fields like robotics and natural language processing. Unlike the approach taken by other quantum-enhanced machine learning algorithms, HQMMs can be viewed as models inspired by quantum mechanics that can be run on classical computers as well.^{ [67] } Where classical HMMs use probability vectors to represent hidden 'belief' states, HQMMs use the quantum analogue: density matrices. Recent work has shown that these models can be successfully learned by maximizing the log-likelihood of the given data via classical optimization, and there is some empirical evidence that these models can better model sequential data compared to classical HMMs in practice, although further work is needed to determine exactly when and how these benefits are derived.^{ [67] } Additionally, since classical HMMs are a particular kind of Bayes net, an exciting aspect of HQMMs is that the techniques used show how we can perform quantum-analogous Bayesian inference, which should allow for the general construction of the quantum versions of probabilistic graphical models.^{ [67] }

In the most general case of quantum machine learning, both the learning device and the system under study, as well as their interaction, are fully quantum. This section gives a few examples of results on this topic.

One class of problem that can benefit from the fully quantum approach is that of 'learning' unknown quantum states, processes or measurements, in the sense that one can subsequently reproduce them on another quantum system. For example, one may wish to learn a measurement that discriminates between two coherent states, given not a classical description of the states to be discriminated, but instead a set of example quantum systems prepared in these states. The naive approach would be to first extract a classical description of the states and then implement an ideal discriminating measurement based on this information. This would only require classical learning. However, one can show that a fully quantum approach is strictly superior in this case.^{ [68] } (This also relates to work on quantum pattern matching.^{ [69] }) The problem of learning unitary transformations can be approached in a similar way.^{ [70] }

Going beyond the specific problem of learning states and transformations, the task of clustering also admits a fully quantum version, wherein both the oracle which returns the distance between data-points and the information processing device which runs the algorithm are quantum.^{ [71] } Finally, a general framework spanning supervised, unsupervised and reinforcement learning in the fully quantum setting was introduced in,^{ [30] } where it was also shown that the possibility of probing the environment in superpositions permits a quantum speedup in reinforcement learning.

The term "quantum machine learning" sometimes refers to *classical* machine learning performed on data from quantum systems. A basic example of this is quantum state tomography, where a quantum state is learned from measurement. Other applications include learning Hamiltonians^{ [72] } and automatically generating quantum experiments.^{ [20] }

Quantum learning theory pursues a mathematical analysis of the quantum generalizations of classical learning models and of the possible speed-ups or other improvements that they may provide. The framework is very similar to that of classical computational learning theory, but the learner in this case is a quantum information processing device, while the data may be either classical or quantum. Quantum learning theory should be contrasted with the quantum-enhanced machine learning discussed above, where the goal was to consider *specific problems* and to use quantum protocols to improve the time complexity of classical algorithms for these problems. Although quantum learning theory is still under development, partial results in this direction have been obtained.^{ [73] }

The starting point in learning theory is typically a *concept class*, a set of possible concepts. Usually a concept is a function on some domain, such as . For example, the concept class could be the set of disjunctive normal form (DNF) formulas on *n* bits or the set of Boolean circuits of some constant depth. The goal for the learner is to learn (exactly or approximately) an unknown *target concept* from this concept class. The learner may be actively interacting with the target concept, or passively receiving samples from it.

In active learning, a learner can make *membership queries* to the target concept *c*, asking for its value *c(x)* on inputs *x* chosen by the learner. The learner then has to reconstruct the exact target concept, with high probability. In the model of *quantum exact learning*, the learner can make membership queries in quantum superposition. If the complexity of the learner is measured by the number of membership queries it makes, then quantum exact learners can be polynomially more efficient than classical learners for some concept classes, but not more.^{ [74] } If complexity is measured by the amount of *time* the learner uses, then there are concept classes that can be learned efficiently by quantum learners but not by classical learners (under plausible complexity-theoretic assumptions).^{ [74] }

A natural model of passive learning is Valiant's probably approximately correct (PAC) learning. Here the learner receives random examples *(x,c(x))*, where *x* is distributed according to some unknown distribution *D*. The learner's goal is to output a hypothesis function *h* such that *h(x)=c(x)* with high probability when *x* is drawn according to *D*. The learner has to be able to produce such an 'approximately correct' *h* for every *D* and every target concept *c* in its concept class. We can consider replacing the random examples by potentially more powerful quantum examples . In the PAC model (and the related agnostic model), this doesn't significantly reduce the number of examples needed: for every concept class, classical and quantum sample complexity are the same up to constant factors.^{ [75] } However, for learning under some fixed distribution *D*, quantum examples can be very helpful, for example for learning DNF under the uniform distribution.^{ [76] } When considering *time* complexity, there exist concept classes that can be PAC-learned efficiently by quantum learners, even from classical examples, but not by classical learners (again, under plausible complexity-theoretic assumptions).^{ [74] }

This passive learning type is also the most common scheme in supervised learning: a learning algorithm typically takes the training examples fixed, without the ability to query the label of unlabelled examples. Outputting a hypothesis *h* is a step of induction. Classically, an inductive model splits into a training and an application phase: the model parameters are estimated in the training phase, and the learned model is applied an arbitrary many times in the application phase. In the asymptotic limit of the number of applications, this splitting of phases is also present with quantum resources.^{ [77] }

The earliest experiments were conducted using the adiabatic D-Wave quantum computer, for instance, to detect cars in digital images using regularized boosting with a nonconvex objective function in a demonstration in 2009.^{ [78] } Many experiments followed on the same architecture, and leading tech companies have shown interest in the potential of quantum machine learning for future technological implementations. In 2013, Google Research, NASA, and the Universities Space Research Association launched the Quantum Artificial Intelligence Lab which explores the use of the adiabatic D-Wave quantum computer.^{ [79] }^{ [80] } A more recent example trained a probabilistic generative models with arbitrary pairwise connectivity, showing that their model is capable of generating handwritten digits as well as reconstructing noisy images of bars and stripes and handwritten digits.^{ [54] }

Using a different annealing technology based on nuclear magnetic resonance (NMR), a quantum Hopfield network was implemented in 2009 that mapped the input data and memorized data to Hamiltonians, allowing the use of adiabatic quantum computation.^{ [81] } NMR technology also enables universal quantum computing,^{[ citation needed ]} and it was used for the first experimental implementation of a quantum support vector machine to distinguish hand written number ‘6’ and ‘9’ on a liquid-state quantum computer in 2015.^{ [82] } The training data involved the pre-processing of the image which maps them to normalized 2-dimensional vectors to represent the images as the states of a qubit. The two entries of the vector are the vertical and horizontal ratio of the pixel intensity of the image. Once the vectors are defined on the feature space, the quantum support vector machine was implemented to classify the unknown input vector. The readout avoids costly quantum tomography by reading out the final state in terms of direction (up/down) of the NMR signal.

Photonic implementations are attracting more attention,^{ [83] } not the least because they do not require extensive cooling. Simultaneous spoken digit and speaker recognition and chaotic time-series prediction were demonstrated at data rates beyond 1 gigabyte per second in 2013.^{ [84] } Using non-linear photonics to implement an all-optical linear classifier, a perceptron model was capable of learning the classification boundary iteratively from training data through a feedback rule.^{ [85] } A core building block in many learning algorithms is to calculate the distance between two vectors: this was first experimentally demonstrated for up to eight dimensions using entangled qubits in a photonic quantum computer in 2015.^{ [86] }

Recently, based on a neuromimetic approach, a novel ingredient has been added to the field of quantum machine learning, in the form of a so-called quantum memristor, a quantized model of the standard classical memristor.^{ [87] } This device can be constructed by means of a tunable resistor, weak measurements on the system, and a classical feed-forward mechanism. An implementation of a quantum memristor in superconducting circuits has been proposed,^{ [88] } and an experiment with quantum dots performed.^{ [89] } A quantum memristor would implement nonlinear interactions in the quantum dynamics which would aid the search for a fully functional quantum neural network.

Since 2016, IBM has launched an online cloud-based platform for quantum software developers, called the IBM Q Experience. This platform consists of several fully operational quantum processors accessible via the IBM Web API. In doing so, the company is encouraging software developers to pursue new algorithms through a development environment with quantum capabilities. New architectures are being explored on an experimental basis, up to 32 qbits, utilizing both trapped-ion and superconductive quantum computing methods.

In October 2019, it was noted that the introduction of Quantum Random Number Generators (QRNGs) to machine learning models including Neural Networks and Convolutional Neural Networks for random initial weight distribution and Random Forests for splitting processes had a profound effect on their ability when compared to the classical method of Pseudorandom Number Generators (PRNGs).^{ [90] }

While machine learning itself is now not only a research field but an economically significant and fast growing industry and quantum computing is a well established field of both theoretical and experimental research, quantum machine learning remains a purely theoretical field of studies. Attempts to experimentally demonstrate concepts of quantum machine learning remain insufficient.^{[ citation needed ]}

Many of the leading scientists that extensively publish in the field of quantum machine learning warn about the extensive hype around the topic and are very restrained if asked about its practical uses in the foreseeable future. Sophia Chen^{ [91] } collected some of the statements made by well known scientists in the field:

- "I think we haven't done our homework yet. This is an extremely new scientific field," - physicist Maria Schuld of Canada-based quantum computing startup Xanadu.
- "There is a lot more work that needs to be done before claiming quantum machine learning will actually work," - computer scientist Iordanis Kerenidis, the head of quantum algorithms at the Silicon Valley-based quantum computing startup QC Ware.
- "I have not seen a single piece of evidence that there exists a meaningful [machine learning] task for which it would make sense to use a quantum computer and not a classical computer," - physicist Ryan Sweke of the Free University of Berlin in Germany.

“Don't fall for the hype!” - Frank Zickert,^{ [92] } who is the author of probably the most practical book related to the subject beware that ”quantum computers are far away from advancing machine learning for their representation ability”, and even speaking about evaluation and optimization for any kind of useful task quantum supremacy is not yet achieved. Furthermore, nobody among the active researchers in the field make any forecasts about when it could possibly become practical.^{[ citation needed ]}

**Quantum computing** is the exploitation of collective properties of quantum states, such as superposition and entanglement, to perform computation. The devices that perform quantum computations are known as **quantum computers**. They are believed to be able to solve certain computational problems, such as integer factorization, substantially faster than classical computers. The study of quantum computing is a subfield of quantum information science. It is likely to expand in the next few years as the field shifts toward real-world use in pharmaceutical, data security and other applications.

In logic circuits, the **Toffoli gate**, invented by Tommaso Toffoli, is a universal reversible logic gate, which means that any classical reversible circuit can be constructed from Toffoli gates. It is also known as the "controlled-controlled-not" gate, which describes its action. It has 3-bit inputs and outputs; if the first two bits are both set to 1, it inverts the third bit, otherwise all bits stay the same.

In quantum computing, a **quantum algorithm** is an algorithm which runs on a realistic model of quantum computation, the most commonly used model being the quantum circuit model of computation. A classical algorithm is a finite sequence of instructions, or a step-by-step procedure for solving a problem, where each step or instruction can be performed on a classical computer. Similarly, a quantum algorithm is a step-by-step procedure, where each of the steps can be performed on a quantum computer. Although all classical algorithms can also be performed on a quantum computer, the term quantum algorithm is usually used for those algorithms which seem inherently quantum, or use some essential feature of quantum computation such as quantum superposition or quantum entanglement.

In quantum computing, the **Gottesman–Knill theorem** is a theoretical result by Daniel Gottesman and Emanuel Knill that states that stabilizer circuits, circuits that only consist of gates from the normalizer of the qubit Pauli group, also called Clifford group, can be perfectly simulated in polynomial time on a probabilistic classical computer. The Clifford group can be generated solely by using CNOT, Hadamard, and phase gate *S*; and therefore stabilizer circuits can be constructed using only these gates.

**Quantum annealing** (**QA**) is a metaheuristic for finding the global minimum of a given objective function over a given set of candidate solutions, by a process using quantum fluctuations. Quantum annealing is used mainly for problems where the search space is discrete with many local minima; such as finding the ground state of a spin glass or the traveling salesman problem. Quantum annealing was first proposed in 1988 by B. Apolloni, N. Cesa Bianchi and D. De Falco. It was formulated in its present form by T. Kadowaki and H. Nishimori (ja) in "Quantum annealing in the transverse Ising model" though a proposal in a different form had been made by A. B. Finnila, M. A. Gomez, C. Sebenik and J. D. Doll, in "Quantum annealing: A new method for minimizing multidimensional functions".

**D-Wave Systems Inc.** is a Canadian quantum computing company, based in Burnaby, British Columbia, Canada. D-Wave was the world's first company to sell computers to exploit quantum effects in their operation. D-Wave's early customers include Lockheed Martin, University of Southern California, Google/NASA and Los Alamos National Lab.

**Reservoir computing** is a framework for computation derived from recurrent neural network theory that maps input signals into higher dimensional computational spaces through the dynamics of a fixed, non-linear system called a reservoir. After the input signal is fed into the reservoir, which is treated as a "black box," a simple readout mechanism is trained to read the state of the reservoir and map it to the desired output. The first key benefit of this framework is that training is performed only at the readout stage, as the reservoir dynamics are fixed. The second is that the computational power of naturally available systems, both classical and quantum mechanical, can be utilized to reduce the effective computational cost.

The **one-way** or **measurement-based quantum computer** (**MBQC**) is a method of quantum computing that first prepares an entangled *resource state*, usually a cluster state or graph state, then performs single qubit measurements on it. It is "one-way" because the resource state is destroyed by the measurements.

**Adiabatic quantum computation** (**AQC**) is a form of quantum computing which relies on the adiabatic theorem to do calculations and is closely related to quantum annealing.

**Daniel Amihud Lidar** is the holder of the Viterbi Professorship of Engineering at the University of Southern California, where he is a Professor of Electrical Engineering, Chemistry, Physics & Astronomy. He is the Director and co-founder of the USC Center for Quantum Information Science & Technology (CQIST) as well as Scientific Director of the USC-Lockheed Martin Quantum Computing Center, notable for his research on control of quantum systems and quantum information processing.

**Quantum cryptography** is the science of exploiting quantum mechanical properties to perform cryptographic tasks. The best known example of quantum cryptography is quantum key distribution which offers an information-theoretically secure solution to the key exchange problem. The advantage of quantum cryptography lies in the fact that it allows the completion of various cryptographic tasks that are proven or conjectured to be impossible using only classical communication. For example, it is impossible to copy data encoded in a quantum state. If one attempts to read the encoded data, the quantum state will be changed due to wave function collapse. This could be used to detect eavesdropping in quantum key distribution. It's contrary combative used culture couldn't be a quantum.

**Quantum finance** is an interdisciplinary research field, applying theories and methods developed by quantum physicists and economists in order to solve problems in finance. It is a branch of econophysics.

**Edward Farhi** is a Principal Scientist at Google working on quantum computation. In 2018 he retired from his position as the Cecil and Ida Green Professor of Physics at the Massachusetts Institute of Technology. He was the Director of the Center for Theoretical Physics at MIT from 2004 until 2016. He made contributions to particle physics, general relativity and astroparticle physics before turning to his current interest, quantum computation. For a recent interview see here.

**Andrew MacGregor Childs** is an American computer scientist and physicist known for his work on quantum computing. He is currently a Professor in the Department of Computer Science and Institute for Advanced Computer Studies at the University of Maryland. He also co-directs the Joint Center for Quantum Information and Computer Science, a partnership between the University of Maryland and the National Institute of Standards and Technology.

**Boson sampling** constitutes a restricted model of non-universal quantum computation introduced by S. Aaronson and A. Arkhipov after the original work of L. Troyansky and N. Tishby, that explored possible usage of boson scattering to evaluate expectation values of permanents of matrices. The model consists of sampling from the probability distribution of identical bosons scattered by a linear interferometer. Although the problem is well defined for any bosonic particles, its photonic version is currently considered as the most promising platform for a scalable implementation of a boson sampling device, which makes it a non-universal approach to linear optical quantum computing. Moreover, while not universal, the boson sampling scheme is strongly believed to implement computing tasks, which are hard to implement with classical computers, by using far fewer physical resources than a full linear-optical quantum computing setup. This makes it an ideal candidate for demonstrating the power of quantum computation in the near term.

In quantum computing, **quantum supremacy** or **quantum advantage** is the goal of demonstrating that a programmable quantum device can solve a problem that no classical computer can solve in any feasible amount of time. Conceptually, quantum supremacy involves both the engineering task of building a powerful quantum computer and the computational-complexity-theoretic task of finding a problem that can be solved by that quantum computer and has a superpolynomial speedup over the best known or possible classical algorithm for that task. The term was coined by John Preskill in 2012, but the concept of a quantum computational advantage, specifically for simulating quantum systems, dates back to Yuri Manin's (1980) and Richard Feynman's (1981) proposals of quantum computing. Examples of proposals to demonstrate quantum supremacy include the boson sampling proposal of Aaronson and Arkhipov, D-Wave's specialized frustrated cluster loop problems, and sampling the output of random quantum circuits.

**Aram Wettroth Harrow** is an Associate Professor of Physics in the Massachusetts Institute of Technology's Center for Theoretical Physics.

**Continuous-variable quantum information** is the area of quantum information science that makes use of physical observables, like the strength of an electromagnetic field, whose numerical values belong to continuous intervals. One primary application is quantum computing. In a sense, continuous-variable quantum computation is "analog", while quantum computation using qubits is "digital." In more technical terms, the former makes use of Hilbert spaces that are infinite-dimensional, while the Hilbert spaces for systems comprising collections of qubits are finite-dimensional. One motivation for studying continuous-variable quantum computation is to understand what resources are necessary to make quantum computers more powerful than classical ones.

In quantum computing, a *qubit* is a unit of information analogous to a bit in classical computing, but it is affected by quantum mechanical properties such as superposition and entanglement which allow qubits to be in some ways more powerful than classical bits for some tasks. Qubits are used in quantum circuits and quantum algorithms composed of quantum logic gates to solve computational problems, where they are used for input/output and intermediate computations.

Applying classical methods of machine learning to the study of quantum systems is the focus of an emergent area of physics research. A basic example of this is quantum state tomography, where a quantum state is learned from measurement. Other examples include learning Hamiltonians, learning quantum phase transitions, and automatically generating new quantum experiments. Classical machine learning is effective at processing large amounts of experimental or calculated data in order to characterize an unknown quantum system, making its application useful in contexts including quantum information theory, quantum technologies development, and computational materials design. In this context, it can be used for example as a tool to interpolate pre-calculated interatomic potentials or directly solving the Schrödinger equation with a variational method.

- ↑ Schuld, Maria; Petruccione, Francesco (2018).
*Supervised Learning with Quantum Computers*. Quantum Science and Technology. doi:10.1007/978-3-319-96424-9. ISBN 978-3-319-96423-2. - 1 2 Schuld, Maria; Sinayskiy, Ilya; Petruccione, Francesco (2014). "An introduction to quantum machine learning".
*Contemporary Physics*.**56**(2): 172–185. arXiv: 1409.3097 . Bibcode:2015ConPh..56..172S. CiteSeerX 10.1.1.740.5622 . doi:10.1080/00107514.2014.964942. S2CID 119263556. - ↑ Wittek, Peter (2014).
*Quantum Machine Learning: What Quantum Computing Means to Data Mining*. Academic Press. ISBN 978-0-12-800953-6. - ↑ Adcock, Jeremy; Allen, Euan; Day, Matthew; Frick, Stefan; Hinchliff, Janna; Johnson, Mack; Morley-Short, Sam; Pallister, Sam; Price, Alasdair; Stanisic, Stasja (2015). "Advances in quantum machine learning". arXiv: 1512.02900 [quant-ph].
- ↑ Biamonte, Jacob; Wittek, Peter; Pancotti, Nicola; Rebentrost, Patrick; Wiebe, Nathan; Lloyd, Seth (2017). "Quantum machine learning".
*Nature*.**549**(7671): 195–202. arXiv: 1611.09347 . Bibcode:2017Natur.549..195B. doi:10.1038/nature23474. PMID 28905917. S2CID 64536201. - ↑ Perdomo-Ortiz, Alejandro; Benedetti, Marcello; Realpe-Gómez, John; Biswas, Rupak (2018). "Opportunities and challenges for quantum-assisted machine learning in near-term quantum computers".
*Quantum Science and Technology*.**3**(3): 030502. arXiv: 1708.09757 . Bibcode:2018QS&T....3c0502P. doi:10.1088/2058-9565/aab859. S2CID 3963470. - ↑ Das Sarma, Sankar; Deng, Dong-Ling; Duan, Lu-Ming (2019-03-01). "Machine learning meets quantum physics".
*Physics Today*.**72**(3): 48–54. arXiv: 1903.03516 . Bibcode:2019PhT....72c..48D. doi:10.1063/PT.3.4164. ISSN 0031-9228. S2CID 86648124. - 1 2 Wiebe, Nathan; Kapoor, Ashish; Svore, Krysta (2014). "Quantum Algorithms for Nearest-Neighbor Methods for Supervised and Unsupervised Learning".
*Quantum Information & Computation*.**15**(3): 0318–0358. arXiv: 1401.2142 . Bibcode:2014arXiv1401.2142W. - ↑ Lloyd, Seth; Mohseni, Masoud; Rebentrost, Patrick (2013). "Quantum algorithms for supervised and unsupervised machine learning". arXiv: 1307.0411 [quant-ph].
- ↑ Yoo, Seokwon; Bang, Jeongho; Lee, Changhyoup; Lee, Jinhyoung (2014). "A quantum speedup in machine learning: Finding a N-bit Boolean function for a classification".
*New Journal of Physics*.**16**(10): 103014. arXiv: 1303.6055 . Bibcode:2014NJPh...16j3014Y. doi:10.1088/1367-2630/16/10/103014. S2CID 4956424. - ↑ Lee, Joong-Sung; Bang, Jeongho; Hong, Sunghyuk; Lee, Changhyoup; Seol, Kang Hee; Lee, Jinhyoung; Lee, Kwang-Geol (2019). "Experimental demonstration of quantum learning speedup with classical input data".
*Physical Review A*.**99**(1): 012313. arXiv: 1706.01561 . Bibcode:2019PhRvA..99a2313L. doi:10.1103/PhysRevA.99.012313. S2CID 53977163. - ↑ Schuld, Maria; Sinayskiy, Ilya; Petruccione, Francesco (2014-10-15). "An introduction to quantum machine learning".
*Contemporary Physics*.**56**(2): 172–185. arXiv: 1409.3097 . Bibcode:2015ConPh..56..172S. CiteSeerX 10.1.1.740.5622 . doi:10.1080/00107514.2014.964942. ISSN 0010-7514. S2CID 119263556. - ↑ Benedetti, Marcello; Realpe-Gómez, John; Biswas, Rupak; Perdomo-Ortiz, Alejandro (2017-11-30). "Quantum-Assisted Learning of Hardware-Embedded Probabilistic Graphical Models".
*Physical Review X*.**7**(4): 041052. arXiv: 1609.02542 . Bibcode:2017PhRvX...7d1052B. doi:10.1103/PhysRevX.7.041052. ISSN 2160-3308. S2CID 55331519. - ↑ Farhi, Edward; Neven, Hartmut (2018-02-16). "Classification with Quantum Neural Networks on Near Term Processors". arXiv: 1802.06002 [quant-ph].
- ↑ Schuld, Maria; Bocharov, Alex; Svore, Krysta; Wiebe, Nathan (2020). "Circuit-centric quantum classifiers".
*Physical Review A*.**101**(3): 032308. arXiv: 1804.00633 . Bibcode:2020PhRvA.101c2308S. doi:10.1103/PhysRevA.101.032308. S2CID 49577148. - ↑ Yu, Shang; Albarran-Arriagada, F.; Retamal, J. C.; Wang, Yi-Tao; Liu, Wei; Ke, Zhi-Jin; Meng, Yu; Li, Zhi-Peng; Tang, Jian-Shun (2018-08-28). "Reconstruction of a Photonic Qubit State with Quantum Reinforcement Learning".
*Advanced Quantum Technologies*.**2**(7–8): 1800074. arXiv: 1808.09241 . doi:10.1002/qute.201800074. S2CID 85529734. - ↑ Ghosh, Sanjib; Opala, A.; Matuszewski, M.; Paterek, T.; Liew, Timothy C. H. (2019). "Quantum reservoir processing".
*NPJ Quantum Information*.**5**(35): 35. arXiv: 1811.10335 . Bibcode:2019npjQI...5...35G. doi:10.1038/s41534-019-0149-8. S2CID 119197635. - ↑ Broecker, Peter; Assaad, Fakher F.; Trebst, Simon (2017-07-03). "Quantum phase recognition via unsupervised machine learning". arXiv: 1707.00663 [cond-mat.str-el].
- ↑ Huembeli, Patrick; Dauphin, Alexandre; Wittek, Peter (2018). "Identifying Quantum Phase Transitions with Adversarial Neural Networks".
*Physical Review B*.**97**(13): 134109. arXiv: 1710.08382 . Bibcode:2018PhRvB..97m4109H. doi:10.1103/PhysRevB.97.134109. ISSN 2469-9950. - 1 2 Krenn, Mario (2016-01-01). "Automated Search for new Quantum Experiments".
*Physical Review Letters*.**116**(9): 090405. arXiv: 1509.02749 . Bibcode:2016PhRvL.116i0405K. doi:10.1103/PhysRevLett.116.090405. PMID 26991161. S2CID 20182586. - ↑ Knott, Paul (2016-03-22). "A search algorithm for quantum state engineering and metrology".
*New Journal of Physics*.**18**(7): 073033. arXiv: 1511.05327 . Bibcode:2016NJPh...18g3033K. doi:10.1088/1367-2630/18/7/073033. S2CID 2721958. - ↑ Dunjko, Vedran; Briegel, Hans J (2018-06-19). "Machine learning & artificial intelligence in the quantum domain: a review of recent progress".
*Reports on Progress in Physics*.**81**(7): 074001. arXiv: 1709.02779 . Bibcode:2018RPPh...81g4001D. doi:10.1088/1361-6633/aab406. hdl: 1887/71084 . ISSN 0034-4885. PMID 29504942. S2CID 3681629. - ↑ Melnikov, Alexey A.; Nautrup, Hendrik Poulsen; Krenn, Mario; Dunjko, Vedran; Tiersch, Markus; Zeilinger, Anton; Briegel, Hans J. (1221). "Active learning machine learns to create new quantum experiments".
*Proceedings of the National Academy of Sciences*.**115**(6): 1221–1226. arXiv: 1706.00868 . doi:10.1073/pnas.1714936115. ISSN 0027-8424. PMC 5819408 . PMID 29348200. - ↑ Huggins, William; Patel, Piyush; Whaley, K. Birgitta; Stoudenmire, E. Miles (2018-03-30). "Towards Quantum Machine Learning with Tensor Networks".
*Quantum Science and Technology*.**4**(2): 024001. arXiv: 1803.11537 . doi:10.1088/2058-9565/aaea94. S2CID 4531946. - ↑ Carleo, Giuseppe; Nomura, Yusuke; Imada, Masatoshi (2018-02-26). "Constructing exact representations of quantum many-body systems with deep neural networks".
*Nature Communications*.**9**(1): 5322. arXiv: 1802.09558 . Bibcode:2018NatCo...9.5322C. doi:10.1038/s41467-018-07520-3. PMC 6294148 . PMID 30552316. - ↑ Bény, Cédric (2013-01-14). "Deep learning and the renormalization group". arXiv: 1301.3124 [quant-ph].
- ↑ Arunachalam, Srinivasan; de Wolf, Ronald (2017-01-24). "A Survey of Quantum Learning Theory". arXiv: 1701.06806 [quant-ph].
- ↑ Sergioli, Giuseppe; Giuntini, Roberto; Freytes, Hector (2019-05-09). "A new Quantum approach to binary classification".
*PLOS ONE*.**14**(5): e0216224. Bibcode:2019PLoSO..1416224S. doi: 10.1371/journal.pone.0216224 . PMC 6508868 . PMID 31071129. - ↑ Aïmeur, Esma; Brassard, Gilles; Gambs, Sébastien (2006-06-07).
*Machine Learning in a Quantum World*.*Advances in Artificial Intelligence*. Lecture Notes in Computer Science.**4013**. pp. 431–442. doi:10.1007/11766247_37. ISBN 978-3-540-34628-9. - 1 2 3 Dunjko, Vedran; Taylor, Jacob M.; Briegel, Hans J. (2016-09-20). "Quantum-Enhanced Machine Learning".
*Physical Review Letters*.**117**(13): 130501. arXiv: 1610.08251 . Bibcode:2016PhRvL.117m0501D. doi:10.1103/PhysRevLett.117.130501. PMID 27715099. S2CID 12698722. - 1 2 Rebentrost, Patrick; Mohseni, Masoud; Lloyd, Seth (2014). "Quantum Support Vector Machine for Big Data Classification".
*Physical Review Letters*.**113**(13): 130503. arXiv: 1307.0471 . Bibcode:2014PhRvL.113m0503R. doi:10.1103/PhysRevLett.113.130503. hdl:1721.1/90391. PMID 25302877. S2CID 5503025. - 1 2 Wiebe, Nathan; Braun, Daniel; Lloyd, Seth (2012). "Quantum Algorithm for Data Fitting".
*Physical Review Letters*.**109**(5): 050505. arXiv: 1204.5242 . Bibcode:2012PhRvL.109e0505W. doi:10.1103/PhysRevLett.109.050505. PMID 23006156. - 1 2 Schuld, Maria; Sinayskiy, Ilya; Petruccione, Francesco (2016). "Prediction by linear regression on a quantum computer".
*Physical Review A*.**94**(2): 022342. arXiv: 1601.07823 . Bibcode:2016PhRvA..94b2342S. doi:10.1103/PhysRevA.94.022342. S2CID 118459345. - 1 2 Zhao, Zhikuan; Fitzsimons, Jack K.; Fitzsimons, Joseph F. (2019). "Quantum assisted Gaussian process regression".
*Physical Review A*.**99**(5): 052331. arXiv: 1512.03929 . Bibcode:2019PhRvA..99e2331Z. doi:10.1103/PhysRevA.99.052331. S2CID 18303333. - ↑ Harrow, Aram W.; Hassidim, Avinatan; Lloyd, Seth (2008). "Quantum algorithm for solving linear systems of equations".
*Physical Review Letters*.**103**(15): 150502. arXiv: 0811.3171 . Bibcode:2009PhRvL.103o0502H. doi:10.1103/PhysRevLett.103.150502. PMID 19905613. S2CID 5187993. - ↑ Berry, Dominic W.; Childs, Andrew M.; Kothari, Robin (2015).
*Hamiltonian simulation with nearly optimal dependence on all parameters*. 56th Annual Symposium on Foundations of Computer Science. IEEE. pp. 792–809. arXiv: 1501.01715 . doi:10.1109/FOCS.2015.54. - ↑ Lloyd, Seth; Mohseni, Masoud; Rebentrost, Patrick (2014). "Quantum principal component analysis".
*Nature Physics*.**10**(9): 631. arXiv: 1307.0401 . Bibcode:2014NatPh..10..631L. CiteSeerX 10.1.1.746.480 . doi:10.1038/nphys3029. S2CID 11553314. - ↑ Soklakov, Andrei N.; Schack, Rüdiger (2006). "Efficient state preparation for a register of quantum bits".
*Physical Review A*.**73**(1): 012307. arXiv: quant-ph/0408045 . Bibcode:2006PhRvA..73a2307S. doi:10.1103/PhysRevA.73.012307. - ↑ Giovannetti, Vittorio; Lloyd, Seth; MacCone, Lorenzo (2008). "Quantum Random Access Memory".
*Physical Review Letters*.**100**(16): 160501. arXiv: 0708.1879 . Bibcode:2008PhRvL.100p0501G. doi:10.1103/PhysRevLett.100.160501. PMID 18518173. S2CID 570390. - ↑ Aaronson, Scott (2015). "Read the fine print".
*Nature Physics*.**11**(4): 291–293. Bibcode:2015NatPh..11..291A. doi:10.1038/nphys3272. - ↑ Bang, Jeongho; Dutta, Arijit; Lee, Seung-Woo; Kim, Jaewan (2019). "Optimal usage of quantum random access memory in quantum machine learning".
*Physical Review A*.**99**(1): 012326. arXiv: 1809.04814 . Bibcode:2019PhRvA..99a2326B. doi:10.1103/PhysRevA.99.012326. S2CID 62841090. - 1 2 Aïmeur, Esma; Brassard, Gilles; Gambs, Sébastien (2013-02-01). "Quantum speed-up for unsupervised learning".
*Machine Learning*.**90**(2): 261–287. doi: 10.1007/s10994-012-5316-5 . ISSN 0885-6125. - ↑ Wiebe, Nathan; Kapoor, Ashish; Svore, Krysta M. (2016).
*Quantum Perceptron Models*. Advances in Neural Information Processing Systems.**29**. pp. 3999–4007. arXiv: 1602.04799 . Bibcode:2016arXiv160204799W. - ↑ Paparo, Giuseppe Davide; Martin-Delgado, Miguel Angel (2012). "Google in a Quantum Network".
*Scientific Reports*.**2**(444): 444. arXiv: 1112.2079 . Bibcode:2012NatSR...2E.444P. doi:10.1038/srep00444. PMC 3370332 . PMID 22685626. - 1 2 3 Paparo, Giuseppe Davide; Dunjko, Vedran; Makmal, Adi; Martin-Delgado, Miguel Angel; Briegel, Hans J. (2014). "Quantum Speedup for Active Learning Agents".
*Physical Review X*.**4**(3): 031002. arXiv: 1401.4997 . Bibcode:2014PhRvX...4c1002P. doi:10.1103/PhysRevX.4.031002. S2CID 54652978. - ↑ Dong, Daoyi; Chen, Chunlin; Li, Hanxiong; Tarn, Tzyh-Jong (2008). "Quantum Reinforcement Learning".
*IEEE Transactions on Systems, Man, and Cybernetics – Part B: Cybernetics*.**38**(5): 1207–1220. arXiv: 0810.3828 . CiteSeerX 10.1.1.243.5369 . doi:10.1109/TSMCB.2008.925743. PMID 18784007. - ↑ Crawford, Daniel; Levit, Anna; Ghadermarzy, Navid; Oberoi, Jaspreet S.; Ronagh, Pooya (2018). "Reinforcement Learning Using Quantum Boltzmann Machines". arXiv: 1612.05695 [quant-ph].
- ↑ Briegel, Hans J.; Cuevas, Gemma De las (2012-05-15). "Projective simulation for artificial intelligence".
*Scientific Reports*.**2**(400): 400. arXiv: 1104.3787 . Bibcode:2012NatSR...2E.400B. doi:10.1038/srep00400. ISSN 2045-2322. PMC 3351754 . PMID 22590690. - ↑ Lamata, Lucas (2017). "Basic protocols in quantum reinforcement learning with superconducting circuits".
*Scientific Reports*.**7**(1): 1609. arXiv: 1701.05131 . Bibcode:2017NatSR...7.1609L. doi:10.1038/s41598-017-01711-6. PMC 5431677 . PMID 28487535. - ↑ Dunjko, V.; Friis, N.; Briegel, H. J. (2015-01-01). "Quantum-enhanced deliberation of learning agents using trapped ions".
*New Journal of Physics*.**17**(2): 023006. arXiv: 1407.2830 . Bibcode:2015NJPh...17b3006D. doi:10.1088/1367-2630/17/2/023006. ISSN 1367-2630. S2CID 119292539. - ↑ Sriarunothai, Th.; Wölk, S.; Giri, G. S.; Friis, N.; Dunjko, V.; Briegel, H. J.; Wunderlich, Ch. (2019). "Speeding-up the decision making of a learning agent using an ion trap quantum processor".
*Quantum Science and Technology*.**4**(1): 015014. arXiv: 1709.01366 . Bibcode:2019QS&T....4a5014S. doi:10.1088/2058-9565/aaef5e. ISSN 2058-9565. S2CID 2429346. - ↑ Biswas, Rupak; Jiang, Zhang; Kechezi, Kostya; Knysh, Sergey; Mandrà, Salvatore; O’Gorman, Bryan; Perdomo-Ortiz, Alejando; Pethukov, Andre; Realpe-Gómez, John; Rieffel, Eleanor; Venturelli, Davide; Vasko, Fedir; Wang, Zhihui (2016). "A NASA perspective on quantum computing: Opportunities and challenges".
*Parallel Computing*.**64**: 81–98. arXiv: 1704.04836 . doi:10.1016/j.parco.2016.11.002. S2CID 27547901. - 1 2 Adachi, Steven H.; Henderson, Maxwell P. (2015). "Application of quantum annealing to training of deep neural networks". arXiv: 1510.06356 [quant-ph].
- 1 2 3 4 Benedetti, Marcello; Realpe-Gómez, John; Biswas, Rupak; Perdomo-Ortiz, Alejandro (2017). "Quantum-assisted learning of graphical models with arbitrary pairwise connectivity".
*Physical Review X*.**7**(4): 041052. arXiv: 1609.02542 . Bibcode:2017PhRvX...7d1052B. doi:10.1103/PhysRevX.7.041052. S2CID 55331519. - 1 2 Benedetti, Marcello; Realpe-Gómez, John; Biswas, Rupak; Perdomo-Ortiz, Alejandro (2016). "Estimation of effective temperatures in quantum annealers for sampling applications: A case study with possible applications in deep learning".
*Physical Review A*.**94**(2): 022308. arXiv: 1510.07611 . Bibcode:2016PhRvA..94b2308B. doi:10.1103/PhysRevA.94.022308. S2CID 118602077. - 1 2 Korenkevych, Dmytro; Xue, Yanbo; Bian, Zhengbing; Chudak, Fabian; Macready, William G.; Rolfe, Jason; Andriyash, Evgeny (2016). "Benchmarking quantum hardware for training of fully visible Boltzmann machines". arXiv: 1611.04528 [quant-ph].
- ↑ Khoshaman, Amir; Vinci, Walter; Denis, Brandon; Andriyash, Evgeny; Amin, Mohammad H (2019). "Quantum variational autoencoder".
*Quantum Science and Technology*.**4**(1): 014001. arXiv: 1802.05779 . Bibcode:2019QS&T....4a4001K. doi:10.1088/2058-9565/aada1f. ISSN 2058-9565. S2CID 3376805. - ↑ Ajagekar, Akshay; You, Fengqi (2020-12-05). "Quantum computing assisted deep learning for fault detection and diagnosis in industrial process systems".
*Computers & Chemical Engineering*.**143**: 107119. arXiv: 2003.00264 . doi:10.1016/j.compchemeng.2020.107119. ISSN 0098-1354. S2CID 211678230. - ↑ Amin, Mohammad H.; Andriyash, Evgeny; Rolfe, Jason; Kulchytskyy, Bohdan; Melko, Roger (2018). "Quantum Boltzmann machines".
*Phys. Rev. X*.**8**(21050): 021050. arXiv: 1601.02036 . Bibcode:2018PhRvX...8b1050A. doi:10.1103/PhysRevX.8.021050. S2CID 119198869. - ↑ "Phys. Rev. E 72, 026701 (2005): Quantum annealing in a kinetically co…".
*archive.is*. 2014-01-13. Retrieved 2018-12-07. - ↑ Wiebe, Nathan; Kapoor, Ashish; Svore, Krysta M. (2014). "Quantum deep learning". arXiv: 1412.3489 [quant-ph].
- ↑ Wittek, Peter; Gogolin, Christian (2017). "Quantum Enhanced Inference in Markov Logic Networks".
*Scientific Reports*.**7**(45672): 45672. arXiv: 1611.08104 . Bibcode:2017NatSR...745672W. doi:10.1038/srep45672. PMC 5395824 . PMID 28422093. - 1 2 3 4 Gupta, Sanjay; Zia, R.K.P. (2001-11-01). "Quantum Neural Networks".
*Journal of Computer and System Sciences*.**63**(3): 355–383. arXiv: quant-ph/0201144 . doi:10.1006/jcss.2001.1769. ISSN 0022-0000. S2CID 206569020. - 1 2 Ezhov, Alexandr A.; Ventura, Dan (2000), "Quantum Neural Networks",
*Future Directions for Intelligent Systems and Information Sciences*, Physica-Verlag HD, pp. 213–235, CiteSeerX 10.1.1.683.5972 , doi:10.1007/978-3-7908-1856-7_11, ISBN 978-3-7908-2470-4 - 1 2 Behrman, E.C.; Nash, L.R.; Steck, J.E.; Chandrashekar, V.G.; Skinner, S.R. (2000-10-01). "Simulations of quantum neural networks".
*Information Sciences*.**128**(3–4): 257–269. doi:10.1016/S0020-0255(00)00056-6. ISSN 0020-0255. - ↑ Clark, Lewis A.; Huang W., Wei; Barlow, Thomas H.; Beige, Almut (2015). "Hidden Quantum Markov Models and Open Quantum Systems with Instantaneous Feedback". In Sanayei, Ali; Rössler, Otto E.; Zelinka, Ivan (eds.).
*ISCS 2014: Interdisciplinary Symposium on Complex Systems. Emergence, Complexity and Computation*.*Iscs, P. 143, Springer (2015)*. Emergence, Complexity and Computation.**14**. pp. 131–151. arXiv: 1406.5847 . CiteSeerX 10.1.1.749.3332 . doi:10.1007/978-3-319-10759-2_16. ISBN 978-3-319-10759-2. S2CID 119226526. - 1 2 3 Srinivasan, Siddarth; Gordon, Geoff; Boots, Byron (2018). "Learning Hidden Quantum Markov Models" (PDF).
*Aistats*. - ↑ Sentís, Gael; Guţă, Mădălin; Adesso, Gerardo (9 July 2015). "Quantum learning of coherent states".
*EPJ Quantum Technology*.**2**(1). doi: 10.1140/epjqt/s40507-015-0030-4 . - ↑ Sasaki, Masahide; Carlini, Alberto (6 August 2002). "Quantum learning and universal quantum matching machine".
*Physical Review A*.**66**(2): 022303. arXiv: quant-ph/0202173 . Bibcode:2002PhRvA..66b2303S. doi:10.1103/PhysRevA.66.022303. S2CID 119383508. - ↑ Bisio, Alessandro; Chiribella, Giulio; D’Ariano, Giacomo Mauro; Facchini, Stefano; Perinotti, Paolo (25 March 2010). "Optimal quantum learning of a unitary transformation".
*Physical Review A*.**81**(3): 032324. arXiv: 0903.0543 . Bibcode:2010PhRvA..81c2324B. doi:10.1103/PhysRevA.81.032324. S2CID 119289138. - ↑ Aïmeur, Esma; Brassard, Gilles; Gambs, Sébastien (1 January 2007).
*Quantum Clustering Algorithms*.*Proceedings of the 24th International Conference on Machine Learning*. pp. 1–8. CiteSeerX 10.1.1.80.9513 . doi:10.1145/1273496.1273497. ISBN 978-1-59593-793-3. S2CID 4357684. - ↑ Cory, D. G.; Wiebe, Nathan; Ferrie, Christopher; Granade, Christopher E. (2012-07-06). "Robust Online Hamiltonian Learning".
*New Journal of Physics*.**14**(10): 103013. arXiv: 1207.1655 . Bibcode:2012NJPh...14j3013G. doi:10.1088/1367-2630/14/10/103013. S2CID 9928389. - ↑ Arunachalam, Srinivasan; de Wolf, Ronald (2017). "A Survey of Quantum Learning Theory". arXiv: 1701.06806 [quant-ph].
- 1 2 3 Servedio, Rocco A.; Gortler, Steven J. (2004). "Equivalences and Separations Between Quantum and Classical Learnability".
*SIAM Journal on Computing*.**33**(5): 1067–1092. CiteSeerX 10.1.1.69.6555 . doi:10.1137/S0097539704412910. - ↑ Arunachalam, Srinivasan; de Wolf, Ronald (2016). "Optimal Quantum Sample Complexity of Learning Algorithms". arXiv: 1607.00932 [quant-ph].
- ↑ Nader, Bshouty H.; Jeffrey, Jackson C. (1999). "Learning DNF over the Uniform Distribution Using a Quantum Example Oracle".
*SIAM Journal on Computing*.**28**(3): 1136–1153. CiteSeerX 10.1.1.23.5709 . doi:10.1137/S0097539795293123. - ↑ Monràs, Alex; Sentís, Gael; Wittek, Peter (2017). "Inductive supervised quantum learning".
*Physical Review Letters*.**118**(19): 190503. arXiv: 1605.07541 . Bibcode:2017PhRvL.118s0503M. doi:10.1103/PhysRevLett.118.190503. PMID 28548536. - ↑ "NIPS 2009 Demonstration: Binary Classification using Hardware Implementation of Quantum Annealing" (PDF). Static.googleusercontent.com. Retrieved 26 November 2014.
- ↑ "Google Quantum A.I. Lab Team".
*Google Plus*. 31 January 2017. Retrieved 31 January 2017. - ↑ "NASA Quantum Artificial Intelligence Laboratory".
*NASA*. NASA. 31 January 2017. Archived from the original on 1 February 2017. Retrieved 31 January 2017. - ↑ Neigovzen, Rodion; Neves, Jorge L.; Sollacher, Rudolf; Glaser, Steffen J. (2009). "Quantum pattern recognition with liquid-state nuclear magnetic resonance".
*Physical Review A*.**79**(4): 042321. arXiv: 0802.1592 . Bibcode:2009PhRvA..79d2321N. doi:10.1103/PhysRevA.79.042321. S2CID 119115625. - ↑ Li, Zhaokai; Liu, Xiaomei; Xu, Nanyang; Du, Jiangfeng (2015). "Experimental Realization of a Quantum Support Vector Machine".
*Physical Review Letters*.**114**(14): 140504. arXiv: 1410.1054 . Bibcode:2015PhRvL.114n0504L. doi:10.1103/PhysRevLett.114.140504. PMID 25910101. - ↑ Wan, Kwok-Ho; Dahlsten, Oscar; Kristjansson, Hler; Gardner, Robert; Kim, Myungshik (2017). "Quantum generalisation of feedforward neural networks".
*NPJ Quantum Information*.**3**(36): 36. arXiv: 1612.01045 . Bibcode:2017npjQI...3...36W. doi:10.1038/s41534-017-0032-4. S2CID 51685660. - ↑ Brunner, Daniel; Soriano, Miguel C.; Mirasso, Claudio R.; Fischer, Ingo (2013). "Parallel photonic information processing at gigabyte per second data rates using transient states".
*Nature Communications*.**4**: 1364. Bibcode:2013NatCo...4.1364B. doi:10.1038/ncomms2368. PMC 3562454 . PMID 23322052. - ↑ Tezak, Nikolas; Mabuchi, Hideo (2015). "A coherent perceptron for all-optical learning".
*EPJ Quantum Technology*.**2**. arXiv: 1501.01608 . Bibcode:2015arXiv150101608T. doi:10.1140/epjqt/s40507-015-0023-3. S2CID 28568346. - ↑ Cai, X.-D.; Wu, D.; Su, Z.-E.; Chen, M.-C.; Wang, X.-L.; Li, Li; Liu, N.-L.; Lu, C.-Y.; Pan, J.-W. (2015). "Entanglement-Based Machine Learning on a Quantum Computer".
*Physical Review Letters*.**114**(11): 110504. arXiv: 1409.7770 . Bibcode:2015PhRvL.114k0504C. doi:10.1103/PhysRevLett.114.110504. PMID 25839250. S2CID 44769024. - ↑ Pfeiffer, P.; Egusquiza, I. L.; Di Ventra, M.; Sanz, M.; Solano, E. (2016). "Quantum memristors".
*Scientific Reports*.**6**(2016): 29507. arXiv: 1511.02192 . Bibcode:2016NatSR...629507P. doi:10.1038/srep29507. PMC 4933948 . PMID 27381511. - ↑ Salmilehto, J.; Deppe, F.; Di Ventra, M.; Sanz, M.; Solano, E. (2017). "Quantum Memristors with Superconducting Circuits".
*Scientific Reports*.**7**(42044): 42044. arXiv: 1603.04487 . Bibcode:2017NatSR...742044S. doi:10.1038/srep42044. PMC 5307327 . PMID 28195193. - ↑ Li, Ying; Holloway, Gregory W.; Benjamin, Simon C.; Briggs, G. Andrew D.; Baugh, Jonathan; Mol, Jan A. (2017). "A simple and robust quantum memristor".
*Physical Review B*.**96**(7): 075446. arXiv: 1612.08409 . Bibcode:2017PhRvB..96g5446L. doi:10.1103/PhysRevB.96.075446. S2CID 119454549. - ↑ Bird, Jordan J.; Ekárt, Anikó; Faria, Diego R. (2019-10-28). "On the effects of pseudorandom and quantum-random number generators in soft computing".
*Soft Computing*. Springer Science and Business Media LLC.**24**(12): 9243–9256. doi: 10.1007/s00500-019-04450-0 . ISSN 1432-7643. - ↑ "Can quantum machine learning move beyond its own hype?".
*Protocol*. 2020-05-04. Retrieved 2020-10-27. - ↑ Zickert, Frank (2020-09-23). "Quantum Machine Learning".
*Medium*. Retrieved 2020-10-27.

This page is based on this Wikipedia article

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.