Universality and programmability of quantum computers
From MaRDI portal
Publication:2518381
DOI10.1016/j.tcs.2008.05.007zbMath1155.68028arXiv0710.3329MaRDI QIDQ2518381
Petrus H. Potgieter, Johannes Heidema, Willem L. Fouché, Glyn Jones
Publication date: 15 January 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0710.3329
programmable quantum computers; universal quantum computers; universal quantum logic circuits; universal quantum Turing machine
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
81P68: Quantum computation
Related Items
An Algorithmic Construction of Quantum Circuits of High Descriptive Complexity, Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition, Can a Quantum Computer Run the von Neumann Architecture?
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- One complexity theorist's view of quantum computing
- Quantum computational networks
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum Complexity Theory
- Remarks on universal quantum computer