Interference as a computational resource: a tutorial
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 3737613 (Why is no real title available?)
- scientific article; zbMATH DE number 3765145 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3278278 (Why is no real title available?)
- scientific article; zbMATH DE number 3286045 (Why is no real title available?)
- scientific article; zbMATH DE number 3371972 (Why is no real title available?)
- Computational Complexity of Probabilistic Turing Machines
- Probabilistic automata
- Quantum Computability
- Quantum computing.
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Rapid solution of problems by quantum computation
- Skepticism of quantum computing
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- Various Aspects of Finite Quantum Automata
Cited in
(2)
This page was built for publication: Interference as a computational resource: a tutorial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6084215)