Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2510.27654

Directional quantum scattering transducer in cooperative Rydberg metasurfaces

Jonas von Milczewski·Kelly Werker Smith·Susanne F. Yelin
View original source ↗Read source document ↗Export metadata ↓

Abstract

We present a single-photon transduction scheme using 4-wave-mixing and quantum scattering in planar, cooperative Rydberg arrays that is both efficient and highly directional and may allow for terahertz-to-optical transduction. In the 4-wave-mixing scheme, two lasers drive the system, coherently trapping the system in a dark ground-state and coupling a signal transition, that may be in the terahertz, to an idler transition that may be in the optical. The photon-mediated dipole-dipole interactions between emitters generate collective super-/subradiant dipolar modes, both on the signal and the idler transition. As the array is cooperative with respect to the signal transition, an incident signal photon can efficiently couple into the array and is admixed into dipolar idler modes by the drive. Under specific criticality conditions, this admixture is into a superradiant idler mode which primarily decays into a specific, highly directional optical photon that propagates within the array plane. Outside of the array, this photon may then be coupled into existing quantum devices for further processing. Using a scattering-operator formalism we derive resonance and criticality conditions that govern this two-step process and obtain analytic transduction efficiencies. For infinite lattices, we predict transduction efficiencies into specific spatial directions of up to 50%, while the overall, undirected transduction efficiency can be higher. An analysis for finite arrays of $N^2$ emitters, shows that the output is collimated into lobes that narrow as $1/\sqrt{N}$. Our scheme combines the broadband acceptance of free-space 4-wave mixing with the efficiency, directionality and tunability of cooperative metasurfaces, offering a route towards quantum-coherent THz detection and processing for astronomical spectroscopy, quantum-networked sparse-aperture imaging and other quantum-sensing applications.

Explore related subjects

quant-phphysics.atom-phphysics.optics

Keep this discovery

BibTeXRIS

Jonas von Milczewski, Kelly Werker Smith, Susanne F. Yelin. 2025-10-31. Directional quantum scattering transducer in cooperative Rydberg metasurfaces. https://doi.org/10.1103/mg88-28r6

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↗