pith. sign in

arxiv: 1303.2066 · v1 · pith:BVXMJZYBnew · submitted 2013-03-08 · 🪐 quant-ph

Ancilla Driven Quantum Computation with arbitrary entangling strength

classification 🪐 quant-ph
keywords entanglingancillaarbitrarycomputationdrivengatesquantumuniversal
0
0 comments X
read the original 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-success" 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.