Quantum computations: algorithms and error correction
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1796837
- Quantum error correction and fault-tolerant quantum computing
- scientific article; zbMATH DE number 1839431
- Quantum Algorithms
- Quantum algorithms
- Quantum Computers
- scientific article; zbMATH DE number 2134903
- Quantum Computation
- Quantum Computation
- scientific article; zbMATH DE number 2036019
Cited in
(only showing first 100 items - show all)- 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
- Anyons in geometric models of matter
- 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
- Geometric Rényi divergence and its applications in quantum channel capacities
- Operator complexity: a journey to the edge of Krylov space
- Energy levels estimation on a quantum computer by evolution of a physical quantity
- Quantum walks: Schur functions meet symmetry protected topological phases
- Classical simulation of quantum circuits by half Gauss sums
- Error correction of the continuous-variable quantum hybrid computation on two-node cluster states: limit of squeezing
- Amortized channel divergence for asymptotic quantum channel discrimination
- Solovay-Kitaev approximations of special orthogonal matrices
- Error scaling in fault tolerant quantum computation
- Analytic methods in quantum computing
- Multiplicativity of completely bounded \(p\)-norms implies a strong converse for entanglement-assisted capacity
- Vulnerability of cryptographic primitives based on the power conjugacy search problem in quantum computing
- Quantum computing with octonions
- Quantum information in the Posner model of quantum cognition
- Quantum computing: survey and analysis
- Quantum error-detection at low energies
- Structural stability of the quantum Fourier transform
- Rank-one quantum games
- Polynomial time quantum computation with advice
- The quantum query complexity of the hidden subgroup problem is polynomial
- Cost-efficient design of a quantum multiplier-accumulator unit
- Minimal and maximal operator spaces and operator systems in entanglement theory
- Information complexity of quantum gates
- Quantum commitments from complexity assumptions
- Learning bounds for quantum circuits in the agnostic setting
- Partial orbits of quantum gates and full three-particle entanglement
- Large k topological quantum computer
- The Heisenberg representation of quantum computers
- On a measure of distance for quantum strategies
- Efficient algorithms for the basis of finite abelian groups
- A new universal and fault-tolerant quantum basis
- Conditions for optimal input states for discrimination of quantum channels
- Upper bounds on fault tolerance thresholds of noisy Clifford-based quantum computers
- scientific article; zbMATH DE number 6712184 (Why is no real title available?)
- An Algorithm for Computing a Basis of a Finite Abelian Group
- Quantum algorithms for algebraic problems
- Decoherence, einselection, and the quantum origins of the classical
- Information and computation: Classical and quantum aspects
- scientific article; zbMATH DE number 5863326 (Why is no real title available?)
- Quantum computing and hidden variables
- Scalability of Shor’s algorithm with a limited set of rotation gates
- Effective fault-tolerant quantum computation with slow measurements
- Fundamental limits on quantum dynamics based on entropy change
- Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm
- Topological and symmetry broken phases of Z_N parafermions in one dimension
- Randomized benchmarking with confidence
- Operational distance and fidelity for quantum channels
- Measurement-Based and Universal Blind Quantum Computation
- The Toffoli-Hadamard gate system: an algebraic approach
- Reliable quantum computers
- Theory of Quantum Error Correction for General Noise
- scientific article; zbMATH DE number 1796837 (Why is no real title available?)
- Quantum stopwatch: how to store time in a quantum memory
- Quantum simulation from the bottom up: the case of rebits
- Almost all quantum channels are equidistant
- Amortized entanglement of a quantum channel and approximately teleportation-simulable channels
- Generalized quantum Arthur-Merlin games
- Topological quantum computation
- Random walks in Euclidean space
- Efficient discrete approximations of quantum gates
- Topological quantum memory
- Radon–Nikodym derivatives of quantum operations
- Quantum vs. classical proofs and subset verification
- 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
- Directed quantum communication
- Decoupling with unitary approximate two-designs
- Self-correcting quantum computers
- Symmetry-protected adiabatic quantum transistors
- Estimating the coherence of noise
- Krotov method for optimal control of closed quantum systems
- 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
- De Finetti reductions for correlations
- Ancilla dimension in quantum channel discrimination
- MONODROMY APPROACH TO QUANTUM COMPUTING
- Product formulas for exponentials of commutators
- THE PHYSICS OF QUANTUM INFORMATION: COMPLEMENTARITY, UNCERTAINTY, AND ENTANGLEMENT
- Base norms and discrimination of generalized quantum channels
- Quantum computing, postselection, and probabilistic polynomial-time
- ALGORITHMIC COMPLEXITY OF QUANTUM STATES
- QUANTUM SOFTWARE REUSABILITY
- ANALYSIS OF QUANTUM FUNCTIONS
- QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES
- Probability in quantum computation and quantum computational logics: a survey
- Bounding quantum gate error rate based on reported average fidelity
This page was built for publication: Quantum computations: algorithms and error correction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4232019)
