SearcharxivSearch

arXiv · 2110.15286

Emergent non-Hermitian localization phenomena in the synthetic space of zero-dimensional bosonic systems

Abstract

Phase transitions in non-Hermitian systems are at the focus of cutting edge theoretical and experimental research. On the one hand, parity-time- ($\cal PT$-) and anti-$\cal PT$-symmetric physics have gained ever-growing interest, due to the existence of non-Hermitian spectral singularities called exceptional points (EPs). On the other, topological and localization transitions in non-Hermitian systems reveal new phenomena, e.g., the non-Hermitian skin effect and the absence of conventional bulk-boundary correspondence. The great majority of previous studies exclusively focus on non-Hermitian Hamiltonians, whose realization requires an {\it a priori} fine-tuned extended lattices to exhibit topological and localization transition phenomena.In this work, we show how the non-Hermitian localization phenomena can naturally emerge in the synthetic field moments space of zero-dimensional bosonic systems, e.g., in anti-$\cal PT$ and $\cal PT$-symmetric quantum dimers. This offers an opportunity to simulate localization transitions in low-dimensional systems, without the need to construct complex arrays of, e.g., coupled cavities or waveguides. Indeed, the field moment equations of motion can describe an equivalent (quasi-)particle moving in a one-dimensional (1D) synthetic lattice. This synthetic field moments space can exhibit a nontrivial localization phenomena, such as non-Hermitian skin effect, induced by the presence of highly-degenerate EPs. We demonstrate our findings on the example of an anti-$\cal PT$-symmetric two-mode system, whose higher-order field moments eigenspace is emulated by a synthetic 1D non-Hermitian Hamiltonian having a Sylvester matrix shape. Our results can be directly verified in state-of-the-art optical setups, such as superconducting circuits and toroidal resonators, by measuring photon moments or correlation functions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ievgen I. Arkhipov, Fabrizio Minganti. 2021-10-28. Emergent non-Hermitian localization phenomena in the synthetic space of zero-dimensional bosonic systems. https://doi.org/10.1103/physreva.107.012202

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