Pages that link to "Item:Q4232019"
From MaRDI portal
The following pages link to Quantum computations: algorithms and error correction (Q4232019):
Displayed 34 items.
- Volume thresholds for quantum fault tolerance (Q600894) (← 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)
- 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)
- Polynomial time quantum computation with advice (Q2390250) (← links)
- The quantum query complexity of the hidden subgroup problem is polynomial (Q2390280) (← links)
- Information complexity of quantum gates (Q2506123) (← links)
- Quantum algorithms for algebraic problems (Q3077033) (← links)
- Decoherence, einselection, and the quantum origins of the classical (Q3077093) (← links)
- Information and computation: Classical and quantum aspects (Q3077099) (← links)
- Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm (Q3182964) (← links)
- Operational distance and fidelity for quantum channels (Q3438449) (← links)
- Measurement-Based and Universal Blind Quantum Computation (Q3575028) (← links)
- Theory of Quantum Error Correction for General Noise (Q4492704) (← links)
- Topological quantum computation (Q4780388) (← links)
- Efficient discrete approximations of quantum gates (Q4832734) (← links)
- Topological quantum memory (Q4832736) (← links)
- Radon–Nikodym derivatives of quantum operations (Q4833162) (← links)
- MONODROMY APPROACH TO QUANTUM COMPUTING (Q5312095) (← links)
- Quantum computing, postselection, and probabilistic polynomial-time (Q5428317) (← links)
- ALGORITHMIC COMPLEXITY OF QUANTUM STATES (Q5493927) (← links)
- QUANTUM SOFTWARE REUSABILITY (Q5696938) (← links)
- ANALYSIS OF QUANTUM FUNCTIONS (Q5696940) (← links)
- QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES (Q5696941) (← links)
- Algorithms on ensemble quantum computers (Q5962063) (← links)