QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES
From MaRDI portal
Publication:5696941
Recommendations
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- Computational complexity of real functions
- Local transition functions of quantum Turing machines
- Oracle Quantum Computing
- Quantum Complexity Theory
- Quantum Computability
- Quantum computational networks
- Quantum computations: algorithms and error correction
- Rapid solution of problems by quantum computation
- Reliable quantum computers
- Strengths and Weaknesses of Quantum Computing
- The complexity of combinatorial problems with succinct input representation
- \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\)
Cited in
(5)- Quantum Computability
- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
- scientific article; zbMATH DE number 1542832 (Why is no real title available?)
- scientific article; zbMATH DE number 2086395 (Why is no real title available?)
- Why it is sufficient to have real-valued amplitudes in quantum computing
This page was built for publication: QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696941)