Towards few-body QCD on a quantum computer

Quantum computers are promising tools for the simulation of many-body systems, and among those, QCD stands out by its rich phenomenology. Every simulation starts with a codification, and here we succently review a newly developed compact encoding based on the identification between registers and particles; the quantum memory is divided into registers, and to each we associate a Hilbert space of dimension the number of degrees of freedom of the codified particles. In this way we gain an exponential compression over direct encodings for a low number of particles with many degrees of freedom. As an example we apply this encoding on a two-register memory and implement antisymmetrization and exponentiation algorithms.

Authors

Institutions

Publication Details

Journal
Nuclear and Particle Physics Proceedings
Published
2024-10-09
DOI
https://doi.org/10.1016/j.nuclphysbps.2024.10.001
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Towards few-body QCD on a quantum computer

Juan José Gálvez-Viruet
Nuclear and Particle Physics Proceedings
Quantum Computing Algorithms and Architecture
article

Towards few-body QCD on a quantum computer

Juan José Gálvez-Viruet
article en

Abstract

Quantum computers are promising tools for the simulation of many-body systems, and among those, QCD stands out by its rich phenomenology. Every simulation starts with a codification, and here we succently review a newly developed compact encoding based on the identification between registers and particles; the quantum memory is divided into registers, and to each we associate a Hilbert space of dimension the number of degrees of freedom of the codified particles. In this way we gain an exponential compression over direct encodings for a low number of particles with many degrees of freedom. As an example we apply this encoding on a two-register memory and implement antisymmetrization and exponentiation algorithms.

Nuclear and Particle Physics ProceedingsVol. 347
Universidad Complutense de Madrid (ES)
Ministerio de Ciencia e Innovación
Openalex Percentile: Top 85%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.