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 (https://doi.org/10.4230/LIPIcs.TQC.2013.1)
Full text not available in this repository.Request a copyAbstract
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.
ORCID iDs
Shah, Kerem Halil ORCID: https://orcid.org/0000-0002-0347-4661 and Oi, Daniel K.L. ORCID: https://orcid.org/0000-0003-0965-9509; Severini, Simone and Brandao, Fernando-
-
Item type: Book Section ID code: 54890 Dates: DateEvent2013Published28 May 2013AcceptedSubjects: Science > Physics Department: University of Strathclyde > University of Strathclyde
Faculty of Science > PhysicsDepositing user: Pure Administrator Date deposited: 11 Dec 2015 04:08 Last modified: 11 Nov 2024 14:58 Related URLs: URI: https://strathprints.strath.ac.uk/id/eprint/54890