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)- Decoherence, einselection, and the quantum origins of the classical
- Ancilla dimension in quantum channel discrimination
- Random walks in Euclidean space
- ANALYSIS OF QUANTUM FUNCTIONS
- An introduction to quantum computing, without the physics
- One complexity theorist's view of quantum computing
- Bounding quantum gate error rate based on reported average fidelity
- Information and computation: Classical and quantum aspects
- Directed quantum communication
- Randomized benchmarking with confidence
- An application of quantum finite automata to interactive proof systems
- Energy levels estimation on a quantum computer by evolution of a physical quantity
- The Toffoli-Hadamard gate system: an algebraic approach
- Quantum information in the Posner model of quantum cognition
- QUANTUM SOFTWARE REUSABILITY
- Learning bounds for quantum circuits in the agnostic setting
- Partial orbits of quantum gates and full three-particle entanglement
- Large k topological quantum computer
- Error scaling in fault tolerant quantum computation
- Quantum walks: Schur functions meet symmetry protected topological phases
- MONODROMY APPROACH TO QUANTUM COMPUTING
- Krotov method for optimal control of closed quantum systems
- Quantum simulation from the bottom up: the case of rebits
- Anyons in geometric models of matter
- Base norms and discrimination of generalized quantum channels
- Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
- On the universality and membership problems for quantum gates
- A quantum computing primer for operator theorists
- An Algorithm for Computing a Basis of a Finite Abelian Group
- Phase shift and multi-controlled \(Z\)-type gates
- Zero-knowledge proof systems for QMA
- Information complexity of quantum gates
- Structural stability of the quantum Fourier transform
- Reliable quantum computers
- Cost-efficient design of a quantum multiplier-accumulator unit
- Effective fault-tolerant quantum computation with slow measurements
- Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm
- scientific article; zbMATH DE number 6712184 (Why is no real title available?)
- Algorithms on ensemble quantum computers
- Wave Matrix Lindbladization II: General Lindbladians, Linear Combinations, and Polynomials
- Topological quantum computation
- Quantum process tomography with coherent states
- Quantum algorithms for algebraic problems
- Error analysis of quantum operators written as a linear combination of permutations
- 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 and quadratically signed weight enumerators
- Quantum computing: survey and analysis
- Quantum heat engine with long-range advantages
- Scalability of Shor’s algorithm with a limited set of rotation gates
- Fundamental limits on quantum dynamics based on entropy change
- Quantum commitments from complexity assumptions
- Polynomial time quantum computation with advice
- A new universal and fault-tolerant quantum basis
- Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines.
- Asymmetric quantum codes on non-orientable surfaces
- Quantum computing, postselection, and probabilistic polynomial-time
- Quantum codes, CFTs, and defects
- ALGORITHMIC COMPLEXITY OF QUANTUM STATES
- The quantum query complexity of the hidden subgroup problem is polynomial
- Classical simulation of quantum circuits by half Gauss sums
- Error-detection-based quantum fault-tolerance threshold
- scientific article; zbMATH DE number 5863326 (Why is no real title available?)
- Quantum error-detection at low energies
- On a measure of distance for quantum strategies
- Product formulas for exponentials of commutators
- Quantum vs. classical proofs and subset verification
- Universal topological quantum computing via double-braiding in SU(2) Witten-Chern-Simons theory
- Theory of Quantum Error Correction for General Noise
- Metric on the space of quantum processes
- Quantifying channel coherence via the norm distance
- Energy requirement for implementing unitary gates on energy-unbounded systems
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
- Quantum computing and hidden variables
- Self-correcting quantum computers
- Rank-one quantum games
- Topological quantum memory
- Quantum Wasserstein distance of order 1 between channels
- Operational distance and fidelity for quantum channels
- Topological quantum gates in homotopy type theory
- On measuring the topological charge of anyons
- Quantum stopwatch: how to store time in a quantum memory
- Geometric Rényi divergence and its applications in quantum channel capacities
- scientific article; zbMATH DE number 1796837 (Why is no real title available?)
- Topological and symmetry broken phases of \(Z_N\) parafermions in one dimension
- Global estimates of errors in quantum computation by the Feynman-Vernon formalism
- Error-correctable efficient quantum homomorphic encryption using Calderbank-Shor-Steane codes
- Universal quantum computation with metaplectic anyons
- Quantum Computers
- Radon–Nikodym derivatives of quantum operations
- Minimal and maximal operator spaces and operator systems in entanglement theory
- Almost all quantum channels are equidistant
- Solovay-Kitaev approximations of special orthogonal matrices
- Amortized entanglement of a quantum channel and approximately teleportation-simulable channels
- Volume thresholds for quantum fault tolerance
- Two-way finite automata with quantum and classical states.
- QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES
- Decoupling with unitary approximate two-designs
- Efficient algorithms for the basis of finite abelian groups
- De Finetti reductions for correlations
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)
