License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TQC.2013.1
URN: urn:nbn:de:0030-drops-43094
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2013/4309/
Halil Shah, Kerem ;
Oi, Daniel K.L.
Ancilla Driven Quantum Computation with Arbitrary Entangling Strength
Abstract
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.
BibTeX - Entry
@InProceedings{halilshah_et_al:LIPIcs:2013:4309,
author = {Kerem Halil Shah and Daniel K.L. Oi},
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 = {Simone Severini and Fernando Brandao},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4309},
URN = {urn:nbn:de:0030-drops-43094},
doi = {10.4230/LIPIcs.TQC.2013.1},
annote = {Keywords: Ancilla, weak measurement, quantum computation, entanglement, random walks}
}
|
Keywords: |
|
Ancilla, weak measurement, quantum computation, entanglement, random walks |
|
Collection: |
|
8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013) |
|
Issue Date: |
|
2013 |
|
Date of publication: |
|
13.11.2013 |
