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

XRDS Crossroads The ACM Magazine for Students

Simulation of a computer architecture for quantum chromodynamics calculations

Sadaf R. Alam, Roland N. Ibbett, Frédéric Mallet

Published Mar 1, 2003• 1 citation
Publisher

Abstract

The study of Quantum Chromodynamics (QCD), a branch of Particle Physics, is considered a Grand Challenge application [2]; a Grand Challenge is a fundamental problem in science and engineering, with broad applications, whose solution would be enabled by the application of high performance computing resources [1]. Commercial and custom-built highperformance

DOI
10.1145/904073.904078

Related papers

Quantum algorithms for the simulation of QCD processes in the perturbative regime

Herschel A. Chawdhry, Mathieu Pellen

Theoretical predictions for high-energy collision processes at particle colliders, such as the Large Hadron Collider (LHC), rely on calculations in perturbative Quantum Chromodynamics (QCD), which are often computationally challenging. In these conference proceedings, we explore the possibility of using quantum computers to simulate QCD processes in the perturbative QCD regime. In particular, as a first step towards that goal, we present quantum circuits to simulate the colour part of perturbative QCD. The circuits are validated by implementing them on a simulated quantum computer and verifying the colour factors for several example Feynman diagrams.

arXiv:2412.21177•Dec 30, 2024•1 citation

Quantum simulation of quantum field theory in the light-front formulation

Michael Kreshchuk, William M. Kirby, Gary R. Goldstein +2 more

Quantum chromodynamics (QCD) describes the structure of hadrons such as the proton at a fundamental level. The precision of calculations in QCD limits the precision of the values of many physical parameters extracted from collider data. For example, uncertainty in the parton distribution function is the dominant source of error in the $W$ mass measurement at the Large Hadron Collider. Improving the precision of such measurements is essential in the search for new physics. Quantum simulation offers an efficient way of studying quantum field theories (QFTs) such as QCD nonperturbatively. Previous quantum algorithms for simulating QFTs have qubit requirements that are well beyond the most ambitious experimental proposals for large-scale quantum computers. Can the qubit requirements for such algorithms be brought into range of quantum computation with several thousand logical qubits? We show how this can be achieved by using the light-front formulation of quantum field theory. This work was inspired by the similarity of the light-front formulation to quantum chemistry, first noted by Wilson [Nucl. Phys. B, Proc. Suppl. 17, 82 (1990)].

arXiv:2002.04016•Physical Review A•Mar 8, 2022•134 citations

Simulating Quantum Systems in Biology, Chemistry, and Physics

Andrew G. White

In principle, it is possible to model any physical system exactly using quantum mechanics; in practice, it quickly becomes infeasible. Recognising this, Richard Feynman suggested that quantum systems be used to model quantum problems [1]. For example, the fundamental problem faced in quantum chemistry is the calculation of molecular properties, which are of practical importance in fields ranging from materials science to biochemistry. Within chemical precision, the total energy of a molecule as well as most other properties, can be calculated by solving the Schrödinger equation. However, the computational resources required to obtain exact solutions on a conventional computer generally increase exponentially with the number of atoms involved [1, 2]. In the late 1990’s an efficient algorithm was proposed to enable a quantum processor to calculate molecular energies using resources that increase only polynomially in the molecular size [2–4]. Despite the many different physical architectures that have been explored experimentally since that time—including ions, atoms, superconducting circuits, and photons—this appealing algorithm has not been demonstrated to date.

International Conference on Quantum Information•Jan 1, 2011•0 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 algorithms for the simulation of perturbative QCD processes

Herschel A. Chawdhry, Mathieu Pellen

Quantum computers are expected to give major speed-ups for the simulation of quantum systems. In these conference proceedings, we discuss quantum algorithms for the simulation of perturbative Quantum Chromodynamics (QCD) processes. In particular, we describe quantum circuits for simulating the colour part of the interactions of quarks and gluons. We implement our circuits on a simulated noiseless quantum computer and validate them by calculating colour factors for various examples of Feynman diagrams.

arXiv:2309.06182•International Symposium on Radiative Corrections (RADCOR)•Sep 15, 2023•3 citations

Quantum computer used for high-energy physics simulation

Physics Today•Jun 23, 2016•0 citations
The study of Quantum Chromodynamics (QCD), a branch of Particle Physics, is considered a Grand Challenge application [2]; a Grand Challenge is a fundamental problem in science and engineering, with broad applications, whose solution would be enabled by the application of high performance computing resources [1]. Commercial and custom-built highperformance
Theoretical predictions for high-energy collision processes at particle colliders, such as the Large Hadron Collider (LHC), rely on calculations in perturbative Quantum Chromodynamics (QCD), which are often computationally challenging. In these conference proceedings, we explore the possibility of using quantum computers to simulate QCD processes in the perturbative QCD regime. In particular, as a first step towards that goal, we present quantum circuits to simulate the colour part of perturbative QCD. The circuits are validated by implementing them on a simulated quantum computer and verifying the colour factors for several example Feynman diagrams.
Quantum chromodynamics (QCD) describes the structure of hadrons such as the proton at a fundamental level. The precision of calculations in QCD limits the precision of the values of many physical parameters extracted from collider data. For example, uncertainty in the parton distribution function is the dominant source of error in the WWW mass measurement at the Large Hadron Collider. Improving the precision of such measurements is essential in the search for new physics. Quantum simulation offers an efficient way of studying quantum field theories (QFTs) such as QCD nonperturbatively. Previous quantum algorithms for simulating QFTs have qubit requirements that are well beyond the most ambitious experimental proposals for large-scale quantum computers. Can the qubit requirements for such algorithms be brought into range of quantum computation with several thousand logical qubits? We show how this can be achieved by using the light-front formulation of quantum field theory. This work was inspired by the similarity of the light-front formulation to quantum chemistry, first noted by Wilson [Nucl. Phys. B, Proc. Suppl. 17, 82 (1990)].
In principle, it is possible to model any physical system exactly using quantum mechanics; in practice, it quickly becomes infeasible. Recognising this, Richard Feynman suggested that quantum systems be used to model quantum problems [1]. For example, the fundamental problem faced in quantum chemistry is the calculation of molecular properties, which are of practical importance in fields ranging from materials science to biochemistry. Within chemical precision, the total energy of a molecule as well as most other properties, can be calculated by solving the Schrödinger equation. However, the computational resources required to obtain exact solutions on a conventional computer generally increase exponentially with the number of atoms involved [1, 2]. In the late 1990’s an efficient algorithm was proposed to enable a quantum processor to calculate molecular energies using resources that increase only polynomially in the molecular size [2–4]. Despite the many different physical architectures that have been explored experimentally since that time—including ions, atoms, superconducting circuits, and photons—this appealing algorithm has not been demonstrated to date.
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.
Quantum computers are expected to give major speed-ups for the simulation of quantum systems. In these conference proceedings, we discuss quantum algorithms for the simulation of perturbative Quantum Chromodynamics (QCD) processes. In particular, we describe quantum circuits for simulating the colour part of the interactions of quarks and gluons. We implement our circuits on a simulated noiseless quantum computer and validate them by calculating colour factors for various examples of Feynman diagrams.