aiqbench analysis
This optimization reduces CNOT gate counts from thirteen to twelve for double qubit excitation operators while maintaining low circuit depth. By minimizing these fundamental error-prone operations, researchers have created a more scalable and reliable pathway for executing complex quantum algorithms on current hardware. This advancement directly addresses the critical challenge of reducing noise in near-term quantum processors without significantly increasing overall gate complexity.
Researchers Cut CNOT Gate Count to 12 for Qubit Excitation
A complex quantum calculation previously requiring thirteen controlled-NOT gates now operates with just twelve. This reduction, alongside the lowest measured circuit depth, represents a tangible step towards minimising error rates in quantum processors. The new circuit achieves this optimisation while adding only two additional single-qubit gates compared to existing methods.
A 12-CNOT decomposition of the double qubit excitation operator has been achieved, a key component in several quantum algorithms. This new circuit improves upon state-of-the-art implementations previously requiring 13 CNOTs, while also achieving the lowest CNOT depth and total circuit depth, with only two additional one-qubit gates compared to existing methods. A new level of…
Excerpt shown under the publisher's RSS terms · 55 words · full text and figures are on the publisher's site
Related coverage
Realizing the fermionic Laughlin state on a trapped-ion quantum processor
AWS · Jun 9, 2026
Top Neutral Atom Quantum Computing Companies and Rydberg Array Vendor Guide
Quantum Zeitgeist · May 28, 2026
Reinforcement learning cuts gate count for 4-qubit states
Quantum Zeitgeist · Oct 17, 2026
A 12-CNOT Double Qubit Excitation Gate
arXiv · Aug 19, 2026