Upper bound Archives - IEEE Transactions on Quantum Engineering

Depth Optimization of CZ, CNOT, and Clifford Circuits

We seek to develop better upper bound guarantees on the depth of quantum CZ gate, cnot gate, and Clifford circuits than those reported previously. We focus on the number of qubits n≤ 1 345 000 (de Brugière et al. , 2021), which represents the most practical use case. Our upper bound on the depth of CZ circuits is ⌊n/2+0.4993⋅log2(n)+3.0191⋅log(n)−10.9139⌋ , improving the best-known […]

Reducing the Depth of Linear Reversible Quantum Circuits

July 7, 2021Timothée Goubault de Brugière; Marc Baboulin; Benoît Valiron; Simon Martiel; Cyril AlloucheOpen Access, Quantum Computer Architecture, Quantum InformationApproximation algorithms, Hardware, Logic gates, Quantum circuit, Quantum computing, Qubit, Upper bound

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, […]