Algorithms on ensemble quantum computers
From MaRDI portal
Publication:5962063
DOI10.1007/s11047-009-9133-0zbMath1207.68153arXivquant-ph/9907067WikidataQ42703129 ScholiaQ42703129MaRDI QIDQ5962063
Farrokh Vatan, P. Oscar Boykin, Tal Mor, Vwani P. Roychowdhury
Publication date: 16 September 2010
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/9907067
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
81P68: Quantum computation
68M15: Reliability, testing and fault tolerance of networks and computer systems
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Cites Work
- Unnamed Item
- A new universal and fault-tolerant quantum basis
- Teleportation as a quantum computation.
- Molecular scale heat engines and scalable quantum computation
- Bulk Spin-Resonance Quantum Computation
- Optimal Algorithmic Cooling of Spins
- Resilient quantum computation: error models and thresholds
- Reliable quantum computers
- Quantum computations: algorithms and error correction
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Algorithmic cooling and scalable NMR quantum computers
- Physical Limits of Heat‐Bath Algorithmic Cooling