Quantum computation and quantum information

DOI10.1214/11-STS378zbMath1331.81080arXiv1210.0736OpenAlexW3104374963MaRDI QIDQ252779

Yazhen Wang

Publication date: 4 March 2016

Published in: Statistical Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.0736

zbMATH Keywords

quantum mechanicsquantum algorithmquantum Monte Carloquantum informationquantum statisticsquantum probabilityquantum bit (qubit)quantum Fourier transformquantum simulation

Mathematics Subject Classification ID

Quantum computation (81P68) Research exposition (monographs, survey articles) pertaining to statistics (62-02) Research exposition (monographs, survey articles) pertaining to quantum theory (81-02) Information theory (general) (94A15) Statistical aspects of information-theoretic topics (62B10) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items

Hypothesis tests for large density matrices of quantum systems based on Pauli measurements ⋮ Optimal large-scale quantum state tomography with Pauli measurements ⋮ Optimal sparse eigenspace and low-rank density matrix estimation for quantum systems ⋮ Quantum Annealing via Path-Integral Monte Carlo With Data Augmentation ⋮ Statistical Analysis of Quantum Annealing ⋮ Non-Markovian quantum Hadamard gate preparation in a hybrid bath: a Lyapunov approach ⋮ Quantum circuit compilation for nearest-neighbor architecture based on reinforcement learning ⋮ Minimax estimation of low-rank quantum states and their linear functionals ⋮ Asymptotic equivalence of quantum state tomography and noisy matrix completion ⋮ Quantum science and quantum technology ⋮ Quantum annealing with Markov chain Monte Carlo simulations and D-wave quantum computers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the relationship between continuous- and discrete-time quantum walk
• Quantum Monte Carlo simulation
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Minimax and adaptive estimation of the Wigner function in quantum homodyne tomography with noisy data
• The Chernoff lower bound for symmetric quantum hypothesis testing
• The nature of singularities
• Quantum Gaussian processes
• Simulating quantum mechanics on a quantum computer.
• Simulation of topological field theories by quantum computers
• From Monte Carlo to quantum computation
• The quantum query complexity of approximating the median and related statistics
• Demonstration of Blind Quantum Computing
• Search via Quantum Walk
• Quantum Computation
• Universal Quantum Simulators
• Multiple-particle interference and quantum error correction
• On the Product of Semi-Groups of Operators
• Adiabatic quantum state generation and statistical zero knowledge
• Exponential algorithmic speedup by a quantum walk
• A method for obtaining digital signatures and public-key cryptosystems
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Simulating quantum systems on a quantum computer
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• The capacity of the quantum channel with general signal states
• Error Correcting Codes in Quantum Theory
• On Quantum Statistical Inference
• An Invitation to Quantum Tomography
• Faster quantum-walk algorithm for the two-dimensional spatial search
• Modern Quantum Mechanics
• A single quantum cannot be cloned
• Proposed Experiment to Test Local Hidden-Variable Theories
• Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
• Robust Statistics