SearcharxivSearch

arXiv · 1811.01515

Driven-Dissipative Dynamics of Atomic Ensembles in a Resonant Cavity I: Nonequilibrium Phase Diagram and Periodically Modulated Superradiance

Abstract

We study the dynamics of two ensembles of atoms (or equivalently, atomic clocks) coupled to a bad cavity and pumped incoherently by a Raman laser. Our main result is the nonequilibrium phase diagram for this experimental setup in terms of two parameters - detuning between the clocks and the repump rate. There are three main phases - trivial steady state (Phase I), where all atoms are maximally pumped, nontrivial steady state corresponding to monochromatic superradiance (Phase II), and amplitude-modulated superradiance (Phase III). Phases I and II are fixed points of the mean-field dynamics, while in most of Phase III stable attractors are limit cycles. Equations of motion possess an axial symmetry and a $\mathbb{Z}_{2}$ symmetry with respect to the interchange of the two clocks. Either one or both of these symmetries are spontaneously broken in various phases. The trivial steady state loses stability via a supercritical Hopf bifurcation bringing about a $\mathbb{Z}_{2}$-symmetric limit cycle. The nontrivial steady state goes through a subcritical Hopf bifurcation responsible for coexistence of monochromatic and amplitude-modulated superradiance. Using Floquet analysis, we show that the $\mathbb{Z}_{2}$-symmetric limit cycle eventually becomes unstable and gives rise to two $\mathbb{Z}_{2}$-asymmetric limit cycles via a supercritical pitchfork bifurcation. Each of the above attractors has its own unique fingerprint in the power spectrum of the light radiated from the cavity. In particular, limit cycles in Phase III emit frequency combs - series of equidistant peaks, where the symmetry of the frequency comb reflects the symmetry of the underlying limit cycle. For typical experimental parameters, the spacing between the peaks is several orders of magnitude smaller than the monochromatic superradiance frequency, making the lasing frequency highly tunable.

Explore related subjects

Keep this discovery

BibTeXRIS

Aniket Patra, Boris L. Altshuler, Emil A. Yuzbashyan. 2019-09-10. Driven-Dissipative Dynamics of Atomic Ensembles in a Resonant Cavity I: Nonequilibrium Phase Diagram and Periodically Modulated Superradiance. https://doi.org/10.1103/physreva.99.033802

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