Quantum computation and quantum information
From MaRDI portal
quantum algorithmquantum bit (qubit)quantum Fourier transformquantum informationquantum mechanicsquantum Monte Carloquantum probabilityquantum simulationquantum statistics
Statistical aspects of information-theoretic topics (62B10) Information theory (general) (94A15) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Research exposition (monographs, survey articles) pertaining to statistics (62-02) Research exposition (monographs, survey articles) pertaining to quantum theory (81-02) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 5320216 (Why is no real title available?)
- scientific article; zbMATH DE number 3721567 (Why is no real title available?)
- scientific article; zbMATH DE number 3783731 (Why is no real title available?)
- scientific article; zbMATH DE number 53766 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1313655 (Why is no real title available?)
- scientific article; zbMATH DE number 719741 (Why is no real title available?)
- scientific article; zbMATH DE number 1145843 (Why is no real title available?)
- scientific article; zbMATH DE number 1484345 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 2206373 (Why is no real title available?)
- scientific article; zbMATH DE number 3075634 (Why is no real title available?)
- scientific article; zbMATH DE number 3109251 (Why is no real title available?)
- A method for obtaining digital signatures and public-key cryptosystems
- A single quantum cannot be cloned
- Adiabatic quantum state generation and statistical zero knowledge
- An Invitation to Quantum Tomography
- Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
- Demonstration of Blind Quantum Computing
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Error Correcting Codes in Quantum Theory
- Exponential algorithmic speedup by a quantum walk
- Faster quantum-walk algorithm for the two-dimensional spatial search
- From Monte Carlo to quantum computation
- Minimax and adaptive estimation of the Wigner function in quantum homodyne tomography with noisy data
- Modern quantum mechanics
- Multiple-particle interference and quantum error correction
- On Quantum Statistical Inference
- On the Product of Semi-Groups of Operators
- On the relationship between continuous- and discrete-time quantum walk
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Proposed experiment to test local hidden-variable theories
- Quantum Gaussian processes
- Quantum Monte Carlo simulation
- Quantum computation
- Quantum information theory. An introduction.
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Robust Statistics
- Search via Quantum Walk
- Simulating quantum mechanics on a quantum computer.
- Simulating quantum systems on a quantum computer
- Simulation of topological field theories by quantum computers
- The Chernoff lower bound for symmetric quantum hypothesis testing
- The capacity of the quantum channel with general signal states
- The nature of singularities
- The quantum query complexity of approximating the median and related statistics
- Universal Quantum Simulators
Cited in
(19)- Quantum annealing with Markov chain Monte Carlo simulations and D-wave quantum computers
- An introduction to quantum computing for statisticians and data scientists
- Hypothesis tests for large density matrices of quantum systems based on Pauli measurements
- Principles and methods of quantum information technologies
- Alexander Semenovich Holevo: Quantum Information, Quantum Computation
- scientific article; zbMATH DE number 1512076 (Why is no real title available?)
- Optimal large-scale quantum state tomography with Pauli measurements
- Quantum Annealing via Path-Integral Monte Carlo With Data Augmentation
- Quantum Monte Carlo simulation
- Optimal sparse eigenspace and low-rank density matrix estimation for quantum systems
- Information and computation: Classical and quantum aspects
- Non-Markovian quantum Hadamard gate preparation in a hybrid bath: a Lyapunov approach
- Minimax estimation of low-rank quantum states and their linear functionals
- Quantum speedup of Monte Carlo methods
- Asymptotic equivalence of quantum state tomography and noisy matrix completion
- Quantum science and quantum technology
- Statistical Analysis of Quantum Annealing
- Quantum circuit compilation for nearest-neighbor architecture based on reinforcement learning
- Encoding optimum of a quantum key distribution model
This page was built for publication: Quantum computation and quantum information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q252779)
