Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2409.06403 · Nuclear and Particle Physics Proceedings

Towards few-body QCD on a quantum computer

Juan José Gálvez-Viruet

Published Oct 9, 2024• 0 citations
arXivHTMLPDF

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.

DOI
10.1016/j.nuclphysbps.2024.10.001

Related papers

Dynamical implementation of canonical second quantization on a quantum computer

Juan José Gálvez-Viruet, Felipe J. Llanes–Estrada

We develop theoretical methods for the implementation of creation and destruction operators in separate registers of a quantum computer, allowing for a transparent and dynamical creation and destruction of particle modes in second quantization in problems with variable particle number. We establish theorems for the commutation (anticommutation) relations on a finite memory bank and provide the needed symmetrizing and antisymmetrizing operators. Finally, we provide formulas in terms of these operators for unitary evolution under conventional two- and four-body Hamiltonian terms, as well as terms varying the particle number. In this formalism, the number of qubits needed to codify n particles with N p modes each is of order O ( n log 2 N p ) . Such scaling is more efficient than the Jordan-Wigner transformation which requires O ( N p ) qubits, whenever there are a modest number of particles with a large number of states available to each (and less advantageous for a large number of particles with few states available to each). Published by the American Physical Society 2024

arXiv:2406.03147•Physical review. D/Physical review. D.•Dec 19, 2024•7 citations

Putting fermions onto a digital quantum computer

Riley W. Chien, Mitchell L. Chiew, Brent Harrison +8 more

Quantum computers are expected to become a powerful tool for studying physical quantum systems. Consequently, a number of quantum algorithms for studying the physical properties of such systems have been developed. While qubit-based quantum computers are naturally suited to the study of spin-1/2 systems, systems containing other degrees of freedom must first be encoded into qubits. Transformations to and from fermionic degrees of freedom have long been an important tool in physics and, now the simulation of fermionic systems on quantum computers based on qubits provides yet another application. In this perspective, we review methods for encoding fermionic degrees of freedom into qubits and attempt to dispel the persistent notion that fermionic systems beyond one dimension are fundamentally more difficult to deal with.

quant-pharXiv:2602.07151•Nature Reviews Physics•Feb 10, 2026•5 citations

Simulation of quantum many body systems

Maarten Van den Nest, Frank Verstraete

The study of quantum computations that can be simulated efficiently classically is of interest for numerous reasons. On a fundamental level, such an investigation sheds light on the intrinsic computational power that is harnessed in quantum mechanics as compared to classical physics. More practically, understanding which quantum computations do not offer any speed-ups over classical computation provides insights in where (not) to look for novel quantum algorithmic primitives. On the other hand, classical simulation of many-body systems is a challenging task, as the dimension of the Hilbert space scales with the number of particles. Therefore, to understand the properties of the systems, suitable approximation methods need to be employed. The lectures will be divided into two parts. In the first part we discuss classical simulation of quantum computation from several perspectives. We review a number of well-known examples of classically simulatable quantum computations, such as the Gottesman-Knill theorem, matchgate simulation and tensor contraction methods. We further discuss simulation methods that are centred on classical sampling methods (‘weak simulation’), and illustrate how these techniques outperform methods that rely on the exact computation of measurement probabilities (‘strong simulation’). The second part focuses on "Entanglement and variational wavefunctions in quantum many body physics". We review the idea of entanglement in quantum many-body systems and how it helps us to understand the success of numerical renormalization group methods. In particular we will discuss a few variational wave-function based methods for simulating strongly correlated quantum systems, which include (1) matrix product states (2) multiscale entanglement renormalization ansatz (3) projected entangled pair states and (4) continuous matrix product states for quantum field theories.

•Jul 20, 2010•0 citations

Quantum system compression: A Hamiltonian guided walk through Hilbert space

Robert L. Kosut, Tak‐San Ho, HERSCHEL A. RABITZ

We present a systematic study of quantum system compression for the evolution of generic many-body problems. The necessary numerical simulations of such systems are seriously hindered by the exponential growth of the Hilbert-space dimension with the number of particles. For a constant Hamiltonian system of Hilbert-space dimension $n$ with frequencies ranging from ${f}_{min}$ to ${f}_{max}$, we show via a proper orthogonal decomposition that for a run time $T$ the dominant dynamics are compressed in the neighborhood of a subspace whose dimension is the smallest integer larger than the time-bandwidth product $\mathrm{\ensuremath{\Delta}}=({f}_{max}\ensuremath{-}{f}_{min})T$. We also show how the distribution of initial states can further compress the system dimension. Under the stated conditions, the time-bandwidth estimate reveals the existence of an effective compressed model whose dimension is derived solely from system properties and not dependent on the particular implementation of a variational simulator, such as a machine learning system, or quantum device, or possibly even specially adapting traditional methods of solving the time-dependent Schr\"odinger equation. However, finding an efficient solution procedure $\mathit{is}$ dependent on the simulator implementation, which is not discussed in this paper. In addition, we show that the compression rendered by the proper orthogonal decomposition encoding method can be further strengthened via a multilayer autoencoder. Finally, we present numerical illustrations to affirm the compression behavior in time-varying Hamiltonian dynamics in the presence of external fields. The essential time-bandwidth product is also simply estimated for a wide class of physical systems, where typically localized high-frequency motion occurs at or around each of the many particles, and with low-frequency dynamics associated with globally distributed characteristic degrees of freedom. This estimate for the bandwidth has a generic character indicating the wide significance of expected quantum system dynamics compression. We also discuss the potential implications of the findings for machine learning tools to efficiently solve the many-body or other high-dimensional Schr\"odinger equations.

arXiv:2006.13498•Physical Review A•Jan 12, 2021•5 citations

Overview of Applications of Quantum Computing in QCD

Germán Rodrigo

Quantum computing has emerged as a promising framework for addressing computationally demanding problems in collider physics. In recent years, a growing number of quantum algorithms have been proposed for applications ranging from event generation and parton shower simulation to the evaluation of scattering amplitudes, loop and phase-space integration, and optimization problems relevant to experimental analysis. We provide a concise overview of the main ideas behind these developments, with emphasis on the potential advantages of quantum approaches in comparison with classical methods, as well as on the current limitations imposed by noisy intermediate-scale quantum hardware.

hep-phCross-listedarXiv:2607.08169•Jul 10, 2026•0 citations

Quantum simulation of the single-particle Schrödinger equation

Giuliano Benenti, G. Strini

The nature of a quantum computer is described in the concrete context of a quantum simulator of the single-particle Schrödinger equation. We show that a register of 6–10 qubits is sufficient to realize a useful quantum simulator capable of efficiently solving standard quantum mechanical problems.

arXiv:0709.1704•American Journal of Physics•Jun 10, 2008•100 citations
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.
We develop theoretical methods for the implementation of creation and destruction operators in separate registers of a quantum computer, allowing for a transparent and dynamical creation and destruction of particle modes in second quantization in problems with variable particle number. We establish theorems for the commutation (anticommutation) relations on a finite memory bank and provide the needed symmetrizing and antisymmetrizing operators. Finally, we provide formulas in terms of these operators for unitary evolution under conventional two- and four-body Hamiltonian terms, as well as terms varying the particle number. In this formalism, the number of qubits needed to codify n particles with N p modes each is of order O ( n log 2 N p ) . Such scaling is more efficient than the Jordan-Wigner transformation which requires O ( N p ) qubits, whenever there are a modest number of particles with a large number of states available to each (and less advantageous for a large number of particles with few states available to each). Published by the American Physical Society 2024
Quantum computers are expected to become a powerful tool for studying physical quantum systems. Consequently, a number of quantum algorithms for studying the physical properties of such systems have been developed. While qubit-based quantum computers are naturally suited to the study of spin-1/2 systems, systems containing other degrees of freedom must first be encoded into qubits. Transformations to and from fermionic degrees of freedom have long been an important tool in physics and, now the simulation of fermionic systems on quantum computers based on qubits provides yet another application. In this perspective, we review methods for encoding fermionic degrees of freedom into qubits and attempt to dispel the persistent notion that fermionic systems beyond one dimension are fundamentally more difficult to deal with.
The study of quantum computations that can be simulated efficiently classically is of interest for numerous reasons. On a fundamental level, such an investigation sheds light on the intrinsic computational power that is harnessed in quantum mechanics as compared to classical physics. More practically, understanding which quantum computations do not offer any speed-ups over classical computation provides insights in where (not) to look for novel quantum algorithmic primitives. On the other hand, classical simulation of many-body systems is a challenging task, as the dimension of the Hilbert space scales with the number of particles. Therefore, to understand the properties of the systems, suitable approximation methods need to be employed. The lectures will be divided into two parts. In the first part we discuss classical simulation of quantum computation from several perspectives. We review a number of well-known examples of classically simulatable quantum computations, such as the Gottesman-Knill theorem, matchgate simulation and tensor contraction methods. We further discuss simulation methods that are centred on classical sampling methods (‘weak simulation’), and illustrate how these techniques outperform methods that rely on the exact computation of measurement probabilities (‘strong simulation’). The second part focuses on "Entanglement and variational wavefunctions in quantum many body physics". We review the idea of entanglement in quantum many-body systems and how it helps us to understand the success of numerical renormalization group methods. In particular we will discuss a few variational wave-function based methods for simulating strongly correlated quantum systems, which include (1) matrix product states (2) multiscale entanglement renormalization ansatz (3) projected entangled pair states and (4) continuous matrix product states for quantum field theories.
We present a systematic study of quantum system compression for the evolution of generic many-body problems. The necessary numerical simulations of such systems are seriously hindered by the exponential growth of the Hilbert-space dimension with the number of particles. For a constant Hamiltonian system of Hilbert-space dimension nnn with frequencies ranging from fmin{f}_{min}fmin​ to fmax{f}_{max}fmax​, we show via a proper orthogonal decomposition that for a run time TTT the dominant dynamics are compressed in the neighborhood of a subspace whose dimension is the smallest integer larger than the time-bandwidth product $\mathrm{\ensuremath{\Delta}}=({f}_{max}\ensuremath{-}{f}_{min})T$. We also show how the distribution of initial states can further compress the system dimension. Under the stated conditions, the time-bandwidth estimate reveals the existence of an effective compressed model whose dimension is derived solely from system properties and not dependent on the particular implementation of a variational simulator, such as a machine learning system, or quantum device, or possibly even specially adapting traditional methods of solving the time-dependent Schr\"odinger equation. However, finding an efficient solution procedure is\mathit{is}is dependent on the simulator implementation, which is not discussed in this paper. In addition, we show that the compression rendered by the proper orthogonal decomposition encoding method can be further strengthened via a multilayer autoencoder. Finally, we present numerical illustrations to affirm the compression behavior in time-varying Hamiltonian dynamics in the presence of external fields. The essential time-bandwidth product is also simply estimated for a wide class of physical systems, where typically localized high-frequency motion occurs at or around each of the many particles, and with low-frequency dynamics associated with globally distributed characteristic degrees of freedom. This estimate for the bandwidth has a generic character indicating the wide significance of expected quantum system dynamics compression. We also discuss the potential implications of the findings for machine learning tools to efficiently solve the many-body or other high-dimensional Schr\"odinger equations.
Quantum computing has emerged as a promising framework for addressing computationally demanding problems in collider physics. In recent years, a growing number of quantum algorithms have been proposed for applications ranging from event generation and parton shower simulation to the evaluation of scattering amplitudes, loop and phase-space integration, and optimization problems relevant to experimental analysis. We provide a concise overview of the main ideas behind these developments, with emphasis on the potential advantages of quantum approaches in comparison with classical methods, as well as on the current limitations imposed by noisy intermediate-scale quantum hardware.