Related papers: Topology-Aware Block Coordinate Descent for Qubit Frequency Calibration of Superconducting Quantum Processors

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

URL: http://arxiv.org/abs/2601.10203v1
Date: Thu, 15 Jan 2026 09:09:36 GMT
Title: Topology-Aware Block Coordinate Descent for Qubit Frequency Calibration of Superconducting Quantum Processors
Authors: Zheng Zhao, Weifeng Zhuang, Yanwu Gu, Peng Qian, Xiao Xiao, Dong E. Liu,
Abstract summary: Pre-execution calibration is a major bottleneck for operating quantum processors.<n>We show that the widely-used Snake Sequence is equivalent to Block Coordinate Descent (BCD)<n>These results provide a scalable, implementation-ready workflow for frequency calibration on NISQ-era processors.
Score: 9.256953420444077
License: http://creativecommons.org/licenses/by/4.0/
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 calibration strategy. 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 retaining calibration quality. 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 on multi-qubit models 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, and is robust to measurement noise and tolerant to moderate non-local crosstalk. These results provide a scalable, implementation-ready workflow for frequency calibration on NISQ-era processors.

Related papers

Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
arXiv Detail & Related papers (2026-01-10T02:36:03Z)
TRAM: A Transverse Relaxation Time-Aware Qubit Mapping Algorithm for NISQ Devices [4.069193337175605]
We present TRAM (Transverse Relaxation Time-Aware Qubit Mapping), a coherence-guided compilation framework.<n>TRAM integrates calibration-informed community detection to construct noise-resilient qubit partitions.<n>It outperforms SABRE by 3.59% in fidelity, reduces gate count by 11.49%, and shortens circuit depth by 12.28%.
arXiv Detail & Related papers (2025-11-20T05:11:36Z)
Modular Quantum Amplitude Estimation: A Scalable and Adaptive Framework [0.0]
We introduce the Adaptive Windowed Quantum Amplitude Estimation (AWQAE) framework.<n>It is a modular, scalable and adaptive approach that decouples estimation precision from the number of physical qubits required in a single circuit.<n>AWQAE offers a powerful and flexible solution for performing high-precision QAE on resource-constrained quantum hardware.
arXiv Detail & Related papers (2025-08-07T19:19:11Z)
MPQ-DMv2: Flexible Residual Mixed Precision Quantization for Low-Bit Diffusion Models with Temporal Distillation [74.34220141721231]
We present MPQ-DMv2, an improved textbfMixed textbfPrecision textbfQuantization framework for extremely low-bit textbfDiffusion textbfModels.
arXiv Detail & Related papers (2025-07-06T08:16:50Z)
Efficient Qubit Calibration by Binary-Search Hamiltonian Tracking [18.54622697112264]
We present and experimentally implement a real-time protocol for calibrating the frequency of a resonantly driven qubit.<n>We show the efficacy of the algorithm by stabilizing a flux-tunable transmon qubit, leading to improved coherence and gate fidelity.
arXiv Detail & Related papers (2025-01-09T17:18:38Z)
QuTracer: Mitigating Quantum Gate and Measurement Errors by Tracing Subsets of Qubits [8.54896613102673]
Quantum error mitigation plays a crucial role in the current noisy-intermediate-scale-quantum (NISQ) era. We propose QuTracer, a framework designed to mitigate both gate and measurement errors in subsets of qubits.
arXiv Detail & Related papers (2024-04-30T17:06:04Z)
Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
arXiv Detail & Related papers (2023-12-21T17:40:18Z)
Mitigating crosstalk errors by randomized compiling: Simulation of the BCS model on a superconducting quantum computer [41.94295877935867]
Crosstalk errors, stemming from CNOT two-qubit gates, are a crucial source of errors on numerous quantum computing platforms. We develop and apply an extension of the randomized compiling protocol that includes a special treatment of neighboring qubits. Our twirling of neighboring qubits is shown to dramatically improve the noise estimation protocol without the need to add new qubits or circuits.
arXiv Detail & Related papers (2023-05-03T18:00:02Z)
Green, Quantized Federated Learning over Wireless Networks: An Energy-Efficient Design [68.86220939532373]
The finite precision level is captured through the use of quantized neural networks (QNNs) that quantize weights and activations in fixed-precision format. The proposed FL framework can reduce energy consumption until convergence by up to 70% compared to a baseline FL algorithm.
arXiv Detail & Related papers (2022-07-19T16:37:24Z)
Fast Quantum Calibration using Bayesian Optimization with State Parameter Estimator for Non-Markovian Environment [11.710177724383954]
We propose a real-time optimal estimator of qubit states, which utilizes weak measurements and Bayesian optimization to find the optimal control pulses for gate design. Our numerical results demonstrate a significant reduction in the calibration process, obtaining a high gate fidelity.
arXiv Detail & Related papers (2022-05-25T17:31:15Z)
Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
arXiv Detail & Related papers (2021-03-30T18:02:55Z)
AQD: Towards Accurate Fully-Quantized Object Detection [94.06347866374927]
We propose an Accurate Quantized object Detection solution, termed AQD, to get rid of floating-point computation. Our AQD achieves comparable or even better performance compared with the full-precision counterpart under extremely low-bit schemes.
arXiv Detail & Related papers (2020-07-14T09:07:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.