Reducing the Depth of Linear Reversible Quantum Circuits
In quantum computing the decoherence time of the qubits determines the computation time available, and this time is very limited when using current hardware. In this article, we minimize the execution time (the depth) for a class of circuits referred to as linear reversible circuits, which has many...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2021-01-01
|
| Series: | IEEE Transactions on Quantum Engineering |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9475957/ |
| _version_ | 1818366021453479936 |
|---|---|
| author | Timothee Goubault de Brugiere Marc Baboulin Benoit Valiron Simon Martiel Cyril Allouche |
| author_facet | Timothee Goubault de Brugiere Marc Baboulin Benoit Valiron Simon Martiel Cyril Allouche |
| author_sort | Timothee Goubault de Brugiere |
| collection | DOAJ |
| description | In quantum computing the decoherence time of the qubits determines the computation time available, and this time is very limited when using current hardware. In this article, we minimize the execution time (the depth) for a class of circuits referred to as linear reversible circuits, which has many applications in quantum computing (e.g., stabilizer circuits, “CNOT+T” circuits, etc.). We propose a practical formulation of a divide-and-conquer algorithm that produces quantum circuits that are twice as shallow as those produced by existing algorithms. We improve the theoretical upper bound of the depth in the worst case for some range of qubits. We also propose greedy algorithms based on cost minimization to find more optimal circuits for small or simple operators. Overall, we manage to consistently reduce the total depth of a class of reversible functions, with up to 92% savings in an ancilla-free case and up to 99% when ancillary qubits are available. |
| first_indexed | 2024-12-13T22:29:32Z |
| format | Article |
| id | doaj.art-44b1f814b6a44aeea92ba78566e12080 |
| institution | Directory Open Access Journal |
| issn | 2689-1808 |
| language | English |
| last_indexed | 2024-12-13T22:29:32Z |
| publishDate | 2021-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Transactions on Quantum Engineering |
| spelling | doaj.art-44b1f814b6a44aeea92ba78566e120802022-12-21T23:29:07ZengIEEEIEEE Transactions on Quantum Engineering2689-18082021-01-01212210.1109/TQE.2021.30916489475957Reducing the Depth of Linear Reversible Quantum CircuitsTimothee Goubault de Brugiere0https://orcid.org/0000-0001-8543-6871Marc Baboulin1Benoit Valiron2Simon Martiel3Cyril Allouche4Laboratoire de Recherche en Informatique, Université Paris-Saclay, Orsay, FranceLaboratoire de Recherche en Informatique, Université Paris-Saclay, Orsay, FranceLaboratoire de Recherche en Informatique, CentraleSupélec, Orsay, FranceAtos Quantum Lab, Les Clayes-sous-Bois, FranceAtos Quantum Lab, Les Clayes-sous-Bois, FranceIn quantum computing the decoherence time of the qubits determines the computation time available, and this time is very limited when using current hardware. In this article, we minimize the execution time (the depth) for a class of circuits referred to as linear reversible circuits, which has many applications in quantum computing (e.g., stabilizer circuits, “CNOT+T” circuits, etc.). We propose a practical formulation of a divide-and-conquer algorithm that produces quantum circuits that are twice as shallow as those produced by existing algorithms. We improve the theoretical upper bound of the depth in the worst case for some range of qubits. We also propose greedy algorithms based on cost minimization to find more optimal circuits for small or simple operators. Overall, we manage to consistently reduce the total depth of a class of reversible functions, with up to 92% savings in an ancilla-free case and up to 99% when ancillary qubits are available.https://ieeexplore.ieee.org/document/9475957/Linear reversible circuitsquantum computationreversible logic |
| spellingShingle | Timothee Goubault de Brugiere Marc Baboulin Benoit Valiron Simon Martiel Cyril Allouche Reducing the Depth of Linear Reversible Quantum Circuits IEEE Transactions on Quantum Engineering Linear reversible circuits quantum computation reversible logic |
| title | Reducing the Depth of Linear Reversible Quantum Circuits |
| title_full | Reducing the Depth of Linear Reversible Quantum Circuits |
| title_fullStr | Reducing the Depth of Linear Reversible Quantum Circuits |
| title_full_unstemmed | Reducing the Depth of Linear Reversible Quantum Circuits |
| title_short | Reducing the Depth of Linear Reversible Quantum Circuits |
| title_sort | reducing the depth of linear reversible quantum circuits |
| topic | Linear reversible circuits quantum computation reversible logic |
| url | https://ieeexplore.ieee.org/document/9475957/ |
| work_keys_str_mv | AT timotheegoubaultdebrugiere reducingthedepthoflinearreversiblequantumcircuits AT marcbaboulin reducingthedepthoflinearreversiblequantumcircuits AT benoitvaliron reducingthedepthoflinearreversiblequantumcircuits AT simonmartiel reducingthedepthoflinearreversiblequantumcircuits AT cyrilallouche reducingthedepthoflinearreversiblequantumcircuits |