Ancilla Driven Quantum Computation with Arbitrary Entangling Strength

Authors Kerem Halil Shah, Daniel K.L. Oi

Thumbnail PDF


  • Filesize: 0.8 MB
  • 19 pages

Document Identifiers

Author Details

Kerem Halil Shah
Daniel K.L. Oi

Cite AsGet BibTex

Kerem Halil Shah and Daniel K.L. Oi. Ancilla Driven Quantum Computation with Arbitrary Entangling Strength. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)


We extend the model of Ancilla Driven Quantum Computation (ADQC) by considering gates with arbitrary entangling power. By giving up stepwise determinism, universal QC can still be achieved through a variable length sequence of single qubit gates and probabilistic "repeat-until-succes" entangling operations. This opens up a new range of possible physical implementations as well as shedding light on the sets of resources sufficient for universal QC.
  • Ancilla
  • weak measurement
  • quantum computation
  • entanglement
  • random walks


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail