# [1912.11503] Efficient compression of quantum braided circuitsopen searchopen navigation menucontact arXivsubscribe to arXiv mailings

Mapping a quantum algorithm to any practical large-scale quantum computer will require a sequence of compilations and optimizations. At the level of fault-tolerant encoding, one likely requirement of this process is the translation into a topological circuit, for which braided circuits represent one candidate model. Given the large overhead associated with encoded circuits, it is paramount to reduce their size in terms of computation time and qubit number through circuit compression. While these optimizations have typically been performed in the language of $3$-dimensional diagrams, such a representation does not allow an efficient, general and scalable approach to reduction or verification. We propose the use of the ZX-calculus as an intermediate language for braided circuit compression, demonstrating advantage by comparing results using this approach with those previously obtained for the compression of $| A\rangle$ and $| Y\rangle$ state distillation circuits. We then provide a roug

1 mentions:
Date: 2020/10/17 03:51

## Referring Tweets

@snuffkin 日本でもZX-calculusに関連する研究をしている人たちがいるんですね。(今はじめて知った😅) Efficient compression of quantum braided circuits t.co/cCJ9A5pRXp

## Related Entries

[1504.04350] A framework for exact synthesiscontact arXivarXiv Twitter
0 users, 1 mentions 2020/04/13 06:52
MNIST classification  |  TensorFlow Quantum
0 users, 1 mentions 2020/07/17 14:21
GitHub - XanaduAI/expressive_power_of_quantum_models: This repository contains the source code neces...
0 users, 1 mentions 2020/08/23 00:52
[2009.02376] Verifying Results of the IBM Qiskit Quantum Circuit Compilation Flowopen searchopen nav...
0 users, 1 mentions 2020/09/08 02:22

0 users, 1 mentions 2020/10/19 12:59