Relating Measurement Patterns to Circuits via Pauli Flow

Simmons, Will · 2021 · Electronic Proceedings in Theoretical Computer Science

| 编号 NA110 | 主题 线路综合与等价验证 | DOI 10.4204/eptcs.343.4 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。

2021 · Electronic Proceedings in Theoretical Computer Science The one-way model of Measurement-Based Quantum Computing and the gate-based circuit model give two different presentations of how quantum computation can be performed. There are known methods for converting any gate-based quantum circuit into a one-way computation, whereas the reverse is only efficient given some constraints on the structure of the measurement pattern. Causal flow and generalised flow have already been shown as sufficient, with efficient algorithms for identifying these properties and performing the circuit extraction. Pauli flow is a weaker set of conditions that extends generalised flow to use the knowledge that some vertices are measured in a Pauli basis. In this paper, we show that Pauli flow can similarly be identified efficiently and that any measurement pattern whose underlying graph admits a Pauli flow can be efficiently transformed into a gate-based circuit without using ancilla qubits. We then use this relationship to derive simulation results for the effects of graph-theoretic rewrites in the ZX-calculus using a more circuit-like data structure we call the Pauli Dependency DAG.

全文共 52 页；文本提取件位于 .extracted/papers/NA110.txt（不随站点发布）。

本站词条在引用该文献时，会以 wikilink（sources/NA110）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。