Projects per year
Abstract
We introduce a new paradigm for quantum computing called AncillaDriven 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 oneway model [R. Raussendorf and H. J. Briegel. A oneway quantum computer. Physical Review Letters, 86, 2001] to overcome challenging issues in building largescale quantum computers. Instead of directly manipulating each qubit to perform universal quantum logic gates or measurements, ADQC uses a fixed twoqubit interaction to couple the memory register of a quantum computer to an ancilla qubit. By measuring the ancilla, the measurementinduced backaction 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 noncommuting 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. Multiparty entanglement in graph states. Physical Review A, 69, 2004. quantph/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 oneway and circuit models which will allow us to transfer recently developed theory and toolkits of measurementbased quantum computing and quantum circuit models directly into ADQC.
The underlying mathematical model is based on a new entanglement resource called twisted graph states generated from noncommuting 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. Multiparty entanglement in graph states. Physical Review A, 69, 2004. quantph/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 oneway and circuit models which will allow us to transfer recently developed theory and toolkits of measurementbased quantum computing and quantum circuit models directly into ADQC.
Original language  English 

Pages (fromto)  307331 
Number of pages  25 
Journal  Electronic Notes in Theoretical Computer Science 
Volume  249 
DOIs  
Publication status  Published  2009 
Fingerprint Dive into the research topics of 'Twisted Graph States for Ancilladriven Universal Quantum Computation'. Together they form a unique fingerprint.
Projects
 1 Finished

Measurement based quantum computing and it's relation to other quantum models
1/03/08 → 31/07/13
Project: Research