Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2506.08130

Broadband and high-precision two-level system loss measurement using superconducting multi-wave resonators

Cliff Chen·Shahriar Aghaeimeibodi·Yuki Sato·Matthew H. Matheny·Oskar Painter·Jiansong Gao
View original source ↗Read source document ↗Export metadata ↓

Abstract

Two-level systems (TLS) are known to be a dominant source of dissipation and decoherence in superconducting qubits. Superconducting resonators provide a convenient way to study TLS-induced loss due to easier design and fabrication in comparison to devices that include non-linear elements. However, accurately measuring TLS-induced loss in a resonator in the quantum regime is challenging due to low signal-to-noise ratio (SNR) and the temporal fluctuations of the TLS, leading to uncertainties of 30% or more. To address these limitations, we develop a multi-wave resonator device that extends the resonator length from a standard quarter-wave $\lambda/4$ to $N\lambda/4$ where $N = 37$ at 6GHz. This design provides two key advantages: the TLS-induced fluctuations are reduced by a factor of $\sqrt{N}$ due to spatial averaging over an increased number of independent TLS, and the measurement SNR for a given intra-resonator energy density improves by a factor of $\sqrt{N}$. The multi-wave resonator also has fundamental and harmonic resonances that allow one to study the frequency dependence of TLS-induced loss. In this work we fabricate both multi-wave and quarter-wave coplanar waveguide resonators formed from thin-film aluminum on a silicon substrate, and characterize their TLS properties at both 10mK and 200mK. Our results show that the power-dependent TLS-induced loss measured from both types of resonators agree well, with the multi-wave resonators achieving a five-fold reduction in measurement uncertainty due to TLS fluctuations, down to 5%. The $N\lambda/4$ resonator also provides a measure of the fully unsaturated TLS-induced loss due to the improved measurement SNR at low intra-resonator energy densities. Finally, measurements across seven harmonic resonances of the $N\lambda/4$ resonator between 4GHz - 6.5GHz reveals no frequency dependence in the TLS-induced loss over this range.

Explore related subjects

quant-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Cliff Chen, Shahriar Aghaeimeibodi, Yuki Sato, Matthew H. Matheny, Oskar Painter, Jiansong Gao. 2025-06-09. Broadband and high-precision two-level system loss measurement using superconducting multi-wave resonators. https://doi.org/10.1103/2l7h-zn9s

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph↗
arXiv2026

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph↗
arXiv2026

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph↗