SearcharxivSearch

arXiv · 2607.10704

Passive spectral-admittance bounds and exact continuum certificates for multiresonator quantum-memory interfaces

Abstract

Broadband quantum-memory interfaces are often assessed by center-frequency impedance matching or by a sampled efficiency curve. Neither supplies an operational continuous-band certificate, and absorption is not automatically reversible storage. We model a passive one-port multiresonator interface by a positive-real spectral admittance with explicitly identified controlled output channels. If their one-photon subspace is mapped isometrically into long-lived registers, the write probability for a normalized spectrum $f$ supported in a band $\mathcal{B}$ is $1-\int_{\mathcal{B}} |r(i\omega)|^2 |f(\omega)|^2\,d\omega$, and the worst-case write efficiency is $1-\|r\|_{L^\infty(\mathcal{B})}^2$. We prove that a finite passive rational interface cannot have zero reflection on a nonzero interval and derive the Bode--Fano floor $\|r\|_\infty \geq \exp[-\pi\kappa/(2B)]$ for a band of half-width $B$. At fixed pole locations, minimax synthesis is a quasiconvex semi-infinite problem in the oscillator strengths. We then give an exact computer-assisted certificate: after a decimal design is converted into an explicit rational system, the continuum reflection bound becomes positivity of one univariate polynomial and is proved by Sturm root counting; exact Routh--Hurwitz determinants certify stability and minimum phase. In units $\kappa=2$ and $B=1$, an 11-mode design obeys $0.064112405 \leq \|r\|_\infty < 0.0641125$, implying a conditional uniform write guarantee above $0.995889587$. This is a reproducible certificate for a specified interface, not a claim of global movable-pole optimality or of an experimentally complete memory.

Explore related subjects

Keep this discovery

BibTeXRIS

Maxim V. Churilov. 2026-07-12. Passive spectral-admittance bounds and exact continuum certificates for multiresonator quantum-memory interfaces. https://arxiv.org/abs/2607.10704

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