Pages that link to "Item:Q4232019"
From MaRDI portal
The following pages link to Quantum computations: algorithms and error correction (Q4232019):
Displaying 50 items.
- Quantum commitments from complexity assumptions (Q260394) (← links)
- A new universal and fault-tolerant quantum basis (Q294808) (← links)
- The Toffoli-Hadamard gate system: an algebraic approach (Q358697) (← links)
- Random walks in Euclidean space (Q482912) (← links)
- Ancilla dimension in quantum channel discrimination (Q529596) (← links)
- Volume thresholds for quantum fault tolerance (Q600894) (← links)
- The quantum reverse Shannon theorem based on one-shot information theory (Q717117) (← links)
- Global estimates of errors in quantum computation by the Feynman-Vernon formalism (Q723390) (← links)
- Error-detection-based quantum fault-tolerance threshold (Q835645) (← links)
- Representation-theoretical properties of the approximate quantum Fourier transform (Q937218) (← links)
- End-to-end fault tolerance (Q1007128) (← links)
- An application of quantum finite automata to interactive proof systems (Q1015813) (← links)
- Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines. (Q1390870) (← links)
- Quantum computing and quadratically signed weight enumerators (Q1603471) (← links)
- Computational complexity of uniform quantum circuit families and quantum Turing machines (Q1605308) (← links)
- Anyons in geometric models of matter (Q1696285) (← links)
- A quantum computing primer for operator theorists (Q1779259) (← links)
- Two-way finite automata with quantum and classical states. (Q1853472) (← links)
- Fault-tolerant quantum computation by anyons (Q1867218) (← links)
- Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory (Q1867221) (← links)
- One complexity theorist's view of quantum computing (Q1870556) (← links)
- Geometric Rényi divergence and its applications in quantum channel capacities (Q2031126) (← links)
- Operator complexity: a journey to the edge of Krylov space (Q2044879) (← links)
- Energy levels estimation on a quantum computer by evolution of a physical quantity (Q2064205) (← links)
- Quantum walks: Schur functions meet symmetry protected topological phases (Q2070854) (← links)
- Classical simulation of quantum circuits by half Gauss sums (Q2113488) (← links)
- Error correction of the continuous-variable quantum hybrid computation on two-node cluster states: limit of squeezing (Q2142247) (← links)
- Amortized channel divergence for asymptotic quantum channel discrimination (Q2194108) (← links)
- Solovay-Kitaev approximations of special orthogonal matrices (Q2246526) (← links)
- Error scaling in fault tolerant quantum computation (Q2249003) (← links)
- Analytic methods in quantum computing (Q2255862) (← links)
- Multiplicativity of completely bounded \(p\)-norms implies a strong converse for entanglement-assisted capacity (Q2258018) (← links)
- Vulnerability of cryptographic primitives based on the power conjugacy search problem in quantum computing (Q2263356) (← links)
- Quantum computing with octonions (Q2290694) (← links)
- Quantum information in the Posner model of quantum cognition (Q2318790) (← links)
- Quantum computing: survey and analysis (Q2320203) (← links)
- Quantum error-detection at low energies (Q2332187) (← links)
- Structural stability of the quantum Fourier transform (Q2347657) (← links)
- Rank-one quantum games (Q2353189) (← links)
- Polynomial time quantum computation with advice (Q2390250) (← links)
- The quantum query complexity of the hidden subgroup problem is polynomial (Q2390280) (← links)
- Cost-efficient design of a quantum multiplier-accumulator unit (Q2411575) (← links)
- Minimal and maximal operator spaces and operator systems in entanglement theory (Q2429769) (← links)
- Information complexity of quantum gates (Q2506123) (← links)
- Learning bounds for quantum circuits in the agnostic setting (Q2685576) (← links)
- Partial orbits of quantum gates and full three-particle entanglement (Q2685667) (← links)
- Large \(k\) topological quantum computer (Q2687606) (← links)
- On a measure of distance for quantum strategies (Q2861769) (← links)
- EFFICIENT ALGORITHMS FOR THE BASIS OF FINITE ABELIAN GROUPS (Q2905283) (← links)
- Conditions for optimal input states for discrimination of quantum channels (Q2951755) (← links)