A critical-path scheduler lets quantum circuits combine fast and robust gate pulses by using idle time, keeping latency unchanged and improving measured success rates.
Optimizing Gate Decomposition for High-Level Quantum Programming
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
This paper presents novel methods for optimizing multi-controlled quantum gates, which naturally arise in high-level quantum programming. Our primary approach involves rewriting $U(2)$ gates as $SU(2)$ gates, utilizing one auxiliary qubit for phase correction. This reduces the number of CNOT gates required to decompose any multi-controlled quantum gate from $O(n^2)$ to at most $32n$. Additionally, we can reduce the number of CNOTs for multi-controlled Pauli gates from $16n$ to $12n$ and propose an optimization to reduce the number of controlled gates in high-level quantum programming. We have implemented these optimizations in the Ket quantum programming platform and demonstrated significant reductions in the number of gates. For instance, for a Grover's algorithm layer with 114 qubits, we achieved a reduction in the number of CNOTs from 101,252 to 2,684. This reduction in the number of gates significantly impacts the execution time of quantum algorithms, thereby enhancing the feasibility of executing them on NISQ computers.
fields
quant-ph 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Time Optimization Framework for the Implementation of Robust and Low-latency Quantum Circuits
A critical-path scheduler lets quantum circuits combine fast and robust gate pulses by using idle time, keeping latency unchanged and improving measured success rates.