Quantum computations: algorithms and error correction

From MaRDI portal
Publication:4232019


DOI10.1070/RM1997v052n06ABEH002155zbMath0917.68063WikidataQ56428626 ScholiaQ56428626MaRDI QIDQ4232019

Alexei Yu. Kitaev

Publication date: 26 April 1999

Published in: Russian Mathematical Surveys (Search for Journal in Brave)


81P99: Foundations, quantum information and its processing, quantum axioms, and philosophy

94B60: Other types of codes


Related Items

Theory of Quantum Error Correction for General Noise, Topological quantum computation, Efficient discrete approximations of quantum gates, Topological quantum memory, Radon–Nikodym derivatives of quantum operations, MONODROMY APPROACH TO QUANTUM COMPUTING, Quantum computing, postselection, and probabilistic polynomial-time, ALGORITHMIC COMPLEXITY OF QUANTUM STATES, QUANTUM SOFTWARE REUSABILITY, ANALYSIS OF QUANTUM FUNCTIONS, QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES, Algorithms on ensemble quantum computers, Volume thresholds for quantum fault tolerance, Error-detection-based quantum fault-tolerance threshold, Representation-theoretical properties of the approximate quantum Fourier transform, End-to-end fault tolerance, An application of quantum finite automata to interactive proof systems, Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines., Quantum computing and quadratically signed weight enumerators, Computational complexity of uniform quantum circuit families and quantum Turing machines, A quantum computing primer for operator theorists, Two-way finite automata with quantum and classical states., Fault-tolerant quantum computation by anyons, Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory, One complexity theorist's view of quantum computing, Polynomial time quantum computation with advice, The quantum query complexity of the hidden subgroup problem is polynomial, Information complexity of quantum gates, Quantum algorithms for algebraic problems, Decoherence, einselection, and the quantum origins of the classical, Information and computation: Classical and quantum aspects, Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm, Operational distance and fidelity for quantum channels, Measurement-Based and Universal Blind Quantum Computation