SearcharxivSearch

arXiv · 2104.06929

Anomalous-order exceptional point and non-Markovian Purcell effect at threshold in one-dimensional continuum systems

Abstract

For a system consisting of a quantum emitter coupled near threshold (band edge) to a one-dimensional continuum with a van Hove singularity in the density of states, we demonstrate general conditions such that a characteristic triple level convergence occurs directly on the threshold as the coupling $g$ is shut off. For small $g$ values the eigenvalue and norm of each of these states can be expanded in a Puiseux expansion in terms of powers of $g^{2/3}$, which suggests the influence of a third-order exceptional point. However, in the actual $g \rightarrow 0$ limit, only two discrete states in fact coalesce as the system can be reduced to a $2 \times 2$ Jordan block; the third state instead merges with the continuum. Moreover, the decay width of the resonance state involved in this convergence is significantly enhanced compared to the usual Fermi golden rule, which is consistent with the Purcell effect. However, non-Markovian dynamics due to the branch-point effect are also enhanced near the threshold. Applying a perturbative analysis in terms of the Puiseux expansion that takes into account the threshold influence, we show that the combination of these effects results in quantum emitter decay of the unusual form $1 - C t^{3/2}$ on the key timescale during which most of the decay occurs. We then present two conditions that must be satisfied at the threshold for the anomalous exceptional point to occur: the density of states must contain an inverse square-root divergence and the potential must be non-singular. We further show that when the energy of the quantum emitter is detuned from threshold, the anomalous exceptional point splits into three ordinary exceptional points, two of which appear in the complex-extended parameter space. These results provide deeper insight into a well-known problem in spontaneous decay at a photonic band edge.

Explore related subjects

Keep this discovery

BibTeXRIS

Savannah Garmon, Gonzalo Ordonez, Naomichi Hatano. 2021-04-14. Anomalous-order exceptional point and non-Markovian Purcell effect at threshold in one-dimensional continuum systems. https://doi.org/10.1103/physrevresearch.3.033029

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