Ancilla-driven quantum computation with twisted graph states

DOI10.1016/J.TCS.2012.02.007MaRDI QIDQ418816zbMATH OpenOpenAlexWikidataFDO

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

Publication date 30 May 2012

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

Full work available at URL https://doi.org/10.1016/j.tcs.2012.02.007

zbMATH Keywords

models of quantum computationmulti-partite entanglement

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• Twisted graph states for ancilla-driven universal quantum computation
• Ancilla driven quantum computation with arbitrary entangling strength
• Adiabatic graph-state quantum computation
• Extended measurement calculus
• The measurement calculus

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• Classically controlled quantum computation
• Cluster-state quantum computation
• Computational Depth Complexity of Measurement-Based Quantum Computation
• Computational model underlying the one-way quantum computer
• Graph states for quantum secret sharing
• How to build a 300 bit, 1 Giga-operation quantum computer
• Implementing scalable quantum computation with cavities
• Multiparty entanglement in graph states
• Parallelizing quantum circuits
• Quantum computational networks
• The measurement calculus

Cited in

(4)

• Towards realising secure and efficient image and video processing applications on quantum computers
• Ancilla driven quantum computation with arbitrary entangling strength
• Twisted graph states for ancilla-driven universal quantum computation
• Adiabatic graph-state quantum computation

This page was built for publication: Ancilla-driven quantum computation with twisted graph states

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