Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2601.10203 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911542341009408 |
|---|---|
| author | Zhao, Zheng Zhuang, Weifeng Gu, Yanwu Qian, Peng Xiao, Xiao Liu, Dong E. |
| author_facet | Zhao, Zheng Zhuang, Weifeng Gu, Yanwu Qian, Peng Xiao, Xiao Liu, Dong E. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_10203 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Topology-Aware Block Coordinate Descent for Qubit Frequency Allocation of Superconducting Quantum Processors Zhao, Zheng Zhuang, Weifeng Gu, Yanwu Qian, Peng Xiao, Xiao Liu, Dong E. Quantum Physics 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. |
| title | Topology-Aware Block Coordinate Descent for Qubit Frequency Allocation of Superconducting Quantum Processors |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2601.10203 |