An analysis of the trade-off between spatial and temporal resources for measurement-based quantum computation

Abstract

In measurement-based quantum computation (MBQC), elementary quantum operations can be more parallelized than the quantum circuit model by employing a larger Hilbert space of graph states used as the resource. Thus MBQC can be regarded as a method of quantum computation where the temporal resource described by the depth of quantum operations can be reduced compared to the quantum circuit model by using the extra spatial resource described by graph states. To analyze the trade-off relationship of the spatial and temporal resources, we consider a method to obtain quantum circuit decompositions of general unitary transformations represented by MBQC on graph states with a certain underlying geometry called generalized flow. We present a method to translate any MBQC with generalized flow into quantum circuits without extra spatial resource. We also show an explicit way to unravel acausal gates that appear in the quantum circuit decomposition derived by a translation method presented in [V. Danos and E. Kashefi, Phys. Rev. A {\bf 74}, 052310 (2006)] and that represent an effect of the reduction of the temporal resource in MBQC. Finally, by considering a way to deterministically simulate these acausal gates, we investigate a general framework to analyze the trade-off between the spacial and temporal resources for quantum computation.

20 pages, 25 figures, improved presentation of results, and changes in the title and the abstract

References in corpus (7)

• Multi-party entanglement in graph states
• Generalized Flow and Determinism in Measurement-based Quantum Computation
• The quantum mechanics of time travel through post-selected teleportation
• Finding flows in the one-way measurement model
• Closed timelike curves in measurement-based quantum computation
• Closed Timelike Curves Make Quantum and Classical Computing Equivalent
• Compact quantum circuits from one-way quantum computation

Cited by in corpus (7)

• There and back again: A circuit extraction tale
• A graph-separation theorem for quantum causal models
• Complete Flow-Preserving Rewrite Rules for MBQC Patterns with Pauli Measurements
• Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation
• Outcome determinism in measurement-based quantum computation with qudits
• Flow conditions for continuous variable measurement-based quantum computing
• Quantum Theory from Principles, Quantum Software from Diagrams