Classically controlled quantum computation
From MaRDI portal
Publication:5482261
DOI10.1017/S096012950600538XzbMATH Open1122.68061DBLPjournals/mscs/PerdrixJ06WikidataQ54262617 ScholiaQ54262617MaRDI QIDQ5482261FDOQ5482261
Authors: Simon Perdrix, Philippe Jorrand 
Publication date: 28 August 2006
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Recommendations
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)
Cited In (15)
- Universality of quantum Turing machines with deterministic control
- Classical simulation complexity of quantum machines.
- Universal quantum computation via quantum controlled classical operations
- 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)
