Algorithms on ensemble quantum computers
From MaRDI portal
Abstract: In ensemble (or bulk) quantum computation, measurements of qubits in an individual computer cannot be performed. Instead, only expectation values can be measured. As a result of this limitation on the model of computation, various important algorithms cannot be processed directly on such computers, and must be modified. We provide modifications of various existing protocols, including algorithms for universal fault--tolerant computation, Shor's factorization algorithm (which can be extended to any algorithm computing an NP function), and some search algorithms to enable processing them on ensemble quantum computers.
Recommendations
Cites work
- A new universal and fault-tolerant quantum basis
- Algorithmic cooling and scalable NMR quantum computers
- Bulk Spin-Resonance Quantum Computation
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- Molecular scale heat engines and scalable quantum computation
- Optimal Algorithmic Cooling of Spins
- Physical Limits of Heat‐Bath Algorithmic Cooling
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum computations: algorithms and error correction
- Reliable quantum computers
- Resilient quantum computation: error models and thresholds
- Teleportation as a quantum computation.
Cited in
(3)
This page was built for publication: Algorithms on ensemble quantum computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962063)