Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1303.2066

Ancilla Driven Quantum Computation with arbitrary entangling strength

Kerem Halil Shah, Daniel K. L. Oi

Published Mar 8, 2013• 11 citations
arXivHTMLPDF

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.

DOI
10.48550/arxiv.1303.2066

Related papers

Ancilla Driven Quantum Computation with Arbitrary Entangling Strength

Kerem Halil Shah, Daniel K. L. Oi

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.

Leibniz international proceedings in informatics•Jan 1, 2013•4 citations

A minimum control ancilla driven quantum computation scheme with repeat-until-success style gate generation

Kerem Halil Shah, Daniel K. L. Oi

Some two qubit interactions are singly sufficient for universal quantum computation but not without the use of an ancilla. Recent schemes for universal quantum computation have focused on hybrid physical systems using ancillae. In them, the application of resources is shifted to the ancilla system. We consider which 2-qubit interactions are universal in ancilla schemes where direct connections between main register qubits are forbidden. By the use of ancilla driven operations and repeat-until-success style random gates, a single fixed symmetric gate can be universal be control of the number of repetitions alone.

arXiv:1401.8004•Jan 30, 2014•10 citations

Ancilla-driven universal quantum computation

Janet Anders, Daniel K. L. Oi, Elham Kashefi +2 more

We introduce a model of quantum computation intermediate between the gate-based and measurement-based models. A quantum register is manipulated remotely with the help of a single ancilla that ``drives'' the evolution of the register. The fully controlled ancilla qubit is coupled to the computational register only via a fixed unitary two-qubit interaction and then measured in suitable bases, driving both single- and two-qubit operations on the register. Arbitrary single-qubit operations directly on register qubits are not needed. We characterize all interactions $E$ that induce a unitary, stepwise deterministic measurement back-action on the register sufficient to implement any quantum channel. Our scheme offers experimental advantages for computation, state preparation, and generalized measurements, since no tunable control of the register is required.

arXiv:0911.3783•Physical Review A•Aug 10, 2010•76 citations

Twisted Graph States for Ancilla-driven Universal Quantum Computation

Elham Kashefi, Daniel K. L. Oi, Dan E. Browne +2 more

We introduce a new paradigm for quantum computing called Ancilla-Driven Quantum Computation (ADQC) which combines aspects both of the quantum circuit [D. Deutsch. Quantum computational networks. Proc. Roy. Soc. Lond A, 425, 1989] and the one-way model [R. Raussendorf and H. J. Briegel. A one-way quantum computer. Physical Review Letters, 86, 2001] to overcome challenging issues in building large-scale quantum computers. Instead of directly manipulating each qubit to perform universal quantum logic gates or measurements, ADQC uses a fixed two-qubit interaction to couple the memory register of a quantum computer to an ancilla qubit. By measuring the ancilla, the measurement-induced back-action on the system performs the desired logical operations. The underlying mathematical model is based on a new entanglement resource called twisted graph states generated from non-commuting operators, leading to a surprisingly powerful structure for parallel computation compared to graph states obtained from commuting generators. [M. Hein, J. Eisert, and H.J. Briegel. Multi-party entanglement in graph states. Physical Review A, 69, 2004. quant-ph/0307130]. The ADQC model is formalised in an algebraic framework similar to the Measurement Calculus [V. Danos, E. Kashefi, and P. Panangaden. The measurement calculus. Journal of ACM, 2007]. Furthermore, we present the notion of causal flow for twisted graph states, based on the stabiliser formalism, to characterise the determinism. Finally we demonstrate compositional embedding between ADQC and both the one-way and circuit models which will allow us to transfer recently developed theory and toolkits of measurement-based quantum computing and quantum circuit models directly into ADQC.

arXiv:0905.3354•Electronic Notes in Theoretical Computer Science•Aug 1, 2009•24 citations

Minimal ancilla-controlled quantum computation

Timothy J Proctor, Erika Andersson, Viv M. Kendon

We characterise a model of universal quantum computation where the register (computational) qubits are controlled by ancillary qubits, using only a single fixed interaction between register and ancillary qubits. No additional access is required to the computational register and the dynamics of both the register and ancilla are unitary. This scheme is inspired by the measurement-based ancilla-driven quantum computation of Anders et al. [PRA 82, 020301(R), 2010], but does not require measurements of the ancillas, and in this respect is similar to the original gate based model of quantum computation. We consider what possible forms this ancilla-register interaction can take, with a proof that the interaction is necessarily locally equivalent to SWAP combined with an entangling controlled gate. We further show which Hamiltonians can create such interactions and discuss two examples; the two-qubit XY Hamiltonian and a particular case of the XXZ Hamiltonian. We then give an example of a simple, finite and fault tolerant gate set for universal quantum computation in this model.

•Jul 23, 2013•0 citations

A Quantum Gate Architecture via Teleportation and Entanglement

Samuel J. Sheldon, Pieter Kok, Callum W. Duncan

We present a universal quantum computing architecture which combines the measurement-driven aspect of MBQC with the circuit model's algorithm dependent generation of qubit entanglement. Our architecture, which we call QGATE, is tailored for discrete-variable photonic quantum computers with deterministic photon sources capable of generating 1D entangled photonic states. QGATE achieves universal quantum computing on a logical data qubit register via the implementation of Clifford operations, QGATE ancilla, and arbitrary angle single-qubit measurements. We realise unitary evolutions defined by multi-qubit Pauli strings via the generation of entanglement between a sub-set of logical qubits and a mutual QGATE ancilla qubit. Measurement of the QGATE ancilla in the appropriate basis then implements a given term of the desired unitary operation. This enables QGATE to both directly perform Hamiltonian evolutions in terms of a series of multi-qubit Pauli operators, in terms of projectors for an arbitrary sparse Hamiltonian, or realise multi-controlled gates enabling direct translation of circuit models to QGATE. We consider examples inspired by quantum chemistry and computational fluid dynamics. We propose an example photonic implementation of QGATE and calculate thresholds of $10.36\pm0.02\%$ or $25.98\pm0.28\%$ on the photonic loss for logical qubits constructed from foliated rotated surface codes, dependent on the deployment of intra-layer or inter-layer fusion respectively.

quant-pharXiv:2512.04171•Quantum Science and Technology•Dec 5, 2025•1 citation
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.
Some two qubit interactions are singly sufficient for universal quantum computation but not without the use of an ancilla. Recent schemes for universal quantum computation have focused on hybrid physical systems using ancillae. In them, the application of resources is shifted to the ancilla system. We consider which 2-qubit interactions are universal in ancilla schemes where direct connections between main register qubits are forbidden. By the use of ancilla driven operations and repeat-until-success style random gates, a single fixed symmetric gate can be universal be control of the number of repetitions alone.
We introduce a model of quantum computation intermediate between the gate-based and measurement-based models. A quantum register is manipulated remotely with the help of a single ancilla that ``drives'' the evolution of the register. The fully controlled ancilla qubit is coupled to the computational register only via a fixed unitary two-qubit interaction and then measured in suitable bases, driving both single- and two-qubit operations on the register. Arbitrary single-qubit operations directly on register qubits are not needed. We characterize all interactions EEE that induce a unitary, stepwise deterministic measurement back-action on the register sufficient to implement any quantum channel. Our scheme offers experimental advantages for computation, state preparation, and generalized measurements, since no tunable control of the register is required.
We introduce a new paradigm for quantum computing called Ancilla-Driven Quantum Computation (ADQC) which combines aspects both of the quantum circuit [D. Deutsch. Quantum computational networks. Proc. Roy. Soc. Lond A, 425, 1989] and the one-way model [R. Raussendorf and H. J. Briegel. A one-way quantum computer. Physical Review Letters, 86, 2001] to overcome challenging issues in building large-scale quantum computers. Instead of directly manipulating each qubit to perform universal quantum logic gates or measurements, ADQC uses a fixed two-qubit interaction to couple the memory register of a quantum computer to an ancilla qubit. By measuring the ancilla, the measurement-induced back-action on the system performs the desired logical operations. The underlying mathematical model is based on a new entanglement resource called twisted graph states generated from non-commuting operators, leading to a surprisingly powerful structure for parallel computation compared to graph states obtained from commuting generators. [M. Hein, J. Eisert, and H.J. Briegel. Multi-party entanglement in graph states. Physical Review A, 69, 2004. quant-ph/0307130]. The ADQC model is formalised in an algebraic framework similar to the Measurement Calculus [V. Danos, E. Kashefi, and P. Panangaden. The measurement calculus. Journal of ACM, 2007]. Furthermore, we present the notion of causal flow for twisted graph states, based on the stabiliser formalism, to characterise the determinism. Finally we demonstrate compositional embedding between ADQC and both the one-way and circuit models which will allow us to transfer recently developed theory and toolkits of measurement-based quantum computing and quantum circuit models directly into ADQC.
We characterise a model of universal quantum computation where the register (computational) qubits are controlled by ancillary qubits, using only a single fixed interaction between register and ancillary qubits. No additional access is required to the computational register and the dynamics of both the register and ancilla are unitary. This scheme is inspired by the measurement-based ancilla-driven quantum computation of Anders et al. [PRA 82, 020301(R), 2010], but does not require measurements of the ancillas, and in this respect is similar to the original gate based model of quantum computation. We consider what possible forms this ancilla-register interaction can take, with a proof that the interaction is necessarily locally equivalent to SWAP combined with an entangling controlled gate. We further show which Hamiltonians can create such interactions and discuss two examples; the two-qubit XY Hamiltonian and a particular case of the XXZ Hamiltonian. We then give an example of a simple, finite and fault tolerant gate set for universal quantum computation in this model.
We present a universal quantum computing architecture which combines the measurement-driven aspect of MBQC with the circuit model's algorithm dependent generation of qubit entanglement. Our architecture, which we call QGATE, is tailored for discrete-variable photonic quantum computers with deterministic photon sources capable of generating 1D entangled photonic states. QGATE achieves universal quantum computing on a logical data qubit register via the implementation of Clifford operations, QGATE ancilla, and arbitrary angle single-qubit measurements. We realise unitary evolutions defined by multi-qubit Pauli strings via the generation of entanglement between a sub-set of logical qubits and a mutual QGATE ancilla qubit. Measurement of the QGATE ancilla in the appropriate basis then implements a given term of the desired unitary operation. This enables QGATE to both directly perform Hamiltonian evolutions in terms of a series of multi-qubit Pauli operators, in terms of projectors for an arbitrary sparse Hamiltonian, or realise multi-controlled gates enabling direct translation of circuit models to QGATE. We consider examples inspired by quantum chemistry and computational fluid dynamics. We propose an example photonic implementation of QGATE and calculate thresholds of 10.36±0.02%10.36\pm0.02\%10.36±0.02% or 25.98±0.28%25.98\pm0.28\%25.98±0.28% on the photonic loss for logical qubits constructed from foliated rotated surface codes, dependent on the deployment of intra-layer or inter-layer fusion respectively.