Quantum Computation and Quantum Information
By Yazhen Wang. 2012
23,692 citations recorded by the source corpus.
Quantum computation and quantum information are of great current interest in computer science, mathematics, physical sciences and engineering. They will likely lead to a new wave of technological innovations in communication, computation and cryptography. As the theory of quantum physics is fundamentally stochastic, randomness and uncertainty are deeply rooted in quantum computation, quantum simulation and quantum information. Consequently quantum algorithms are random in nature, and quantum simulation utilizes Monte Carlo techniques extensively. Thus statistics can play an important role in quantum computation and quantum simulation, which in turn offer great potential to revolutionize computational statistics. While only pseudo-random numbers can be generated by classical computers, quantum computers are able to produce genuine random numbers; quantum computers can exponentially or quadratically speed up median evaluation, Monte Carlo integration and Markov chain simulation. This paper gives a brief review on quantum computation, quantum simulation and quantum information. We introduce the basic concepts of quantum computation and quantum simulation and present quantum algorithms that are known to be much faster than the available classic algorithms. We provide a statistical framework for the analysis of quantum algorithms and quantum simulation.
Subfields: Artificial Intelligence, Atomic and Molecular Physics, and Optics, Computational Theory and Mathematics
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
- Göran Wendin
- Franco Nori
- Patrick J. Coles
- M. Cerezo
- Dacheng Tao
- Maria Schuld
- Yoshua Bengio
- Lukasz Cincio
In Atomic and Molecular Physics, and Optics
- Franco Nori
- A. Nahum
- Göran Wendin
- Brian Swingle
- V. Khemani
- D. Harlow
- Ashvin Vishwanath
- Steven M. Girvin
In Computational Theory and Mathematics
- Andrew M. Childs
- Salvador Elías Venegas-Andraca
- Craig Gidney
- Andris Ambainis
- Yuan Su
- Guang Hao Low
- Dominik Janzing
- Ashley Montanaro
Citations in the corpus
- Algorithmic independence of initial condition and dynamical law in thermodynamics and causal inference (2015, background): “From a theoretical and fundamental perspective, however, it is appealing to have a definition of entropy that neither relies on missing knowledge like the statistical Shannon/vonNeumann entropy [22, 23] nor on the separation between microscopic vs.”
- Causal Inference Using the Algorithmic Markov Condition (2008, background): “7Note, however, that sending quantum systems between the nodes could transmit a kind of information (“quantum information” [35]) that cannot be phrased in terms of bits.”
- SymPy: Symbolic computing in Python (2017, neutral): “• Quantum information and computing [26].”
- Continuous Variable Quantum Information: Gaussian States and Beyond (2014, background): “In quantum mechanics, two main types of measurement processes are usually considered [1].”
- Quantum generative adversarial networks (2018, background): “At this point it is convenient to introduce some canonical quantum gates [16].”
- Majorana zero modes and topological quantum computation (2015, background): “There were pretransistor electronic computers, and it may well be possible to build a pre-topological quantum computer through an extraordinary investment in error correction using ordinary non-topological qubits [122].”
- Constructing elliptic curve isogenies in quantum subexponential time (2010, background): “We assume some familiarity with quantum computation; for general background, see for example [22].”
- The Quantum Reverse Shannon Theorem Based on One-Shot Information Theory (2009, methodology): “Then we could use C QRST ≤ C E − δ together with the entanglement assisted classical capacity theorem to asymptotically simulate the perfect identity channel at a rate a contradiction to Holevo’s theorem [3, 46].”
- QuantumNAS: Noise-Adaptive Search for Robust Quantum Circuits (2021, neutral): “Quantum Basics Qubits – Unlike a conventional bit, a quantum bit (qubit [15], [50]) can be in a linear combination of the two basis states 0 and 1: |ψ〉 = α |0〉 + β |1〉 , for α, β ∈ C, satisfying |α|(2) + |β|(2) = 1.”
- On the experimental verification of quantum complexity in linear optics (2013, methodology): “A universal quantum computer, running for example Shor’s factoring algorithm [8], creates an exponentially large probability distribution with individual peaks at highly regular intervals that facilitate the solution to the factoring problem allowing efficient classical verification, as is the case ”
- Training deep quantum neural networks (2019, methodology): “However, new exciting possibilities are opening up due to the imminent advent of quantum computing devices that directly exploit the laws of quantum mechanics to evade the technological and thermodynamical limits of classical computation [5].”
- Quantum Fisher information of the Greenberger-Horne-Zeilinger state in decoherence channels (2011, background): “The decoherence channels have simple forms to deal with, and lead to theoretical predictions being often in good agreement with experiments [5,6].”
- Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning (2013, background): “The quantum circuit model, one of the prominent models of quantum computation [24], generalizes the classical circuit model to deal with quantum effects.”
- Lecture Notes on the Theory of Open Quantum Systems (2019, methodology): “If we do so then this clearly is a set of POVMs, since ∑kEk = I , and for suitable α, all the Ek’s are positive.”
- Goal-Directed Planning via Hindsight Experience Replay (2022, methodology): “We exploited average gate fidelity (AGF) (Nielsen, 2002) as a metric to evaluate the distance between the target gate U and the current sequence of gates U n .”
- Quantum−like nonseparable structures in optical beams (2014, background): “Traditionally, entanglement has been regarded either as a peculiar feature of quantum mechanics or, instead, as a powerful resource especially for quantum information science [3].”