DOAJ Open Access 2021

Reducing the Depth of Linear Reversible Quantum Circuits

Timothee Goubault de Brugiere Marc Baboulin Benoit Valiron Simon Martiel Cyril Allouche

Abstrak

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.

Topik & Kata Kunci

Atomic physics. Constitution and properties of matter Materials of engineering and construction. Mechanics of materials

Penulis (5)

Timothee Goubault de Brugiere

Marc Baboulin

Benoit Valiron

Simon Martiel

Cyril Allouche

Format Sitasi

APA MLA BibTeX

Brugiere, T.G.d., Baboulin, M., Valiron, B., Martiel, S., Allouche, C. (2021). Reducing the Depth of Linear Reversible Quantum Circuits. https://doi.org/10.1109/TQE.2021.3091648

Akses Cepat

PDF tidak tersedia langsung

Cek di sumber asli →

Lihat di Sumber doi.org/10.1109/TQE.2021.3091648

Informasi Jurnal

Tahun Terbit: 2021
Sumber Database: DOAJ
DOI: 10.1109/TQE.2021.3091648
Akses: Open Access ✓