Quantum Computation and Quantum Information
arXiv:1210.0736 · doi:10.1214/11-STS378
Abstract
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.
Published in at http://dx.doi.org/10.1214/11-STS378 the Statistical Science (http://www.imstat.org/sts/) by the Institute of Mathematical Statistics (http://www.imstat.org)
References in corpus (27)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Mechanics helps in searching for a needle in a haystack
- Good Quantum Error-Correcting Codes Exist
- Simulated Quantum Computation of Molecular Energies
- Multiple Particle Interference and Quantum Error Correction
- Demonstration of Two-Qubit Algorithms with a Superconducting Quantum Processor
- A Quantum Random Walk Search Algorithm
- Exponential algorithmic speedup by quantum walk
- Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Real-time quantum feedback prepares and stabilizes photon number states
- Experimental Quantum Error Correction
- Experimental Demonstration of Blind Quantum Computing
- On the relationship between continuous- and discrete-time quantum walk
- Efficient Simulation of Quantum Systems by Quantum Computers
- Implementing the Quantum von Neumann Architecture with Superconducting Circuits
- Search via Quantum Walk
- Simulation of topological field theories by quantum computers
- Teleportation of Nonclassical Wave Packets of light
- The Chernoff lower bound for symmetric quantum hypothesis testing
- Faster quantum walk algorithm for the two dimensional spatial search
- Simulating quantum mechanics on a quantum computer
- Optimal simulation of two-qubit Hamiltonians using general local operations
- Quantum speedup of classical mixing processes
- The Stochastic Green Function (SGF) algorithm
- Minimax and adaptive estimation of the Wigner function in quantum homodyne tomography with noisy data
- Quantum Monte Carlo simulation