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.
@InProceedings{halilshah_et_al:LIPIcs.TQC.2013.1, author = {Halil Shah, Kerem and Oi, Daniel K.L.}, title = {{Ancilla Driven Quantum Computation with Arbitrary Entangling Strength}}, booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)}, pages = {1--19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-55-2}, ISSN = {1868-8969}, year = {2013}, volume = {22}, editor = {Severini, Simone and Brandao, Fernando}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.1}, URN = {urn:nbn:de:0030-drops-43094}, doi = {10.4230/LIPIcs.TQC.2013.1}, annote = {Keywords: Ancilla, weak measurement, quantum computation, entanglement, random walks} }
Feedback for Dagstuhl Publishing