8 papers
Efficient Quantum Simulations of Yang-Mills theory with Maximal-tree Gauge
Tianyin Li, Ying-Ying Li, Xiaoyang Wang +1
We develop a quantum algorithmic framework for the efficient simulation of Yang--Mills theories, including the gauge theory in Quantum Chromodynamics (QCD). The fr…
Quantum Simulation of Generalized Parton Distributions in the Schwinger Model
Tianyin Li, Hongxi Xing
We present a quantum algorithm for simulating Generalized Parton Distributions (GPDs) in the Schwinger model. Unlike the staggered fermions widely utilized in current quantum simul…
A Three-Layer Architecture for Fault-Tolerant Quantum Computing
Zhirao Wang, Zhou You, Yiming Huang +4
Fault tolerance is an indispensable prerequisite for constructing large-scale universal quantum computers. Drawing philosophies from classical computer architecture, this paper pre…
Hadronic tensor in lattice gauge theories by quantum computing
Dairui Zou, Tianyin Li, Jian Liang +2
The hadronic tensor encodes crucial information regarding the internal structure of hadrons, reflecting the non-perturbative features of quantum chromodynamics (QCD). In this work,…
A typology of quantum algorithms
Pablo Arnault, Pablo Arrighi, Steven Herbert +2
We draw the current landscape of quantum algorithms, by classifying about 130 quantum algorithms, according to the fundamental mathematical problems they solve, their real-world ap…
Simulating Parton Fragmentation on Quantum Computers
Tianyin Li, Hongxi Xing, Dan-Bo Zhang
Parton fragmentation functions (FFs) are indispensable for understanding processes of hadron production ubiquitously existing in high-energy collisions, but their first principle d…