Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2504.20398

Noise limits for dc SQUID readout of high-$Q$ resonators below 300 MHz

V. Ankel·C. Bartram·J. Begin·C. Bell·L. Brouwer·S. Chaudhuri·John Clarke·H. -M. Cho·J. Corbin·W. Craddock·S. Cuadra·A. Droster·M. Durkin·J. Echevers·J. T. Fry·G. Hilton·K. D. Irwin·A. Keller·R. Kolevatov·A. Kunder·D. Li·N. Otto·K. M. W. Pappas·N. M. Rapidis·C. P. Salemi·D. Schmidt·M. Simanovskaia·J. Singh·P. Stark·C. D. Tesche·J. Ullom·L. Vale·E. C. van Assendelft·K. van Bibber·M. Vissers·K. Wells·J. Wiedemann·L. Winslow·D. Wright·A. K. Yi·B. A. Young
View original source ↗Read source document ↗Export metadata ↓

Abstract

We present the limits on noise for the readout of cryogenic high-$Q$ resonators using dc Superconducting Quantum Interference Devices (SQUIDs) below 300 MHz. This analysis uses realized first-stage SQUIDs (previously published), whose performance is well described by Tesche-Clarke (TC) theory, coupled directly to the resonators. We also present data from a prototype second-stage dc SQUID array designed to couple to this first-stage SQUID as a follow-on amplifier with high system bandwidth. This analysis is the first full consideration of dc SQUID noise performance referred to a high-$Q$ resonator over this frequency range, and is presented relative to the standard quantum limit. We include imprecision, backaction, and backaction-imprecision noise correlations from TC theory, the noise contributed by the second-stage SQUIDs, wiring, and preamplifiers, and optimizations for both on-resonance measurements and off-resonance scan sensitivity. This architecture has modern relevance due to the increased interest in axion searches and the requirements of the DMRadio-m$^3$ axion search, which will use dc SQUIDs in this frequency range.

Explore related subjects

quant-phhep-ex

Keep this discovery

BibTeXRIS

V. Ankel, C. Bartram, J. Begin, C. Bell, L. Brouwer, S. Chaudhuri, John Clarke, H. -M. Cho, J. Corbin, W. Craddock, S. Cuadra, A. Droster, M. Durkin, J. Echevers, J. T. Fry, G. Hilton, K. D. Irwin, A. Keller, R. Kolevatov, A. Kunder, D. Li, N. Otto, K. M. W. Pappas, N. M. Rapidis, C. P. Salemi, D. Schmidt, M. Simanovskaia, J. Singh, P. Stark, C. D. Tesche, J. Ullom, L. Vale, E. C. van Assendelft, K. van Bibber, M. Vissers, K. Wells, J. Wiedemann, L. Winslow, D. Wright, A. K. Yi, B. A. Young. 2025-04-29. Noise limits for dc SQUID readout of high-$Q$ resonators below 300 MHz. https://doi.org/10.1063/5.0280831

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↗