betaFeedback

WorksPhysics and Astronomy

Simulating closed- and open-system dynamics of Tavis–Cummings lattices on fault-tolerant quantum computers

Abstract

Tavis–Cummings lattices couple cavities containing several emitters and host polaritonic many-body dynamics whose real-time correlations are costly to compute classically in two dimensions, especially when unequal emitter relaxation or dephasing rates break permutation symmetry. We analyze logical resources for fault-tolerant closed- and open-system simulation of an atom-resolved lattice with LL cavities, NN emitters per cavity, and photon cutoff n_max⁡n\_{\max}, including target observable estimation. Building on ladder-operator block encoding, we construct circuits for photon hopping and local light–matter exchange and combine them to encode the lattice Hamiltonian. By updating source and destination photon occupations in place, the hopping circuit eliminates the auxiliary L⌈log⁡2(n_max⁡+1)⌉L\lceil\log_2(n\_{\max}+1)\rceil-qubit photon register used by two-register implementations. Across three uniform-coefficient examples with 1616 to 256256 cavities, the controlled walk uses 4.754.75–8.118.11% fewer Toffoli gates than the paired two-register implementation under matched shared preparation, precision, control, and workspace conventions. For closed systems, we implement real-time evolution with generalized quantum signal processing and bound the cost of estimating retarded cavity spectral functions. For open systems with photon loss, emitter relaxation, and dephasing, we use a sampled first-order dilation and bound the runs and timesteps needed to estimate transient photon statistics such as g(2)(0)g^{(2)}(0). With state-preparation and measurement costs explicit, these estimates provide a reference for assessing fault-tolerant light–matter lattice simulation costs.

Introduction

An array of coupled cavities combines local light–matter exchange with the transport of photons between sites [1, 2, 3]. The Jaynes–Cummings model describes the coupling of one two-level emitter to a cavity mode [4], while the Tavis–Cummings model extends this interaction to an ensemble of emitters [5]. Allowing photons to hop between cavities extends these models to the Jaynes–Cummings lattice [6, 7] and the Tavis–Cummings lattice [8], respectively, with the resulting polaritonic behavior governed by hopping, detuning, and emitter saturation [9, 10]. Related proposals use collective cavity–emitter interactions to prepare entangled atomic states and implement nonlocal multiqubit gates [11, 12]. Calculations of spectral functions [13, 14] and non-equilibrium dynamics [2] can help distinguish collective modes, resolve interaction effects, and assess how imperfections [15] modify the response of these arrays. In cavity QED, transmission spectra and equal-time photon correlations diagnose ensemble-induced strong coupling and photon blockade [16].

Exact calculations of these quantities quickly become expensive. For identical emitters, permutation symmetry reduces each cavity’s emitter space, and conservation of the total excitation number splits closed-system evolution into independent excitation sectors. For a 4×44 \times4 lattice with four emitters per cavity and photon cutoff nmax⁡=15n_{\max}=15 at unit filling, these reductions take 21282^{128} basis states down to 240.42^{40.4}, but a single state vector still occupies about 23 TB Section III. Sign-problem-free quantum Monte Carlo helps with equilibrium properties for suitable hopping conventions [17], but none of these tools guarantees efficient calculation of real-time many-body correlations in two dimensions. Open dynamics introduces an additional consideration: when emitters in the same cavity have different relaxation or dephasing rates, permutation symmetry is generally broken, and reductions based on equivalent emitters no longer apply.

Digital quantum simulations of related light–matter systems have used product formulas for photon hopping in Jaynes–Cummings–Hubbard cavity arrays [18], extended Jaynes–Cummings models [19], and coherent or dissipative single-cavity models [20, 21, 22, 23]. The open Tavis–Cummings simulation of Ref. [20] uses established Lindblad simulation methods [24] to study both undriven relaxation and pumped steady states. Ladder-operator block encoding (LQBE) provides a general method for implementing bosonic and fermionic operators directly in their occupation registers [25]. Kane et al. [26] built alternative block encodings of lattice-boson Hamiltonians from quantum singular value transformation (QSVT) [27], quantum eigenvalue transformation of unitary matrices (QETU) [28], and linear operators via exponentiation and linear combination of unitaries (LOVE-LCU), and compared them at the circuit level. For the lattice model, the remaining resource questions concern the cost of addressing a coherently selected pair of cavities, the amount of occupation-dependent coefficient data that must be loaded, and the cost of combining photon hopping with local exchange. A further question is how these circuit costs contribute to the resources required to estimate a specified observable. Re-solving these questions is necessary to turn an asymptotic Hamiltonian-simulation bound into a useful resource estimate, as previous studies have done for condensed-matter and chemistry models [29, 30, 31].

In this work, we analyze the logical resources required to simulate a two-dimensional atom-resolved Tavis–Cummings lattice. The Hamiltonian allows site-dependent hopping amplitudes, polariton potentials, and light–matter couplings. The emitters within each cavity share the same coherent parameters, but may have different relaxation and dephasing rates. Such differences occur in cavity-QED experiments with individually characterized emitters [32]. We therefore represent each emitter by its own qubit, so that its dissipative channels can be applied individually. Building on the ladder-operator block-encoding framework of [25], we construct circuits for photon hopping and local light–matter exchange and combine them into a block encoding of the lattice Hamiltonian. A photon hop changes only the source and destination occupations, so our circuit decrements the source register and increments the destination register in place. A sparse-access implementation [33] instead writes the updated photon configuration into a second register. We build both with the same treatment of the bosonic coefficients and local exchange, so the comparison isolates the in-place update. On the largest of our three instances, with 256 cavities, the in-place update removes 1,024 logical qubits and reduces the peak qubit count for one walk from 3,423 to 2,399 (Table II). Across the three instances, it also uses 4.75–8.11% fewer Toffoli gates per controlled walk step than the cheapest two-register implementation we construct. Two further savings apply to both constructions: the two branches of each walk step share one coefficient preparation, and removing the uniform part of the polariton potential lowers the normalization by 34–46% in the three instances, which reduces the number of walk steps needed. We use the resulting block encoding with generalized quantum signal processing (GQSP) for real-time evolution [34] and connect its cost to the estimation of photon spectra and transient photon statistics. We report Toffoli-family operations, arbitrary rotations, and logical qubits separately, and account for both the cost of each block-encoding call and the number of calls needed for the simulation. We further implement finite-precision rotations, including the outer selection and GQSP signal rotations, through reversible arithmetic on reusable phase-gradient catalysts [35, 36]. Combining these circuits with a seven-TT [37, 38] decomposition of each coherent Toffoli gives explicit logical TT-count bounds for the specified closed- and sampled open-system constructions, with catalyst preparation accounted for separately. Product formulas exploit the local structure of the Hamiltonian [39, 40] and may offer lower practical costs [29], even though signal-processing methods scale better with accuracy [27, 41, 42]; we return to this trade-off in § 0.9.

For closed dynamics, we consider the retarded photon spectrum, obtained from correlation functions that describe adding a photon to, or removing one from, a specified stationary state [43, 44]. We account for the evolution time, simulation accuracy, and repeated measurements needed to estimate the spectrum over a finite observation window, and leave the cost of preparing the initial state as a separate term. For open dynamics, we use a sampled first-order unitary dilation [45] to estimate photon populations and equal-time second-order correlations during relaxation. The model includes photon loss, emitter relaxation, and dephasing, but no external drive or pump. We therefore study the transient behavior of an initially excited lattice.

Numerical matrix calculations check the operator identities, while small-instance gate simulations test projected block encodings, controls, adjoints, and catalyst return. Recursive decomposition of executable Qultran circuits [46] reproduces the specified coherent gate counts and logical-qubit allocations. Exact diagonalization checks the spectral calculation on a small lattice, and a two-cavity simulation checks the open-system method’s timestep convergence. These are logical resource estimates under the stated counting conventions; physical error-correction overhead is not included.

The flowchart in Figure 1 summarizes the organization of the paper. We introduce the atom-resolved Tavis–Cummings lattice in § 0.2 and discuss the cost of its classical simulation in Section III. In Sections IV and § 0.5, we construct block encodings for photon hopping and for the on-site diagonal and light–matter exchange terms, respectively. We combine these constructions in Section VI to encode the full Hamiltonian, derive the cost of closed-system simulation, and compare this in-place (direct) photon update with two-register implementations. In Section VIII, we extend the simulation to open dynamics using a sampled first-order dilation. We then analyze the cost of estimating retarded photon spectra and transient photon statistics in § 0.8.4. Finally, we discuss our findings and their limitations in § 0.9.

End-to-end workflow for the atom-resolved Tavis–Cummings lattice simulation algorithm

Figure 1. End-to-end workflow for the atom-resolved TCL simulation algorithm. The hopping and local operators are block encoded and combined through an outer LCU. The resulting Hamiltonian encoding is used for closed-system GQSP evolution and, together with sampled Lindblad jump operators, for open-system dilation. Spectral correlators and transient photon statistics are estimated using their corresponding measurement routines. Resource accounting applies across all stages.

The atom-resolved Tavis–Cummings lattice

Hamiltonian

We consider L=LxLyL=L_xL_y cavities on a two-dimensional lattice with periodic boundary conditions, sketched in Figure 2. Cavity ii carries one photon mode with untruncated operators aia_i, ai†a_i^\dagger satisfying [ai,aj†]=δij[a_i,a_j^\dagger]=\delta_{ij}, and NN two-level emitters labeled r=1,…,Nr=1,\ldots,N. The Hilbert space is

Figure 2. Schematic of the atom-resolved Tavis–Cummings lattice. Left: a 3×33 \times3 patch of the square lattice of L=LxLyL = L_xL_y cavities, each hosting one photon mode. Solid lines denote nearest-neighbor hopping tijt_{ij} (Eq. (4)); dashed segments indicate bonds continuing beyond the displayed patch. The simulated lattice has periodic boundary conditions. Right: detail of the highlighted cavity (gold outline in the left panel), carrying its photon mode aia_i and NN individually addressed two-level emitters σi,r\sigma_{i,r}, each exchanging one excitation with the cavity mode with coupling gig_i (Eq. (5)). The three dissipative channels of § 0.2 B are shown schematically: photon loss with rate κi\kappa_i, emitter relaxation with rate γ1,i,r\gamma_{1,i,r}, and pure dephasing with rate γϕ,i,r\gamma_{\phi,i,r} (Eq. (13)). Each emitter has its own relaxation and dephasing channels; the repeated channels are omitted for clarity.

H=(⨂i=1LHph(i))⊗(⨂i=1L⨂r=1NHat(i,r)),(1)\mathcal{H}=\left(\bigotimes_{i=1}^{L}\mathcal{H}_{\mathrm{ph}}^{(i)}\right)\otimes\left(\bigotimes_{i=1}^{L}\bigotimes_{r=1}^{N}\mathcal{H}_{\mathrm{at}}^{(i,r)}\right), \tag*{(1)}

where Hph(i)\mathcal{H}_{\mathrm{ph}}^{(i)} is the Fock space of mode ii, subsequently truncated to nmax⁡+1n_{\max}+1 levels, and Hat(i,r)\mathcal{H}_{\mathrm{at}}^{(i,r)} is the two-dimensional space of one emitter. After truncation dim⁡H=(nmax⁡+1)L2LN\dim\mathcal{H}=(n_{\max}+1)^{L}2^{LN}. On the truncated space the ladder operators act as

ai∣m⟩=m∣m−1⟩,a_i|m\rangle=\sqrt{m}|m-1\rangle,
{#eq:2}

a_i^\dagger|m\rangle=\sqrt{m+1}|m+1\rangle,

Equation not extracted

with ai∣0⟩=0a_i|0\rangle=0 and ai†∣nmax⁡⟩=0a_i^\dagger|n_{\max}\rangle=0. The finite-dimensional operators therefore obey

[ai,aj†]=δij(I−(nmax⁡+1)∣nmax⁡⟩⟨nmax⁡∣i),(2)[a_i,a_j^\dagger]=\delta_{ij}\left(I-(n_{\max}+1)|n_{\max}\rangle\langle n_{\max}|_i\right), \tag*{(2)}

where ∣nmax⁡⟩⟨nmax⁡∣i|n_{\max}\rangle\langle n_{\max}|_i acts on photon mode ii. This boundary term is introduced by the photon cutoff. The hopping block encoding must therefore assign zero amplitude to any transfer that would raise an occupation from nmax⁡n_{\max} to nmax⁡+1.Throughoutwesetn_{\max}+1. Throughout we set\hbar=1$ and measure all frequencies, couplings, and rates in units of a reference light–matter coupling gg. Adding photon hopping between neighboring cavities to the Tavis–Cummings interaction, while retaining a separate label for every emitter, gives the rotating-wave Hamiltonian [5, 8]

HTCL=Hhop⏟photon hopping+Hdiag⏟detuning and potential+Hint⏟light–matter exchange,(3)H_{\mathrm{TCL}}=\underbrace{H_{\mathrm{hop}}}_{\text{photon hopping}}+\underbrace{H_{\mathrm{diag}}}_{\text{detuning and potential}}+\underbrace{H_{\mathrm{int}}}_{\text{light--matter exchange}}, \tag*{(3)}

with

Hhop=−∑⟨i,j⟩tij(ai†aj+aj†ai),(4)H_{\mathrm{hop}}=-\sum_{\langle i,j\rangle}t_{ij}\left(a_i^\dagger a_j+a_j^\dagger a_i\right), \tag*{(4)}
Hint=∑i=1L∑r=1Ngi(aiσi,r++ai†σi,r−),(5)H_{\mathrm{int}}=\sum_{i=1}^{L}\sum_{r=1}^{N}g_i\left(a_i\sigma_{i,r}^{+}+a_i^\dagger\sigma_{i,r}^{-}\right), \tag*{(5)}

and

Hdiag=−Δ∑i=1L∑r=1Nni,rat−∑i=1Lνi(niph+∑r=1Nni,rat).(6)\begin{aligned} H_{\mathrm{diag}}={}&-\Delta\sum_{i=1}^{L}\sum_{r=1}^{N}n_{i,r}^{\mathrm{at}}\\ &-\sum_{i=1}^{L}\nu_i\left(n_i^{\mathrm{ph}}+\sum_{r=1}^{N}n_{i,r}^{\mathrm{at}}\right). \tag*{(6)} \end{aligned}

Here niph=ai†ain_i^{\mathrm{ph}}=a_i^\dagger a_i and Δ=ωc−ωa\Delta=\omega_c-\omega_a is the common cavity–emitter detuning. The signed coefficient νi\nu_i is a site-dependent polariton potential in the rotating frame. The amplitudes tijt_{ij}, potentials νi\nu_i, and couplings gig_i are real and may vary across the lattice; the NN emitters within a cavity share the coupling gig_i. We keep the full LNLN-qubit emitter register because independent single-emitter channels can populate emitter-spin sectors outside the maximal-spin manifold. Unequal emitter rates also remove the permutation covariance that can simplify a density-matrix representation.

With the convention Z∣0⟩=∣0⟩Z\lvert0\rangle=\lvert0\rangle and Z∣1⟩=−∣1⟩Z\lvert1\rangle=-\lvert1\rangle, where ∣0⟩\lvert0\rangle and ∣1⟩\lvert1\rangle are the emitter ground and excited states, the emitter excitation number is

ni,rat=∣1⟩⟨1∣i,r=I−Zi,rat2.(7)n_{i,r}^{\mathrm{at}}=\lvert1\rangle\langle1\rvert_{i,r}=\frac{I-Z_{i,r}^{\mathrm{at}}}{2}. \tag*{(7)}

The local polariton number is np,i=niph+∑rni,ratn_{p,i}=n_i^{\mathrm{ph}}+\sum_r n_{i,r}^{\mathrm{at}}, and the total is Np=∑inp,iN_p=\sum_i n_{p,i}. Each term of Eq. (3) either moves a photon between sites, is a function of the number operators, or converts one photon into one emitter excitation, so [HTCL,Np]=0[H_{\mathrm{TCL}},N_p]=0. The on-site exchange also conserves np,in_{p,i}, whereas hopping does not.

We use the frame rotating at the common cavity frequency ωc\omega_c. Write the laboratory-frame Hamiltonian as

Hlab=ωcNp+HTCL,(8)H_{\mathrm{lab}}=\omega_cN_p+H_{\mathrm{TCL}}, \tag*{(8)}

and define the rotating-frame transformation and state convention by

Rc(t)=exp⁡(iωctNp),R_c(t)=\exp(i\omega_ctN_p),
∣ψrot(t)⟩=Rc(t)∣ψlab(t)⟩.\lvert\psi_{\mathrm{rot}}(t)\rangle=R_c(t)\lvert\psi_{\mathrm{lab}}(t)\rangle.

The rotating-frame Hamiltonian is

References

  1. [1]M. J. Hartmann, F. G. S. L. Brandão, and M. B. Plenio, Quantum many-body phenomena in coupled cavity arrays, Laser Photonics Rev. 2, 527 (2008).DOI
  2. [2]C. Noh and D. G. Angelakis, Quantum simulations and many-body physics with light, Rep. Prog. Phys. 80, 016401 (2017).DOI
  3. [3]M. J. Hartmann, F. G. S. L. Brandão, and M. B. Plenio, Strongly interacting polaritons in coupled arrays of cavities, Nat. Phys. 2, 849 (2006).
  4. [4]E. T. Jaynes and F. W. Cummings, Comparison of quantum and semiclassical radiation theories with application to the beam maser, Proc. IEEE 51, 89 (1963).DOI
  5. [5]M. Tavis and F. W. Cummings, Exact Solution for an N-Molecule—Radiation-Field Hamiltonian, Phys. Rev. 170, 379 (1968).DOI
  6. [6]A. D. Greentree, C. Tahan, J. H. Cole, and L. C. L. Hollenberg, Quantum phase transitions of light, Nat. Phys. 2, 856 (2006).
  7. [7]D. G. Angelakis, M. F. Santos, and S. Bose, Photon-blockade-induced Mott transitions and XY spin models in coupled cavity arrays, Phys. Rev. A 76, 031805 (2007).DOI
  8. [8]M. Knap, E. Arrigoni, and W. von der Linden, Quantum phase transition and excitations of the Tavis-Cummings lattice model, Phys. Rev. B 82, 045126 (2010).DOI
  9. [9]M. Aichhorn, M. Hohenadler, C. Tahan, and P. B. Littlewood, Quantum fluctuations, temperature, and detuning effects in solid-light systems, Phys. Rev. Lett. 100, 216401 (2008).DOI
  10. [10]J. Koch and K. Le Hur, Superfluid–Mott-insulator transition of light in the Jaynes-Cummings lattice, Phys. Rev. A 80, 023811 (2009).DOI
  11. [11]S. Jandura, V. Srivastava, L. Pecorari, G. K. Brennen, and G. Pupillo, Nonlocal multiqubit quantum gates via a driven cavity, Phys. Rev. A 110, 062610 (2024).DOI
  12. [12]V. Srivastava, S. Jandura, G. K. Brennen, and G. Pupillo, Cavity polarization blockade for non-local entangling gates with trapped atoms, Quantum Sci. Technol. 10, 045038 (2025).DOI
  13. [13]P. Pippan, H. G. Evertz, and M. Hohenadler, Excitation spectra of strongly correlated lattice bosons and polaritons, Phys. Rev. A 80, 033612 (2009).DOI
  14. [14]M. Knap, E. Arrigoni, and W. von der Linden, Polaritonic properties of the Jaynes-Cummings lattice model in two dimensions, Comput. Phys. Commun. 182, 2036 (2011).DOI
  15. [15]D. Rossini and R. Fazio, Mott-insulating and glassy phases of polaritons in 1D arrays of coupled cavities, Phys. Rev. Lett. 99, 186401 (2007).DOI
  16. [16]S. Schütz, J. Schachenmayer, D. Hagenmüller, G. K. Brennen, T. Volz, V. Sandoghdar, T. W. Ebbesen, C. Genes, and G. Pupillo, Ensemble-induced strong light-matter coupling of a single quantum emitter, Phys. Rev. Lett. 124, 113602 (2020).DOI
  17. [17]M. Hohenadler, M. Aichhorn, S. Schmidt, and L. Pollet, Dynamical critical exponent of the Jaynes-Cummings-Hubbard model, Phys. Rev. A 84, 041608 (2011).DOI
  18. [18]M. Tudorovskaya and D. Muñoz Ramo, Quantum Computing Simulation of a Mixed Spin-Boson Hamiltonian and Its Performance for a Cavity Quantum Electrodynamics Problem, Phys. Rev. A 109, 032612 (2024), arXiv:2310.11342.DOI
  19. [19]N. Nguyen, M. Yu, A. Robertson, H. Nishimura, S. J. Elman, and B. Koltenbah, End-to-end complexity analysis for quantum simulation of the extended Jaynes-Cummings model (2025), arXiv:2509.13546 [quant-ph].arxiv.org/abs/2509.13546
  20. [20]A. N. Sims, D. Patel, A. Philip, A. H. Rubin, R. Bandyopadhyay, M. Radulaski, and M. M. Wilde, Digital quantum simulations of the nonresonant open Tavis-Cummings model, Phys. Rev. Res. 7, 043302 (2025).DOI
  21. [21]A. Mezzacapo, U. Las Heras, J. S. Pedernales, L. DiCarlo, E. Solano, and L. Lamata, Digital quantum Rabi and Dicke models in superconducting circuits, Sci. Rep. 4, 7482 (2014).DOI
  22. [22]N. K. Langford, R. Sagastizabal, M. Kounalakis, C. Dickel, A. Bruno, F. Luthi, D. J. Thoen, A. Endo, and L. DiCarlo, Experimentally simulating the dynamics of quantum light and matter at deep-strong coupling, Nat. Commun. 8, 1715 (2017).DOI
  23. [23]A. Haukisalmi, D. Paz Ramos, M. Raasakka, A. Marchesin, L. Ylinen, and I. Tittonen, Noisy quantum simulation: Performance and resource considerations for the Tavis-Cummings and Heisenberg models, Phys. Rev. Res. 7, 043254 (2025).arxiv.org/abs/2402.16692
  24. [24]R. Cleve and C. Wang, Efficient Quantum Algorithms for Simulating Lindblad Evolution, in 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Leibniz International Proceedings in Informatics, Vol. 80 (Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2017) pp. 17:1–17:14.arxiv.org/abs/1612.09512
  25. [25]W. A. Simon, C. M. Gustin, K. Serafin, A. Ralli, G. R. Goldstein, and P. J. Love, Ladder operator block-encoding, Quantum 9, 1953 (2025).DOI
  26. [26]C. F. Kane, S. H. Kaprishak, N. S. Modi, M. Kreshchuk, and C. W. Bauer, Block encoding bosons by signal processing, Quantum 9, 1747 (2025).DOI
  27. [27]A. Gilyén, Y. Su, G. H. Low, and N. Wiebe, Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics, in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (2019) pp. 193–204, arXiv:1806.01838.DOI
  28. [28]Y. Dong, L. Lin, and Y. Tong, Ground-state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices, PRX Quantum 3, 040305 (2022).DOI
  29. [29]A. M. Childs, D. Maslov, Y. Nam, N. J. Ross, and Y. Su, Toward the first quantum simulation with quantum speedup, Proc. Natl. Acad. Sci. U.S.A. 115, 9456 (2018).DOI
  30. [30]R. Babbush, C. Gidney, D. W. Berry, N. Wiebe, J. McClean, A. Paler, A. Fowler, and H. Neven, Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity, Phys. Rev. X 8, 041015 (2018).DOI
  31. [31]N. Nguyen, T. W. Watts, B. Link, K. S. Williams, Y. R. Sanders, S. J. Elman, M. Kieferova, M. J. Bremner, K. J. Morrell, J. Elenewski, E. B. Isaacs, S. D. Johnson, L. Mathieson, K. M. Obenland, M. Otten, R. Sundareswara, and A. Holmes, Quantum computing for corrosion simulation: workflow and resource analysis, npj Quantum Inf. 12, 27 (2026).DOI
  32. [32]J. A. Mlynek, A. A. Abdulmalikov, C. Eichler, and A. Wallraff, Observation of Dicke superradiance for two artificial atoms in a cavity with high decay rate, Nat. Commun. 5, 5186 (2014).DOI
  33. [33]D. W. Berry, A. M. Childs, and R. Kothari, Hamiltonian simulation with nearly optimal dependence on all parameters, in 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (2015) pp. 792–809.DOI
  34. [34]D. Motlagh and N. Wiebe, Generalized quantum signal processing, PRX Quantum 5, 020368 (2024).arxiv.org/abs/2308.01501
  35. [35]C. Sünderhauf, E. Campbell, and J. Camps, Block-encoding structured matrices for data input in quantum computing, Quantum 8, 1226 (2024).DOI
  36. [36]C. Hindlycke and J.-Å. Larsson, Single-qubit rotation algorithm with logarithmic Toffoli count and gate depth, Phys. Rev. Res. 6, L042027 (2024).DOI
  37. [37]P. Selinger, Quantum circuits of T-depth one, Phys. Rev. A 87, 042302 (2013), arXiv:1210.0974.DOI
  38. [38]M. Amy, D. Maslov, M. Mosca, and M. Roetteler, A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits, IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 32, 818 (2013).DOI
  39. [39]A. M. Childs and Y. Su, Nearly optimal lattice simulation by product formulas, Phys. Rev. Lett. 123, 050503 (2019).DOI
  40. [40]A. M. Childs, Y. Su, M. C. Tran, N. Wiebe, and S. Zhu, Theory of Trotter error with commutator scaling, Phys. Rev. X 11, 011020 (2021).DOI
  41. [41]G. H. Low and I. L. Chuang, Hamiltonian Simulation by Qubitization, Quantum 3, 163 (2019).
  42. [42]G. H. Low and I. L. Chuang, Optimal Hamiltonian simulation by quantum signal processing, Phys. Rev. Lett. 118, 010501 (2017).DOI
  43. [43]R. D. Somma, G. Ortiz, J. E. Gubernatis, E. Knill, and R. Laflamme, Simulating physical phenomena by quantum networks, Phys. Rev. A 65, 042323 (2002).
  44. [44]D. Wecker, M. B. Hastings, N. Wiebe, B. K. Clark, C. Nayak, and M. Troyer, Solving strongly correlated electron models on a quantum computer, Phys. Rev. A 92, 062318 (2015).DOI
  45. [45]Z. Ding, X. Li, and L. Lin, Simulating Open Quantum Systems Using Hamiltonian Simulations, PRX Quantum 5, 020332 (2024).
  46. [46]M. P. Harrigan, T. Khattar, C. Yuan, A. Peduri, N. Yosri, F. D. Malone, R. Babbush, and N. C. Rubin, Expressing and Analyzing Quantum Algorithms with Qualtran (2024), arXiv:2409.04643 [quant-ph].arxiv.org/abs/2409.04643
  47. [47]V. Gorini, A. Kossakowski, and E. C. G. Sudarshan, Completely positive dynamical semigroups of N-level systems, J. Math. Phys. 17, 821 (1976).DOI
  48. [48]G. Lindblad, On the generators of quantum dynamical semigroups, Commun. Math. Phys. 48, 119 (1976).DOI
  49. [49]H.-P. Breuer and F. Petruccione, The Theory of Open Quantum Systems (Oxford University Press, 2002).
  50. [50]M. Kliesch, T. Barthel, C. Gogolin, M. Kastoryano, and J. Eisert, Dissipative quantum Church-Turing theorem, Phys. Rev. Lett. 107, 120501 (2011).pubmed.ncbi.nlm.nih.gov/22026760
  51. [51]A. M. Childs and T. Li, Efficient simulation of sparse Markovian quantum dynamics, Quantum Inf. Comput. 17, 901 (2017).DOI
  52. [52]R. Kubo, Statistical-Mechanical Theory of Irreversible Processes. I. General Theory and Simple Applications to Magnetic and Conduction Problems, J. Phys. Soc. Jpn. 12, 570 (1957).DOI
  53. [53]G. D. Mahan, Many-Particle Physics, 3rd ed. (Springer, 2000).
  54. [54]R. J. Glauber, The quantum theory of optical coherence, Phys. Rev. 130, 2529 (1963).
  55. [55]W. Hoeffding, Probability inequalities for sums of bounded random variables, J. Am. Stat. Assoc. 58, 13 (1963).
  56. [56]N. P. D. Sawaya, T. Menke, T. H. Kyaw, S. Johri, A. Aspuru-Guzik, and G. G. Guerreschi, Resource-efficient digital quantum simulation of d-level systems for photonic, vibrational, and spin-s Hamiltonians, npj Quantum Inf. 6, 49 (2020).DOI
  57. [57]J. Dalibard, Y. Castin, and K. Mølmer, Wave-function approach to dissipative processes in quantum optics, Phys. Rev. Lett. 68, 580 (1992).pubmed.ncbi.nlm.nih.gov/10045937
  58. [58]P. Kirton and J. Keeling, Suppressing and restoring the Dicke superradiance transition by dephasing and decay, Phys. Rev. Lett. 118, 123602 (2017).DOI
  59. [59]N. Shammah, S. Ahmed, N. Lambert, S. De Liberato, and F. Nori, Open quantum systems with local and collective incoherent processes: Efficient numerical simulations using permutational invariance, Phys. Rev. A 98, 063815 (2018).DOI
  60. [60]N. Schuch, M. M. Wolf, F. Verstraete, and J. I. Cirac, Computational complexity of projected entangled pair states, Phys. Rev. Lett. 98, 140506 (2007).pubmed.ncbi.nlm.nih.gov/17501258
  61. [61]N. Schuch, M. M. Wolf, K. G. H. Vollbrecht, and J. I. Cirac, On entropy growth and the hardness of simulating time evolution, New J. Phys. 10, 033032 (2008).DOI
  62. [62]M. Zwolak and G. Vidal, Mixed-state dynamics in one-dimensional quantum lattice systems: A time-dependent superoperator renormalization algorithm, Phys. Rev. Lett. 93, 207205 (2004).
  63. [63]A. H. Werner, D. Jaschke, P. Silvi, M. Kliesch, T. Barthel, J. Eisert, and S. Montangero, Positive tensor network approach for simulating open quantum many-body systems, Phys. Rev. Lett. 116, 237201 (2016), arXiv:1412.5746.DOI
  64. [64]C. Mc Keever and M. H. Szymańska, Stable iPEPO tensor-network algorithm for dynamics of two-dimensional open quantum lattice models, Phys. Rev. X 11, 021035 (2021).
  65. [65]S. Finazzi, A. Le Boité, F. Storme, A. Baksic, and C. Ciuti, Corner-space renormalization method for driven-dissipative two-dimensional correlated systems, Phys. Rev. Lett. 115, 080604 (2015).pubmed.ncbi.nlm.nih.gov/26340174
  66. [66]J. Jin, A. Biella, O. Viyuela, L. Mazza, J. Keeling, R. Fazio, and D. Rossini, Cluster mean-field approach to the steady-state phase diagram of dissipative spin systems, Phys. Rev. X 6, 031011 (2016).DOI
  67. [67]S. Aaronson and A. Arkhipov, The computational complexity of linear optics, in Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (STOC 2011) (2011) pp. 333–342.
  68. [68]A. Deshpande, B. Fefferman, M. C. Tran, M. Foss-Feig, and A. V. Gorshkov, Dynamical phase transitions in sampling complexity, Phys. Rev. Lett. 121, 030501 (2018).DOI
  69. [69]R. Trivedi and J. I. Cirac, Transitions in computational complexity of continuous-time local open quantum dynamics, Phys. Rev. Lett. 129, 260405 (2022).DOI
  70. [70]A. M. Childs and N. Wiebe, Hamiltonian simulation using linear combinations of unitary operations, Quantum Inf. Comput. 12, 901 (2012).
  71. [71]D. W. Berry, A. M. Childs, R. Cleve, R. Kothari, and R. D. Somma, Simulating Hamiltonian dynamics with a truncated Taylor series, Phys. Rev. Lett. 114, 090502 (2015).pubmed.ncbi.nlm.nih.gov/25793789
  72. [72]J. Zylberman, U. Nzongani, A. Simonetto, and F. Debbasch, Efficient quantum circuits for non-unitary and unitary diagonal operators with space-time-accuracy trade-offs, ACM Trans. Quantum Comput. 6, 1 (2025).arxiv.org/abs/2404.02819
  73. [73]B. Peng, Y. Su, D. Claudino, K. Kowalski, G. H. Low, and M. Roetteler, Quantum Simulation of Boson-Related Hamiltonians: Techniques, Effective Hamiltonian Construction, and Error Analysis, Quantum Sci. Technol. 10, 023002 (2025), arXiv:2307.06580.arxiv.org/abs/2307.06580
  74. [74]A. Saunders and F. Jamet, Efficient Block Encoding of Structured Hamiltonians by Separating Where and What (2026), arXiv:2610.03686.
  75. [75]M. Liu, A. Gnanasekaran, A. Kaushik, S. Hariprakash, A. M. Khah, M. Roetteler, and G. Salton, Low-frustration block encodings by patch routing (2026), arXiv:2610.32946.arxiv.org/abs/2610.32946
  76. [76]J. Haah, M. B. Hastings, R. Kothari, and G. H. Low, Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians, in 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) (IEEE, 2018) pp. 350–360, arXiv:1801.03922.DOI
  77. [77]D. W. Berry, D. Motlagh, G. Pantaleoni, and N. Wiebe, Doubling the efficiency of Hamiltonian simulation via generalized quantum signal processing, Phys. Rev. A 110, 012601 (2024), arXiv:2401.10321.DOI
  78. [78]Z. Ding, C.-F. Chen, and L. Lin, Single-ancilla ground state preparation via Lindbladians, Phys. Rev. Res. 6, 033147 (2024), arXiv:2308.15676.DOI
  79. [79]X. Li and C. Wang, Simulating Markovian open quantum systems using higher-order series expansion, in 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), Leibniz International Proceedings in Informatics, Vol. 261 (Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023) pp. 87:1–87:20, arXiv:2212.02051.
  80. [80]H. Chen, B. Li, J. Lu, and L. Ying, A Randomized Method for Simulating Lindblad Equations and Thermal State Preparation, Quantum 9, 1917 (2025).DOI
  81. [81]T. W. Watts, S. D. Collins, N. Nguyen, L. Quezada, M. J. Bremner, and S. J. Elman, Dissipative continuation for ground-state preparation at chemical transition states, Phys. Rev. A 114, 022471 (2026).
  82. [82]E. Campbell, Random Compiler for Fast Hamiltonian Simulation, Phys. Rev. Lett. 123, 070503 (2019).DOI
  83. [83]J. Kato, K. Wada, K. Ito, and N. Yamamoto, Exponentially accurate open quantum simulation via randomized dissipation with minimal ancilla, PRX Quantum 7, 033046 (2026).DOI
  84. [84]E. Borras and M. Marvian, Quantum simulation algorithms based on quantum trajectories, Quantum 10, 2063 (2026).DOI
  85. [85]B. Chen, M. Gao, X. Wang, and S. Zhou, Query-Optimal and Gate-Efficient Lindbladian Simulation (2026), arXiv:2609.18757.arxiv.org/abs/2609.18757
  86. [86]C. Wang and C. Ye, Query-optimal quantum simulation of Lindblad evolution (2026), arXiv:2609.17490.arxiv.org/abs/2609.17490
  87. [87]Z. Shen, Y. Wu, X. Yuan, and Y. Zhang, Shallow Quantum Circuits for Geometrically Local Lindblad Dynamics (2026), arXiv:2610.05362.arxiv.org/abs/2610.05362
  88. [88]G. Brassard, P. Høyer, M. Mosca, and A. Tapp, Quantum amplitude amplification and estimation, in Quantum Computation and Information, Contemporary Mathematics, Vol. 305 (American Mathematical Society, 2002) pp. 53–74.DOI
  89. [89]L. Lin and Y. Tong, Near-optimal ground state preparation, Quantum 4, 372 (2020).
  90. [90]Y. Ge, J. Tura, and J. I. Cirac, Faster ground state preparation and high-precision ground energy estimation with fewer qubits, J. Math. Phys. 60, 022202 (2019).arxiv.org/abs/1712.03193
  91. [91]L. J. Bond, M. J. Davis, J. M. Djăn̆r, R. Gerritsma, G. K. Brennen, and A. Safavi-Naini, Global variational quantum circuits for arbitrary symmetric state preparation, Phys. Rev. Res. 7, L022072 (2025).DOI
  92. [92]N. J. Ross and P. Selinger, Optimal ancilla-free Clifford+T approximation of z-rotations, Quantum Inf. Comput. 16, 901 (2016).arxiv.org/abs/1403.2975
  93. [93]A. Roggero and J. Carlson, Dynamic linear response quantum algorithm, Phys. Rev. C 100, 034610 (2019), arXiv:1804.01505.
  94. [94]F. J. Harris, On the use of windows for harmonic analysis with the discrete Fourier transform, Proc. IEEE 66, 51 (1978).DOI
  95. [95]C. Gidney, Halving the cost of quantum addition, Quantum 2, 74 (2018).DOI
  96. [96]G. H. Low, V. Kliuchnikov, and L. Schaeffer, Trading T gates for dirty qubits in state preparation and unitary synthesis, Quantum 8, 1375 (2024), arXiv:1812.00954.
  97. [97]T. Khattar and C. Gidney, Rise of conditionally clean ancillae for efficient quantum circuit constructions, Quantum 9, 1752 (2025), arXiv:2407.17966 [quant-ph].DOI

Paper details

vlnc:W_9a8zcgen
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 10

downloads · 2

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

AI tools

View statement
Looking for related papers…
Contents