SearcharxivSearch

arXiv · 2411.12611

Low loss lumped-element inductors made from granular aluminum

Abstract

Lumped-element inductors are an integral component in the circuit QED toolbox. However, it is challenging to build inductors that are simultaneously compact, linear and low-loss with standard approaches that either rely on the geometric inductance of superconducting thin films or on the kinetic inductance of Josephson junctions arrays. In this work, we overcome this challenge by utilizing the high kinetic inductance offered by superconducting granular aluminum (grAl). We demonstrate lumped-element inductors with a few nH of inductance that are up to $100$ times more compact than inductors built from pure aluminum (Al). To characterize the properties of these linear inductors, we first report on the performance of lumped-element resonators built entirely out of grAl with sheet inductances varying from $30-320\,$pH/sq and self-Kerr non-linearities of $0.2-20\,\mathrm{Hz/photon}$. Further, we demonstrate ex-situ integration of these grAl inductors into hybrid resonators with Al or tantalum (Ta) capacitor electrodes without increasing total internal losses. Interestingly, the measured internal quality factors systematically decrease with increasing room-temperature resistivity of the grAl film for all devices, indicating a trade-off between compactness and internal loss. For our lowest resistivity grAl films, we measure quality factors reaching $3.5 \times 10^6$ for the all-grAl devices and $4.5 \times 10^6$ for the hybrid grAl/Ta devices, similar to state-of-the-art quantum circuits. Our loss analysis suggests that the surface loss factor of grAl is similar to that of pure Al for our lowest resistivity films, while the increasing losses with resistivity could be explained by increasing conductor loss in the grAl film.

Explore related subjects

Keep this discovery

BibTeXRIS

Vishakha Gupta, Patrick Winkel, Neel Thakur, Peter van Vlaanderen, Yanhao Wang, Suhas Ganjam, Luigi Frunzio, Robert J. Schoelkopf. 2024-11-19. Low loss lumped-element inductors made from granular aluminum. https://arxiv.org/abs/2411.12611

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

KEEP EXPLORING

Related papers

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

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

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