Jul 11, 2019 · In this work, we establish an asymptotically optimal space-depth trade-off for CNOT circuits. We prove that any n-qubit CNOT circuit can be parallelized to O\ ...

Dec 23, 2019 · In this work, we establish an asymptotically optimal space-depth trade-off for the design of CNOT circuits. We prove that for any m ≥ 0, any n- ...

Sep 23, 2022 · In this paper, we establish an asymptotically optimal space-depth trade-off for quantum-logic synthesis. The heart of our results is the ...

These improvements are significant theoretically, because we also prove — by a counting argument — that our space-depth trade-off is asymptotically tight.

An asymptotically optimal space-depth trade-off for the design of CNOT circuits is established, and it is proved that for any $m\geq0$-qubit CNOT circuit ...

Jan 28, 2020 · In this work, we establish an asymptotically optimal space-depth tradeoff for the design of CNOT circuits. We prove that for any m ≥ 0, any n- ...

Jul 11, 2019 · Decoherence -- in the current physical implementations of quantum computers -- makes depth reduction a vital task in quantum-circuit design.

This optimization in space-depth trade-off is summarized in the following way [50]: For any integer m ≥ 0, any n-qubit CNOT circuit can be parallelized to O(max ...

Aug 1, 2023 · A CNOT-optimized circuit minimizes the number of CNOT gates needed to realize a quantum algorithm, thus reducing the overall execution time and ...

Nov 5, 2024 · We focus on the depth optimization of CNOT circuits on hardwares with limited connectivity. We adapt the algorithm from Kutin et al.