Topology-Aware Block Coordinate Descent for Qubit Frequency Allocation of Superconducting Quantum Processors

Abstract

Pre-execution calibration is a major bottleneck for operating superconducting quantum processors, and qubit frequency allocation is especially challenging due to crosstalk-coupled objectives. We establish that the widely-used Snake optimizer is mathematically equivalent to Block Coordinate Descent (BCD), providing a rigorous theoretical foundation for this strategy for qubit frequency allocation. Building on this formalization, we present a topology-aware block ordering obtained by casting order selection as a Sequence-Dependent Traveling Salesman Problem (SD-TSP) and solving it efficiently with a nearest-neighbor heuristic. The SD-TSP cost reflects how a given block choice expands the reduced-circuit footprint required to evaluate the block-local objective, enabling orders that minimize per-epoch evaluation time. Under local crosstalk/bounded-degree assumptions, the method achieves linear complexity in qubit count per epoch, while maintaining comparable optimization performance. We formalize the calibration objective, clarify when reduced experiments are equivalent or approximate to the full objective, and analyze convergence of the resulting inexact BCD with noisy measurements. Simulations based on a physics-motivated error simulator show that the proposed BCD-NNA ordering attains the same optimization accuracy at markedly lower runtime than graph-based heuristics (BFS, DFS) and random orders, while also achieving optimization quality comparable to a genetic-algorithm baseline. This method is robust to noisy objective-function evaluations and tolerant to moderate non-local crosstalk mismatch. These results provide a scalable, implementation-ready workflow for frequency calibration in near-term superconducting processors and, more broadly, for locality-structured calibration tasks in future scalable architectures.

25 pages,6 figures

References in corpus (34)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Charge insensitive qubit design derived from the Cooper pair box
• Variational Quantum Algorithms
• A Quantum Engineer's Guide to Superconducting Qubits
• Quantum computational chemistry
• Quantum Chemistry in the Age of Quantum Computing
• Characterizing Quantum Supremacy in Near-Term Devices
• Strong quantum computational advantage using a superconducting quantum processor
• The Variational Quantum Eigensolver: a review of methods and best practices
• Randomized Benchmarking of Quantum Gates
• Quantum algorithms for quantum chemistry and quantum materials science
• Quantum error correction below the surface code threshold
• New material platform for superconducting transmon qubits with coherence times exceeding 0.3 milliseconds
• Hybrid quantum-classical algorithms and quantum error mitigation
• Efficient measurement of quantum gate error by interleaved randomized benchmarking
• Transmon qubit with relaxation time exceeding 0.5 milliseconds
• Quantum certification and benchmarking
• Decoherence benchmarking of superconducting qubits
• Quantum walks on a programmable two-dimensional 62-qubit superconducting processor
• Characterizing large-scale quantum computers via cycle benchmarking
• Quantum Computing for High-Energy Physics: State of the Art and Challenges. Summary of the QC4HEP Working Group
• The Evolution of Quantum Secure Direct Communication: On the Road to the Qinternet
• Measuring the Capabilities of Quantum Computers
• Theory of quantum system certification: a tutorial
• A general framework for randomized benchmarking
• Drug design on quantum computers
• Systematic Improvements in Transmon Qubit Coherence Enabled by Niobium Surface Encapsulation
• Direct randomized benchmarking for multi-qubit devices
• Time-domain characterization and correction of on-chip distortion of control pulses in a quantum processor
• Benchmarking quantum computers
• Optimizing quantum gates towards the scale of logical qubits
• Benchmarking universal quantum gates via channel spectrum
• Scalable Parameter Design for Superconducting Quantum Circuits with Graph Neural Networks