Ancilla-driven quantum computation with twisted graph states
From MaRDI portal
Publication:418816
DOI10.1016/j.tcs.2012.02.007zbMath1238.68060OpenAlexW2141056694WikidataQ57942018 ScholiaQ57942018MaRDI QIDQ418816
Elham Kashefi, Janet Anders, Erika Andersson, Daniel K. L. Oi, Dan E. Browne
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
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cluster-state quantum computation
- Parallelizing quantum circuits
- Quantum computational networks
- Computational Depth Complexity of Measurement-Based Quantum Computation
- Multiparty entanglement in graph states
- Implementing scalable quantum computation with cavities
- The measurement calculus
- Graph states for quantum secret sharing
- Classically controlled quantum computation
This page was built for publication: Ancilla-driven quantum computation with twisted graph states