An Introduction to Quantum Computing

By Gerard J. Milburn. Quantum information & computation, 2007

924 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/dc6a494f316a51cda807e4f0962279f6f1a70b4a

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

Citations in the corpus

Quantum Computational Complexity (2008, background): “In the subsequent sections of this article, the reader is assumed to have basic familiarity with both topics, which are covered in depth by several text books [14, 44, 61, 68, 84, 87].”
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits (2012, background): “It is a well known fact that the controlled version of any circuit can be generated by replacing each individual gate with a controlled version of that gate, with the control qubit of the entire circuit functioning as the control qubit of each gate [16].”
Simulating chemistry using quantum computers. (2010, methodology): “For example, the no-cloning theorem (94, 63) states that an unknown quantum state cannot be copied perfectly.”
Feasibility of satellite quantum key distribution (2009, background): “These research activities lead to new information-processing protocols with no classical counterpart, like quantum key distribution (QKD) [4]–[6], quantum teleportation [7] or quantum computing [8].”
Consequences and limits of nonlocal strategies (2004, background): “Quantum strategies and quantum values of nonlocal games We will assume for this discussion and throughout the rest of the paper that the reader is familiar with the basics of quantum information, which is discussed (for instance) in the books [43], [35], and [31].”
The Interface Theory of Perception (2009, positive): “Such entanglement is not just an abstract possibility, it is an empirical fact now being exploited in quantum computation to give substantial improvements over classical computation (Nielsen & Chuang 2000; Kaye et al. 2007 ).”
Quantum Principal Component Analysis (2015, neutral): “Consider a quantum operator (or an algorithm) A mapping an initial quantum state |0 into |ψ [15] [16] [17]: |ψ =A |0 = x α x |x |φ = x∈X good α x |x |φ + x∈X bad α x |x |φ .”