Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2009.11191

Morris-Shore transformation for non-degenerate systems

K. N. Zlatanov·G. S. Vasilev·N. V. Vitanov
View original source ↗Read source document ↗Export metadata ↓

Abstract

The Morris-Shore (MS) transformation is a powerful tool for decomposition of the dynamics of multistate quantum systems to a set of two-state systems and uncoupled single states. It assumes two sets of states wherein any state in the first set can be coupled to any state in the second set but the states within each set are not coupled between themselves. Another important condition is the degeneracy of the states in each set, although all couplings between the states from different sets can be detuned from resonance by the same detuning. The degeneracy condition limits the application of the MS transformation in various physically interesting situations, e.g. in the presence of electric and/or magnetic fields or light shifts, which lift the degeneracy in each set of states, e.g. when these sets comprise the magnetic sublevels of levels with nonzero angular momentum. This paper extends the MS transformation to such situations, in which the states in each of the two sets are nondegenerate. To this end, we develop an alternative way for the derivation of Morris-Shore transformation, which can be applied to non-degenerate sets of states. We present a generalized eigenvalue approach, by which, in the limit of small detunings from degeneracy, we are able to generate an effective Hamiltonian that is dynamically equivalent to the non-degenerate Hamiltonian. The effective Hamiltonian can be mapped to the Morris-Shore basis with a two-step similarity transformation. After the derivation of the general framework, we demonstrate the application of this technique to the popular Lambda three-state system, and the four-state tripod, double-Lambda and diamond systems. In all of these systems, our formalism allows us to reduce their quantum dynamics to simpler two-state systems even in the presence of various detunings, e.g. generated by external fields of frequency drifts.

Explore related subjects

quant-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

K. N. Zlatanov, G. S. Vasilev, N. V. Vitanov. 2021-01-07. Morris-Shore transformation for non-degenerate systems. https://doi.org/10.1103/physreva.102.063113

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↗