SearcharxivSearch

arXiv · 2606.01254

Stabilization of Granovskii-Zhedanov scars of the XYZ quantum spin chain via non-Hermitian spin relaxation

Abstract

The Granovskii-Zhedanov (GZ) states are exact scar states of the spin-S XYZ chain for S >= 1. As a result, local quantum information encoded in a GZ state remains preserved under the unitary dynamics of the XYZ Hamiltonian; thus, these states evade thermalization and violate ergodicity despite the system being otherwise nonintegrable and chaotic. However, in realistic experimental settings, the realization of an ideal XYZ Hamiltonian is not possible, as perturbations are inevitable. These perturbations ultimately lead to the decay and thermalization of the GZ state. We study the stability and dynamics of GZ states in the presence of generic perturbations and propose physically realistic mechanisms to stabilize them. We show that the product structure of the GZ state allows its lifetime to be enhanced in the presence of an external helical magnetic field, which slows down thermalization but does not prevent it at long times. We further demonstrate that the inclusion of effective non-Hermitian spin relaxation processes can substantially stabilize the GZ states, leading to a nonequilibrium steady state with finite fidelity with GZ state. Such dissipative processes can naturally originate from mechanisms such as Purcell-enhanced spontaneous emission or spin-lattice relaxation in the presence of the helical magnetic field. Using infinite time-evolving block decimation and exact time evolution, we systematically analyze the dynamics and robustness of the GZ states in the perturbed non-Hermitian XYZ model. To connect with experimental platforms, we introduce a Hubbard model that maps onto the XYZ spin system and propose that ring-shaped optical lattices may provide a viable route for realizing and stabilizing GZ states. Finally, we present an equivalent Lindblad description of the effective non-Hermitian dynamics.

Explore related subjects

Keep this discovery

BibTeXRIS

Dhiman Bhowmick. 2026-05-31. Stabilization of Granovskii-Zhedanov scars of the XYZ quantum spin chain via non-Hermitian spin relaxation. https://doi.org/10.1103/cjvx-xt6s

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