Twisted graph states for ancilla-driven universal quantum computation

DOI10.1016/J.ENTCS.2009.07.096MaRDI QIDQ2805163zbMATH OpenOpenAlexDBLPWikidataFDO

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

Publication date 10 May 2016

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2009.07.096

zbMATH Keywords

ancilla-drivengraph statesquantum computationuniversal quantum computation

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Quantum computation (81P68)

Recommendations

• Ancilla-driven quantum computation with twisted graph states
• Ancilla driven quantum computation with arbitrary entangling strength
• Adiabatic graph-state quantum computation
• Extended measurement calculus
• Universal quantum computation with ideal Clifford gates and noisy ancillas

Cites work

• Computational model underlying the one-way quantum computer
• Graph states for quantum secret sharing
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• Implementing scalable quantum computation with cavities
• Multiparty entanglement in graph states
• Quantum computational networks
• Quantum theory, the Church–Turing principle and the universal quantum computer
• The measurement calculus

Cited in

(5)

• Ancilla driven quantum computation with arbitrary entangling strength
• Ancilla-driven quantum computation with twisted graph states
• Universal quantum computation via quantum controlled classical operations
• Delocalization power of global unitary operations on quantum information
• Anti-heterotic computing

This page was built for publication: Twisted graph states for ancilla-driven universal quantum computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805163)