Quantum Simulation of Bound State Scattering

被引:5
作者
Turco, Matteo [1 ,2 ,3 ,6 ]
Quinta, Goncalo [7 ]
Seixas, Joao [1 ,2 ,4 ,6 ]
Omar, Yasser [1 ,2 ,5 ,6 ]
机构
[1] Ctr Fis & Engn Mat Avancados CeFEMA, Phys Informat & Quantum Technol Grp, Lisbon, Portugal
[2] Lab Phys Mat & Emergent Technol, Lisbon, Portugal
[3] Univ Lisbon, Inst Super Tecn, Lisbon, Portugal
[4] Univ Lisbon, Dept Fis, Inst Super Tecn, Lisbon, Portugal
[5] Univ Lisbon, Dept Matemat, Inst Super Tecn, Lisbon, Portugal
[6] PQI Portuguese Quantum Inst, Lisbon, Portugal
[7] Inst Telecomun, Lisbon, Portugal
来源
PRX QUANTUM | 2024年 / 5卷 / 02期
关键词
SYSTEMS;
D O I
10.1103/PRXQuantum.5.020311
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
The last few years have seen rapid development of applications of quantum computation to quantum field theory. The first algorithms for quantum simulation of scattering have been proposed in the context of scalar and fermionic theories, requiring thousands of logical qubits. These algorithms are not suitable to simulate scattering of incoming bound states, as the initial -state preparation relies typically on adiabatically transforming wavepackets of the free theory into wavepackets of the interacting theory. In this paper we present a strategy to excite wavepackets of the interacting theory directly from the vacuum of the interacting theory, allowing the preparation of states of composite particles. This is the first step towards digital quantum simulation of scattering of bound states. The approach is based on the Haag-Ruelle scattering theory, which provides a way to construct creation and annihilation operators of a theory in a full, nonperturbative framework. We provide a quantum algorithm requiring a number of ancillary qubits that is logarithmic in the size of the wavepackets, and with a success probability vanishing at most like a polynomial in the lattice parameters and the energy of the wavepacket. The gate complexity for a single iteration of the circuit is equivalent to that of a time evolution for a fixed time. Furthermore, we propose a complete protocol for scattering simulation using this algorithm. We study its efficiency and find improvements with respect to previous algorithms in the literature.
引用
收藏
页数:18
相关论文
共 85 条
[51]   Bounds for the adiabatic approximation with applications to quantum computation [J].
Jansen, Sabine ;
Ruskai, Mary-Beth ;
Seiler, Ruedi .
JOURNAL OF MATHEMATICAL PHYSICS, 2007, 48 (10)
[52]  
Jordan SP, 2014, QUANTUM INF COMPUT, V14, P1014
[53]   Quantum Algorithms for Quantum Field Theories [J].
Jordan, Stephen P. ;
Lee, Keith S. M. ;
Preskill, John .
SCIENCE, 2012, 336 (6085) :1130-1133
[54]  
Kan A., 2021, arXiv
[55]  
Kane Christopher, 2022, arXiv
[56]   Spatiotemporal dynamics of particle collisions in quantum spin chains [J].
Karpov, P., I ;
Zhu, G-Y ;
Heller, M. P. ;
Heyl, M. .
PHYSICAL REVIEW RESEARCH, 2022, 4 (03)
[57]  
Kitaev A, 2009, Arxiv, DOI arXiv:0801.0342
[58]   Systematically localizable operators for quantum simulations of quantum field theories [J].
Klco, Natalie ;
Savage, Martin J. .
PHYSICAL REVIEW A, 2020, 102 (01)
[59]   SU(2) non-Abelian gauge field theory in one dimension on digital quantum computers [J].
Klco, Natalie ;
Savage, Martin J. ;
Stryker, Jesse R. .
PHYSICAL REVIEW D, 2020, 101 (07)
[60]   Digitization of scalar fields for quantum computing [J].
Klco, Natalie ;
Savage, Martin J. .
PHYSICAL REVIEW A, 2019, 99 (05)