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

Theoretical Computer Science

Ancilla-driven quantum computation with twisted graph states

Janet Anders, Erika Andersson, Dan E. Browne, Elham Kashefi, Daniel K. L. Oi

Published Feb 14, 2012• 12 citations
Publisher
DOI
10.1016/j.tcs.2012.02.007

Related papers

Quantum federated learning through ancilla-driven quantum computation

Wei-Min Shi, Qing-Tian Zhuang, Yi‐Hua Zhou +1 more

Quantum Information Processing•Aug 22, 2025•1 citation

Extending ancilla driven universal quantum computation beyond stepwise determinism

Kerem Halil Shah

•Jan 1, 2016•0 citations

Improving ancilla states for quantum computation

Yaakov S. Weinstein, Daniel Chai, Newton Xie

Quantum Information Processing•Jan 9, 2016•4 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

Weaving independently generated photons into an arbitrary graph state

Qing Lin, Bing He

The controlled-$Z$ (cz) operations acting separately on pairs of qubits are commonly adopted in the schemes of generating graph states, the multipartite entangled states for the one-way quantum computing. For this purpose, we propose a setup of cascade cz operation on a whole group of qubits in sequence. The operation of the setup starts with entangling an ancilla photon with the first photon as qubit, and this ancilla automatically moves from one entanglement link to another in assisting the formation of a string in graph states. The generation of some special types of graph states, such as the three-dimensional ones, can be greatly simplified in this approach. The setup presented uses weak nonlinearities, but an implementation using probabilistic linear optics is also possible.

arXiv:1011.4663•Physical Review A•Dec 16, 2011•20 citations

Experiments Leading Towards Quantum Computation

Hanns‐Christoph Nägerl, Dietrich G. Leibfried, Ferdinand Schmidt‐Kaler +9 more

Springer eBooks•Jan 1, 2000•0 citations
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.
The controlled-ZZZ (cz) operations acting separately on pairs of qubits are commonly adopted in the schemes of generating graph states, the multipartite entangled states for the one-way quantum computing. For this purpose, we propose a setup of cascade cz operation on a whole group of qubits in sequence. The operation of the setup starts with entangling an ancilla photon with the first photon as qubit, and this ancilla automatically moves from one entanglement link to another in assisting the formation of a string in graph states. The generation of some special types of graph states, such as the three-dimensional ones, can be greatly simplified in this approach. The setup presented uses weak nonlinearities, but an implementation using probabilistic linear optics is also possible.