Ancilla driven quantum computation with arbitrary entangling strength

Kerem Halil Shah; Daniel K.L. Oi

doi:10.4230/LIPIcs.TQC.2013.1

Ancilla driven quantum computation with arbitrary entangling strength

Kerem Halil Shah^*, Daniel K.L. Oi

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution book

1 Citation (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 language	English
Title of host publication	8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)
Subtitle of host publication	Leibniz International Proceedings in Informatics (LIPIcs)
Editors	Simone Severini, Fernando Brandao
Pages	1-19
Number of pages	19
Volume	22
DOIs	https://doi.org/10.4230/LIPIcs.TQC.2013.1
Publication status	Published - 2013
Event	8th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2013 - Guelph, United Kingdom Duration: 21 May 2013 → 23 May 2013

Conference

Conference	8th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2013
Country/Territory	United Kingdom
City	Guelph
Period	21/05/13 → 23/05/13

Keywords

ancilla
entanglement
quantum computation
random walks
weak measurement

Access to Document

10.4230/LIPIcs.TQC.2013.1

Cite this

@inproceedings{4c9616f5f8084a9fbceb0de8288dc8c2,

title = "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-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.",

keywords = "ancilla, entanglement, quantum computation, random walks, weak measurement",

author = "Shah, {Kerem Halil} and Oi, {Daniel K.L.}",

year = "2013",

doi = "10.4230/LIPIcs.TQC.2013.1",

language = "English",

isbn = "9783939897552",

volume = "22",

pages = "1--19",

editor = "Simone Severini and Fernando Brandao",

booktitle = "8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)",

note = "8th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2013 ; Conference date: 21-05-2013 Through 23-05-2013",

}

Shah, KH & Oi, DKL 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, 8th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2013, Guelph, United Kingdom, 21/05/13. https://doi.org/10.4230/LIPIcs.TQC.2013.1

Ancilla driven quantum computation with arbitrary entangling strength. / Shah, Kerem Halil; Oi, Daniel K.L.
8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013): Leibniz International Proceedings in Informatics (LIPIcs). ed. / Simone Severini; Fernando Brandao. Vol. 22 2013. p. 1-19.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution book

TY - GEN

T1 - Ancilla driven quantum computation with arbitrary entangling strength

AU - Shah, Kerem Halil

AU - Oi, Daniel K.L.

PY - 2013

Y1 - 2013

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

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

KW - ancilla

KW - entanglement

KW - quantum computation

KW - random walks

KW - weak measurement

UR - http://www.scopus.com/inward/record.url?scp=84908243087&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.TQC.2013.1

DO - 10.4230/LIPIcs.TQC.2013.1

M3 - Conference contribution book

AN - SCOPUS:84908243087

SN - 9783939897552

VL - 22

SP - 1

EP - 19

BT - 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)

A2 - Severini, Simone

A2 - Brandao, Fernando

T2 - 8th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2013

Y2 - 21 May 2013 through 23 May 2013

ER -

Ancilla driven quantum computation with arbitrary entangling strength

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this