Classically controlled quantum computation

DOI10.1017/S096012950600538XMaRDI QIDQ5482261zbMATH OpenDBLPWikidataFDO

Authors Simon Perdrix, Philippe Jorrand

Publication date 28 August 2006

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Recommendations

• Classically-controlled quantum computation
• Universality of quantum Turing machines with deterministic control
• Quantum Complexity Theory
• scientific article; zbMATH DE number 1335895
• Computational complexity of uniform quantum circuit families and quantum Turing machines

Cited in

(15)

• Universality of quantum Turing machines with deterministic control
• Universal quantum computation via quantum controlled classical operations
• Classical simulation complexity of quantum machines.
• Ancilla-driven quantum computation with twisted graph states
• Partial observation of quantum Turing machines and a weaker well-formedness condition
• Classically time-controlled quantum automata
• Theoretical computer science: computational complexity
• Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
• From symmetric pattern-matching to quantum control
• On quantum lambda calculi: a foundational perspective
• Computing power of Turing machines in the framework of unsharp quantum logic
• Time-space efficient simulations of quantum computations
• Classically-controlled quantum computation
• ROM-based computation: quantum versus classical
• Revisiting the simulation of quantum Turing machines by quantum circuits

This page was built for publication: Classically controlled quantum computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5482261)