Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition

DOI10.1016/J.ENTCS.2011.01.009zbMath1347.68142OpenAlexW2028168675WikidataQ113318328 ScholiaQ113318328MaRDI QIDQ2825346

Simon Perdrix

Publication date: 7 October 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2011.01.009

zbMATH Keywords

classical controlquantum Turing machineshalting qubit

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (1)

Computing power of Turing machines in the framework of unsharp quantum logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completely positive linear maps on complex matrices
• Quantum computation by measurement and quantum memory
• Universality and programmability of quantum computers
• Local Transition Functions of Quantum Turing Machines
• Strongly Universal Quantum Turing Machines and Invariance of Kolmogorov Complexity
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum Complexity Theory
• The one-way quantum computer--a non-network model of quantum computation
• Classically controlled quantum computation
• Logical Reversibility of Computation

This page was built for publication: Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition