SearcharxivSearch

arXiv · 2412.02133

Thermal state structure in the Tavis--Cummings model and rapid simulations in mesoscopic quantum ensembles

Abstract

Hybrid quantum systems consisting of a collection of N spin-1/2 particles uniformly interacting with an electromagnetic field, such as one confined in a cavity, are important for the development of quantum information processors and will be useful for metrology, as well as tests of collective behavior. Such systems are often modeled by the Tavis-Cummings model and having an accurate understanding of the thermal behaviors of this system is needed to understand the behavior of them in realistic environments. We quantitatively show in this work that the Dicke subspace approximation is at times invoked too readily, in specific we show that there is a temperature above which the degeneracies in the system become dominant and the Dicke subspace is minimally populated. This transition occurs at a lower temperature than priorly considered. When in such a temperature regime, the key constants of the motion are the total excitation count between the spin system and cavity and the collective angular momentum of the spin system. These enable perturbative expansions for thermal properties in terms of the energy shifts of dressed states, called Lamb shifts herein. These enable efficient numeric methods for obtaining certain parameters that scale as $O(\sqrt{N})$, and is thus highly efficient. These provide methods for approximating, and bounding, properties of these systems as well as characterizing the dominant population regions, including under perturbative noise. In the regime of stronger spin-spin coupling the perturbations outweigh the expansion series terms and inefficient methods likely are needed to be employed, removing the computational efficiency of simulating such systems. The results in this work can also be used for related systems such as coupled-cavity arrays, cavity mediated coupling of collective spin ensembles, and collective spin systems.

Explore related subjects

Keep this discovery

BibTeXRIS

Lane G. Gunderman, Troy Borneman, David G. Cory. 2024-12-03. Thermal state structure in the Tavis--Cummings model and rapid simulations in mesoscopic quantum ensembles. https://arxiv.org/abs/2412.02133

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