Computational Depth Complexity of Measurement-Based Quantum Computation

DOI10.1007/978-3-642-18073-6_4zbMath1309.68063arXiv0909.4673OpenAlexW2150010940WikidataQ62382453 ScholiaQ62382453MaRDI QIDQ3070975

Elham Kashefi, Dan E. Browne, Simon Perdrix

Publication date: 28 January 2011

Published in: Theory of Quantum Computation, Communication, and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0909.4673

Mathematics Subject Classification ID

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

Related Items (6)

Collapse of the hierarchy of constant-depth exact quantum circuits ⋮ Ancilla-driven quantum computation with twisted graph states ⋮ Compact Gaussian quantum computation by multi-pixel homodyne detection ⋮ Entanglement, Flow and Classical Simulatability in Measurement Based Quantum Computation ⋮ Adiabatic graph-state quantum computation ⋮ Anti-heterotic Computing

This page was built for publication: Computational Depth Complexity of Measurement-Based Quantum Computation