dorsal/arxiv
View SchemaQuantum Circuit Simplification and Level Compaction
| Authors | D. Maslov, G. W. Dueck, D. M. Miller, C. Negrevergne |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0604001 |
| URL | https://arxiv.org/abs/quant-ph/0604001 |
| DOI | 10.1109/TCAD.2007.911334 |
| Journal | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 27(3):436-444, March 2008 |
Abstract
Quantum circuits are time dependent diagrams describing the process of quantum computation. Usually, a quantum algorithm must be mapped into a quantum circuit. Optimal synthesis of quantum circuits is intractable and heuristic methods must be employed. With the use of heuristics, the optimality of circuits is no longer guaranteed. In this paper, we consider a local optimization technique based on templates to simplify and reduce the depth of non-optimal quantum circuits. We present and analyze templates in the general case, and provide particular details for the circuits composed of NOT, CNOT and controlled-sqrt-of-NOT gates. We apply templates to optimize various common circuits implementing multiple control Toffoli gates and quantum Boolean arithmetic circuits. We also show how templates can be used to compact the number of levels of a quantum circuit. The runtime of our implementation is small while the reduction in number of quantum gates and number of levels is significant.
{
"annotation_id": "4d43ff85-8b74-477d-a760-22042694af4b",
"date_created": "2026-03-02T18:02:26.809000Z",
"date_modified": "2026-03-02T18:02:26.809000Z",
"file_hash": "fe9964daa5bc2da527d625ad5b60fe0b3614c839c8cc16f90b9722b29cadd349",
"private": false,
"record": {
"abstract": "Quantum circuits are time dependent diagrams describing the process of\nquantum computation. Usually, a quantum algorithm must be mapped into a quantum\ncircuit. Optimal synthesis of quantum circuits is intractable and heuristic\nmethods must be employed. With the use of heuristics, the optimality of\ncircuits is no longer guaranteed. In this paper, we consider a local\noptimization technique based on templates to simplify and reduce the depth of\nnon-optimal quantum circuits. We present and analyze templates in the general\ncase, and provide particular details for the circuits composed of NOT, CNOT and\ncontrolled-sqrt-of-NOT gates. We apply templates to optimize various common\ncircuits implementing multiple control Toffoli gates and quantum Boolean\narithmetic circuits. We also show how templates can be used to compact the\nnumber of levels of a quantum circuit. The runtime of our implementation is\nsmall while the reduction in number of quantum gates and number of levels is\nsignificant.",
"arxiv_id": "quant-ph/0604001",
"authors": [
"D. Maslov",
"G. W. Dueck",
"D. M. Miller",
"C. Negrevergne"
],
"categories": [
"quant-ph"
],
"doi": "10.1109/TCAD.2007.911334",
"journal_ref": "IEEE Transactions on Computer-Aided Design of Integrated Circuits\n and Systems, 27(3):436-444, March 2008",
"title": "Quantum Circuit Simplification and Level Compaction",
"url": "https://arxiv.org/abs/quant-ph/0604001"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "27e5a60e-468b-48de-8939-d6558757525f",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}