Ancilla driven quantum computation with arbitrary entangling strength

Kerem Halil Shah, Daniel K.L. Oi

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

2 Citations (Scopus)

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

Original languageEnglish
Title of host publication8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)
Subtitle of host publicationLeibniz International Proceedings in Informatics (LIPIcs)
EditorsSimone Severini, Fernando Brandao
Pages1-19
Number of pages19
Volume22
DOIs
Publication statusPublished - 2013
Event8th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2013 - Guelph, United Kingdom
Duration: 21 May 201323 May 2013

Conference

Conference8th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2013
CountryUnited Kingdom
CityGuelph
Period21/05/1323/05/13

Keywords

  • ancilla
  • entanglement
  • quantum computation
  • random walks
  • weak measurement

Fingerprint Dive into the research topics of 'Ancilla driven quantum computation with arbitrary entangling strength'. Together they form a unique fingerprint.

  • Cite this

    Shah, K. H., & Oi, D. K. L. (2013). Ancilla driven quantum computation with arbitrary entangling strength. In S. Severini, & F. Brandao (Eds.), 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013): Leibniz International Proceedings in Informatics (LIPIcs) (Vol. 22, pp. 1-19) https://doi.org/10.4230/LIPIcs.TQC.2013.1