SearcharxivSearch

arXiv · 1703.03382

Exponential improvement in photon storage fidelities using subradiance and "selective radiance" in atomic arrays

Abstract

A central goal within quantum optics is to realize efficient interactions between photons and atoms. A fundamental limit in nearly all applications based on such systems arises from spontaneous emission, in which photons are absorbed by atoms and then re-scattered into undesired channels. In typical treatments of atomic ensembles, it is assumed that this re-scattering occurs independently, and at a rate given by a single isolated atom, which in turn gives rise to standard limits of fidelity in applications such as quantum memories or quantum gates. However, this assumption can be violated. In particular, spontaneous emission of a collective atomic excitation can be significantly suppressed through strong interference in emission. Thus far the physics underlying the phenomenon of subradiance and techniques to exploit it have not been well-understood. In this work, we provide a comprehensive treatment of this problem. First, we show that in ordered atomic arrays in free space, subradiant states acquire an interpretation in terms of optical modes that are guided by the array, which only emit due to scattering from the ends of the finite chain. We also elucidate the properties of subradiant states in the many-excitation limit. Finally, we introduce the new concept of selective radiance. Whereas subradiant states experience a reduced coupling to all optical modes, selectively radiant states are tailored to simultaneously radiate efficiently into a desired channel while scattering into undesired channels is suppressed, thus enabling an enhanced atom-light interface. We show that these states naturally appear in chains of atoms coupled to nanophotonic structures, and we analyze the performance of photon storage exploiting such states. We find that selectively radiant states allow for a photon storage error that scales exponentially better with number of atoms than previously known bounds.

Explore related subjects

Keep this discovery

BibTeXRIS

A. Asenjo-Garcia, M. Moreno-Cardoner, A. Albrecht, H. J. Kimble, D. E. Chang. 2017-03-09. Exponential improvement in photon storage fidelities using subradiance and "selective radiance" in atomic arrays. https://doi.org/10.1103/physrevx.7.031024

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