Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.13546 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914041464619008 |
|---|---|
| author | Nguyen, Nam Yu, Michael Robertson, Alan Nishimura, Hiromichi Elman, Samuel J. Koltenbah, Benjamin |
| author_facet | Nguyen, Nam Yu, Michael Robertson, Alan Nishimura, Hiromichi Elman, Samuel J. Koltenbah, Benjamin |
| contents | The extended Jaynes-Cummings model (eJCM) is a foundational framework for describing multi-mode light-matter interactions, with direct applications in quantum technologies such as photon addition and quasi-noiseless amplification. However, the model's complexity makes classical simulation intractable for large systems that could be of practical interest. In this work, we present a comprehensive, end-to-end framework for the quantum simulation of the eJCM. We develop explicit quantum algorithms and circuits for simulating the system's time evolution using first and second-order product formulas, analyzing the dynamics in both the Schrodinger and interaction pictures. Our analysis includes rigorous, closed-form error bounds that guide the choice of simulation parameters, and we extend the methodology to efficiently handle both pure and mixed quantum states. Furthermore, we validate our theoretical cost models with numerical simulations and provide a detailed fault-tolerant resource analysis, compiling the simulation circuits for a surface-code architecture to yield concrete estimates for physical qubit counts and execution times. This work establishes a complete roadmap for simulating the eJCM on future quantum computers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_13546 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | End-to-End Complexity Analysis for Quantum Simulation of the Extended Jaynes-Cummings Models Nguyen, Nam Yu, Michael Robertson, Alan Nishimura, Hiromichi Elman, Samuel J. Koltenbah, Benjamin Quantum Physics The extended Jaynes-Cummings model (eJCM) is a foundational framework for describing multi-mode light-matter interactions, with direct applications in quantum technologies such as photon addition and quasi-noiseless amplification. However, the model's complexity makes classical simulation intractable for large systems that could be of practical interest. In this work, we present a comprehensive, end-to-end framework for the quantum simulation of the eJCM. We develop explicit quantum algorithms and circuits for simulating the system's time evolution using first and second-order product formulas, analyzing the dynamics in both the Schrodinger and interaction pictures. Our analysis includes rigorous, closed-form error bounds that guide the choice of simulation parameters, and we extend the methodology to efficiently handle both pure and mixed quantum states. Furthermore, we validate our theoretical cost models with numerical simulations and provide a detailed fault-tolerant resource analysis, compiling the simulation circuits for a surface-code architecture to yield concrete estimates for physical qubit counts and execution times. This work establishes a complete roadmap for simulating the eJCM on future quantum computers. |
| title | End-to-End Complexity Analysis for Quantum Simulation of the Extended Jaynes-Cummings Models |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2509.13546 |