Universality and programmability of quantum computers
From MaRDI portal
Publication:2518381
DOI10.1016/j.tcs.2008.05.007zbMath1155.68028arXiv0710.3329OpenAlexW1997943225MaRDI 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 computersuniversal quantum computersuniversal quantum logic circuitsuniversal quantum Turing machine
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Can a Quantum Computer Run the von Neumann Architecture? ⋮ An Algorithmic Construction of Quantum Circuits of High Descriptive Complexity ⋮ Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Universality and programmability of quantum computers