A new quantum circuit mapping algorithm named TANGO co-optimizes both gate count and circuit depth across diverse benchmark circuits and quantum devices, according to a peer-reviewed study published in EPJ Quantum Technology. Developed by researchers Kang Xu, Peian Chen, Yukun Wang, and Dandan Li, the algorithm addresses fundamental physical connectivity constraints in current quantum computing hardware. By simultaneously targeting two critical architectural metrics, the mapping method aims to reduce physical overhead and improve quantum algorithm execution without sacrificing circuit fidelity.
Current quantum computing devices do not possess full connectivity between qubits, which requires specialized mapping procedures before executing theoretical quantum circuits. Quantum circuit mapping algorithms resolve this constraint by inserting SWAP gates that remap logical qubits to physical qubits. This process transforms abstract logical circuits into physical circuits that strictly comply with hardware connectivity limitations. However, inserting an excessive number of SWAP gates inflates the total gate count and increases circuit depth, which directly degrades the overall fidelity of quantum algorithms.
To overcome these performance penalties, TANGO jointly optimizes both gate count and circuit depth through several interconnected algorithmic mechanisms. The algorithm first introduces a dedicated evaluation function designed to balance the impact of qubit mapping across both mapped and unmapped nodes. By accounting for the state of both sets of nodes during the initial stage, the evaluation function enhances the quality of the initial qubit placement and systematically minimizes the need for subsequent SWAP gate overhead during subsequent operations.
Following the initial placement, TANGO implements a specialized two-stage routing strategy to refine the selection of necessary SWAP gates. This routing procedure prioritizes the count of executable gates while directly factoring in gate distance, circuit depth, and a bidirectional-look SWAP mechanism. By combining these parameters within a two-stage search framework, the algorithm refines which SWAP gates are selected, ensuring that routing decisions support both low gate count and shallow circuit depth throughout the transformation of the circuit.
Beyond initial mapping and routing, the researchers integrated advanced gate optimization techniques into TANGO to further enhance overall circuit performance. The team evaluated the complete method through extensive experimental testing across benchmark circuits of various scales and multiple quantum architectures. These comprehensive tests demonstrated that TANGO consistently outperformed existing state-of-the-art mapping approaches in both total gate count and circuit depth across the diverse computational benchmarks and quantum computing devices examined.
The performance improvements were particularly pronounced in tests involving several large-scale chemistry-related quantum circuits. When compared against the existing SQGM method, TANGO achieved average reductions of 25.19 percent in two-qubit gate count and 7.03 percent in circuit depth. When compared against the NASSC mapping method on the same chemistry benchmarks, TANGO achieved average reductions of 17.61 percent in two-qubit gate count and 17.43 percent in circuit depth, confirming multi-objective co-optimization across diverse benchmark circuits and hardware architectures.
Subject of Research: Quantum circuit mapping and multi-objective optimization
Article Title: A co-optimization qubit mapping algorithm via two-stage search and bidirectional look
Article References: Xu, K., Chen, P., Wang, Y., & Li, D. (2026). A co-optimization qubit mapping algorithm via two-stage search and bidirectional look. EPJ Quantum Technology, 13(1), Article 122. https://doi.org/10.1140/epjqt/s40507-026-00553-4
Image Credits: AI Generated
DOI: 10.1140/epjqt/s40507-026-00553-4
Keywords: quantum computing, qubit mapping, TANGO algorithm, circuit depth, gate count, SWAP gates, two-stage routing, bidirectional look, evaluation function, SQGM, NASSC, chemistry circuits, two-qubit gate count, device connectivity, quantum architecture, physical qubits
Cite Scienmag News
Katie Riggs. (November 21, 2026). TANGO Algorithm Co-Optimizes Gate Count and Depth in Quantum Circuit Mapping. Scienmag. https://scienmag.com/tango-algorithm-co-optimizes-gate-count-and-depth-in-quantum-circuit-mapping/
Katie Riggs. "TANGO Algorithm Co-Optimizes Gate Count and Depth in Quantum Circuit Mapping." Scienmag, 21 November 2026, https://scienmag.com/tango-algorithm-co-optimizes-gate-count-and-depth-in-quantum-circuit-mapping/. Accessed 21 November 2026.
Katie Riggs. "TANGO Algorithm Co-Optimizes Gate Count and Depth in Quantum Circuit Mapping." Scienmag. November 21, 2026. https://scienmag.com/tango-algorithm-co-optimizes-gate-count-and-depth-in-quantum-circuit-mapping/








