Theory of quantum computation

Abstract

Short review article on quantum computation accepted for Supplement III, Encyclopaedia of Mathematics (publication expected Summer 2001). See also http://www.wkap.nl/series.htm/ENM

5 pages

References in corpus (2)

• Quantum Lower Bounds by Polynomials
• Quantum vs. Classical Communication and Computation

Cited by in corpus (13)

• Can One Trust Quantum Simulators?
• Toward an architecture for quantum programming
• Qutrit Magic State Distillation
• Self-testing multipartite entangled states through projections onto two systems
• Self-testing protocols based on the chained Bell inequalities
• Quantum Simulation of Nuclear Inelastic Scattering
• Robust self-testing of two-qubit states
• Experimental demonstration of one-sided device-independent self-testing of any pure two-qubit entangled state
• Reliable Entanglement Verification
• Improved Bounds for Eigenpath Traversal
• Nonlocality as a Benchmark for Universal Quantum Computation in Ising Anyon Topological Quantum Computers
• Exponential improvement in precision for Hamiltonian-evolution simulation
• Adiabatic graph-state quantum computation