Ancilla driven quantum computation with arbitrary entangling strength

Shah, Kerem Halil and Oi, Daniel K.L.; Severini, Simone and Brandao, Fernando, eds. (2013) Ancilla driven quantum computation with arbitrary entangling strength. In: 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, GBR, pp. 1-19. ISBN 9783939897552

Full text not available in this repository.Request a copy from the Strathclyde author


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-untilsucces" 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.


Shah, Kerem Halil ORCID logoORCID: and Oi, Daniel K.L. ORCID logoORCID:; Severini, Simone and Brandao, Fernando