Researchers Cut CNOT Gate Count to 12 for Qubit Excitation

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 efficiency in quantum computation has been achieved by designing a circuit requiring fewer controlled-NOT gates, or CNOTs. These gates are fundamental to quantum processing, and reducing their number minimises potential errors and aids in scaling up quantum processors.

The team demonstrated the first decomposition of the double qubit excitation operator, using only 12 CNOTs, an improvement over previous methods needing 13. A strong advance in quantum computing has been made by designing a more efficient circuit for manipulating qubits.

Reducing the number of controlled-NOT gates, or CNOTs, which act as switches flipping a qubit’s state based on another, similar to logic gates in conventional computers, is vital for building larger, more reliable quantum processors. This new circuit also boasts the lowest ‘circuit depth’, akin to the number of steps in a recipe, and requires only two additional one-qubit gates compared to existing methods.

Reduced CNOT gate count enables more efficient quantum computation

A team based in Copenhagen, Denmark, has achieved a 12-CNOT decomposition of the double qubit excitation operator, a reduction from previous implementations requiring 13 CNOT gates. Minimising CNOT gate counts directly reduces the potential for errors during computation, a feat previously unattainable with existing circuit designs. The new circuit demonstrates the lowest CNOT depth and total circuit depth compared to all prior methods, signifying a more streamlined and efficient quantum process.

The circuit necessitates only two additional single-qubit gates compared to the most efficient existing designs, representing a minimal increase in complexity alongside substantial gains in efficiency. Circuit depth, referring to the number of sequential operations before a result is obtained, is also at its lowest, measuring 10, when compared to existing designs. Analysis reveals a total of 13 single-qubit gates alongside the reduced CNOT count and depth, as detailed in their comparative metrics.

Fewer CNOT gates enable more reliable quantum computation through optimised circuit decomposition

Minimising the number of controlled-NOT gates, or CNOTs, within a quantum circuit is vital to reducing errors and enabling more complex calculations. The specific quantum architecture for which this decomposition is most effective, however, remains unstated, as different qubit technologies and their connectivity will inevitably impact performance.

It is sensible to acknowledge that the benefits of this decomposition will vary depending on the specific quantum computer used. Improving upon previous designs requiring 13 gates, this 12-CNOT design offers a pathway to more reliable and complex quantum calculations. Directly addressing a key limitation in scaling up quantum processors and minimising computational errors, achieving this reduction in controlled-NOT gates, the switches that flip a qubit’s state, prompts investigation into extending these optimisation techniques to more complex quantum operations and assessing their performance across diverse quantum computing architectures.

The researchers demonstrated a 12-CNOT decomposition of the double qubit excitation operator, a reduction from previous state-of-the-art circuits requiring 13 CNOT gates. This optimisation matters because fewer CNOT gates generally lead to more reliable quantum computations and reduced errors. The authors suggest extending these optimisation techniques to more complex operations and assessing performance across different quantum computing architectures.