Algorithms on ensemble quantum computers

DOI10.1007/S11047-009-9133-0zbMath1207.68153DBLPjournals/nc/BoykinMRV10arXivquant-ph/9907067OpenAlexW2035510778WikidataQ42703129 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

zbMATH Keywords

quantum algorithmsensemble (bulk) quantum computersfault tolerance computingNMR

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Reliability, testing and fault tolerance of networks and computer systems (68M15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

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

This page was built for publication: Algorithms on ensemble quantum computers