Digital Quantum Simulations of the Non-Resonant Open Tavis-Cummings Model
Abstract
The open Tavis--Cummings model consists of N quantum emitters interacting with a common cavity mode, accounts for losses and decoherence, and is frequently explored for quantum information processing and designing quantum devices. As N increases, it becomes harder to simulate the open Tavis--Cummings model using traditional methods. To address this problem, we implement two quantum algorithms for simulating the dynamics of this model in the inhomogeneous, non-resonant regime, with up to three excitations in the cavity. We show that the implemented algorithms have gate complexities that scale polynomially, as O(N2) and O(N3), while the number of qubits used by these algorithms (space complexity) scales linearly as O(N). One of these algorithms is the sampling-based wave matrix Lindbladization algorithm, for which we propose two protocols to implement its system-independent fixed interaction, resolving key open questions of [Patel and Wilde, Open Sys. & Info. Dyn., 30:2350014 (2023)]. We benchmark our results against a classical differential equation solver in a variety of scenarios and demonstrate that our algorithms accurately reproduce the expected dynamics.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.