Design and efficiency in graph-state computation

Greg Bowen; Athena Caesura; Simon Devitt; Madhav Krishnan Vijayan

doi:10.48550/arxiv.2502.18985

Papers

qcr:2606.56093.1

Design and efficiency in graph-state computation

arXiv

Greg Bowen, Athena Caesura, Simon Devitt, +1 more

The algorithm-specific graph and circuit etching are two strategies for compiling a graph state to implement quantum computation. Benchmark testing exposed limitations to the proto-compiler, Jabalizer giving rise to Etch (https://github.com/QSI-BAQS/Etch), an open-source, circuit-etching tool for transpiling a quantum circuit to a graph state. The viability of circuit etching is evaluated, both as a resource allocation strategy for distilling magic states and as an alternative to the algorithm-specific graph strategy as realised in Jabalizer. Experiments using Etch to transpile IQP circuits to an equivalent graph state resulted in higher ratios of Pauli qubits to non-Pauli qubit than required for efficient magic state distillation. Future research directions for the algorithm-specific graph and circuit-etching strategies are proposed.

10.48550/arxiv.2502.18985

Published 2025

Uploaded 2 days ago

9

Views

View Publication

Citing this entry? Use this QCR ID

Uploaded by

QCR Librarian

Join the Discussion

Comments (0)

No comments yet. Be the first to share your thoughts!

Indexed by QCR Librarian

This entry was created automatically from publicly available records. QCR links to public sources and only stores repository content where the license permits redistribution.

Claim this entry →