Quantum computations: algorithms and error correction
From MaRDI portal
Publication:4232019
DOI10.1070/RM1997v052n06ABEH002155zbMath0917.68063OpenAlexW2159566537WikidataQ56428626 ScholiaQ56428626MaRDI QIDQ4232019
Publication date: 26 April 1999
Published in: Russian Mathematical Surveys (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1070/rm1997v052n06abeh002155
Foundations, quantum information and its processing, quantum axioms, and philosophy (81P99) Other types of codes (94B60)
Related Items
Topological quantum computation, Unnamed Item, Error-detection-based quantum fault-tolerance threshold, A new universal and fault-tolerant quantum basis, Error correction of the continuous-variable quantum hybrid computation on two-node cluster states: limit of squeezing, EFFICIENT ALGORITHMS FOR THE BASIS OF FINITE ABELIAN GROUPS, Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm, Polynomial time quantum computation with advice, The quantum query complexity of the hidden subgroup problem is polynomial, Quantum stopwatch: how to store time in a quantum memory, MONODROMY APPROACH TO QUANTUM COMPUTING, Quantum simulation from the bottom up: the case of rebits, Almost all quantum channels are equidistant, The Toffoli-Hadamard gate system: an algebraic approach, Efficient discrete approximations of quantum gates, Topological quantum memory, Radon–Nikodym derivatives of quantum operations, Volume thresholds for quantum fault tolerance, Cost-efficient design of a quantum multiplier-accumulator unit, Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines., Conditions for optimal input states for discrimination of quantum channels, Amortized channel divergence for asymptotic quantum channel discrimination, Learning bounds for quantum circuits in the agnostic setting, Partial orbits of quantum gates and full three-particle entanglement, Anyons in geometric models of matter, Large \(k\) topological quantum computer, Minimal and maximal operator spaces and operator systems in entanglement theory, Amortized entanglement of a quantum channel and approximately teleportation-simulable channels, Upper bounds on fault tolerance thresholds of noisy Clifford-based quantum computers, Classical Ising model test for quantum circuits, Quantum process tomography with coherent states, Integration of highly probabilistic sources into optical quantum architectures: perpetual quantum computation, Generalized toric codes coupled to thermal baths, An Introduction to Quantum Computing, without the Physics, QUANTUM SOFTWARE REUSABILITY, ANALYSIS OF QUANTUM FUNCTIONS, QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES, Directed quantum communication, Decoupling with unitary approximate two-designs, Self-correcting quantum computers, Random walks in Euclidean space, Symmetry-protected adiabatic quantum transistors, Estimating the coherence of noise, Generalized Quantum Arthur--Merlin Games, Representation-theoretical properties of the approximate quantum Fourier transform, Topological and symmetry broken phases ofZNparafermions in one dimension, Quantum vs Classical Proofs and Subset Verification, Product formulas for exponentials of commutators, An Algorithm for Computing a Basis of a Finite Abelian Group, Solovay-Kitaev approximations of special orthogonal matrices, Error scaling in fault tolerant quantum computation, THE PHYSICS OF QUANTUM INFORMATION: COMPLEMENTARITY, UNCERTAINTY, AND ENTANGLEMENT, Base norms and discrimination of generalized quantum channels, Ancilla dimension in quantum channel discrimination, Measurement-Based and Universal Blind Quantum Computation, Analytic methods in quantum computing, Multiplicativity of completely bounded \(p\)-norms implies a strong converse for entanglement-assisted capacity, Probability in quantum computation and quantum computational logics: a survey, Vulnerability of cryptographic primitives based on the power conjugacy search problem in quantum computing, Quantum computing, postselection, and probabilistic polynomial-time, A quantum computing primer for operator theorists, The quantum reverse Shannon theorem based on one-shot information theory, Global estimates of errors in quantum computation by the Feynman-Vernon formalism, Information complexity of quantum gates, Geometric Rényi divergence and its applications in quantum channel capacities, Quantum computing with octonions, End-to-end fault tolerance, Quantum algorithms for algebraic problems, Decoherence, einselection, and the quantum origins of the classical, Information and computation: Classical and quantum aspects, Operator complexity: a journey to the edge of Krylov space, An application of quantum finite automata to interactive proof systems, Krotov method for optimal control of closed quantum systems, Randomized benchmarking with confidence, Energy levels estimation on a quantum computer by evolution of a physical quantity, Quantum computing and hidden variables, Scalability of Shor’s algorithm with a limited set of rotation gates, Quantum walks: Schur functions meet symmetry protected topological phases, Quantum information in the Posner model of quantum cognition, Quantum computing: survey and analysis, Effective Fault-Tolerant Quantum Computation with Slow Measurements, ALGORITHMIC COMPLEXITY OF QUANTUM STATES, Universal quantum computation with metaplectic anyons, Two-sided bounds on minimum-error quantum measurement, on the reversibility of quantum dynamics, and on maximum overlap using directional iterates, Quantum error-detection at low energies, Theory of Quantum Error Correction for General Noise, de Finetti reductions for correlations, Two-way finite automata with quantum and classical states., On a measure of distance for quantum strategies, Fundamental limits on quantum dynamics based on entropy change, Operational distance and fidelity for quantum channels, Structural stability of the quantum Fourier transform, Quantum computing and quadratically signed weight enumerators, Computational complexity of uniform quantum circuit families and quantum Turing machines, Classical simulation of quantum circuits by half Gauss sums, Fault-tolerant quantum computation by anyons, Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory, Rank-one quantum games, One complexity theorist's view of quantum computing, Quantum commitments from complexity assumptions, On the universality and membership problems for quantum gates, Mathematical etudes on quantum computation, A practitioner’s guide to quantum algorithms for optimisation problems, Exact performance of the five-qubit code with coherent errors, Quantum Wasserstein distance of order 1 between channels, Phase shift and multi-controlled \(Z\)-type gates, Application of quantum approximate optimization algorithm to job shop scheduling problem, Wave Matrix Lindbladization I: Quantum Programs for Simulating Markovian Dynamics, Quantifying channel coherence via the norm distance, Quantum codes, CFTs, and defects, Logical qubit behavior model and fast simulation for surface code, Fidelity and Fisher information on quantum channels, Wave Matrix Lindbladization II: General Lindbladians, Linear Combinations, and Polynomials, Unnamed Item, Algorithms on ensemble quantum computers, Bounding quantum gate error rate based on reported average fidelity, A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY, Energy requirement for implementing unitary gates on energy-unbounded systems, Computable lower bounds on the entanglement cost of quantum channels
