First-principle predictions of fragmentation functions via quantum computing

• URL: http://arxiv.org/abs/2608.30375v1
• Date: Mon, 31 Aug 2026 07:31:03 GMT
• Title: First-principle predictions of fragmentation functions via quantum computing
• Abstract summary: We report on an algorithm to compute fragmentation functions from the first principles Quantum Chromodynamics (QCD) Hamiltonian quantized in Light-Front Gauge.<n>We run a demonstration of a heavy-quark leading parton fragmenting into quarkonium, which we benchmark against NRQCD computations.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We report on an algorithm to compute fragmentation functions from the first principles Quantum Chromodynamics (QCD) Hamiltonian quantized in Light-Front Gauge, opening a path for digital quantum computers to calculate these longitudinal jet-structure observables. Simulating the behaviour of such computers on a classical cluster (which is memory-limited to about 30 qubits, given the expansive Hilbert spaces of actual quantum computers), we run a demonstration of a heavy-quark leading parton fragmenting into quarkonium, which we benchmark against NRQCD computations. Future quantum computers, perhaps concurrently running with HL-LHC, would have ample opportunity to extract arbitrary parton-hadron combinations.

Related papers

• Parallel iQCC Enables 200 Qubit Scale Quantum Chemistry on Accelerated Computing Platforms Surpassing Classical Benchmarks in Ruthenium Catalysts [0.0]
  We introduce a parallel, GPU-accelerated implementation of the iterative qubit cluster (iQCC)<n>We achieve speedups exceeding two orders of magnitude over the serial CPU approach.
  arXiv  Detail & Related papers  (2026-03-09T19:49:37Z)
• Expressivity Limits of Quantum Reservoir Computing [0.0]
  We establish a formal connection to parametrized quantum circuit quantum machine learning (PQC-QML)<n>We analytically prove, and numerically corroborate, that in QRC the number of non-linear functions that can be generated from classical data is bounded linearly by the number of input encoding gates.<n>Our results challenge the common assumption that exponential Hilbert space scaling confers a corresponding computational advantage in QRC.
  arXiv  Detail & Related papers  (2025-01-26T13:43:03Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Diagonalization of large many-body Hamiltonians on a quantum processor [28.65071920454694]
  We use a superconducting quantum processor to compute eigenenergies of quantum many-body systems on two-dimensional lattices of up to 56 sites. We construct subspaces of the many-body Hilbert space using Trotterized unitary evolutions executed on the quantum processor.
  arXiv  Detail & Related papers  (2024-07-19T16:02:03Z)
• Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers [37.69303106863453]
  We propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers. Our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28% and 57% on average.
  arXiv  Detail & Related papers  (2024-06-17T14:10:10Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• An occupation number quantum subspace expansion approach to compute the single-particle Green function: an opportunity for noise filtering [0.0]
  We introduce a hybrid quantum-classical algorithm to compute the Green function for strongly correlated electrons on noisy quantum devices. The technique allows for noise filtering, a useful feature for NISQ devices.
  arXiv  Detail & Related papers  (2023-12-21T00:21:17Z)
• Demonstrating Quantum Computation for Quasiparticle Band Structures [0.0]
  We demonstrate the first-principles calculation of a quasiparticle band structure on actual quantum computers. This is achieved by hybrid quantum-classical algorithms in conjunction with qubit-reduction and error-mitigation techniques.
  arXiv  Detail & Related papers  (2023-07-27T03:45:05Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Cutting Quantum Circuits to Run on Quantum and Classical Platforms [25.18520278107402]
  CutQC is a scalable hybrid computing approach that distributes a large quantum circuit onto quantum (QPU) and classical platforms ( CPU or GPU) for co-processing. It achieves much higher quantum circuit evaluation fidelity than the large NISQ devices achieve in real-system runs.
  arXiv  Detail & Related papers  (2022-05-12T02:09:38Z)
• Reducing Unitary Coupled Cluster Circuit Depth by Classical Stochastic Amplitude Pre-Screening [0.0]
  Unitary Coupled Cluster (UCC) approaches are an appealing route to utilising quantum hardware to perform quantum chemistry calculations. We present a combined classical-quantum approach where a classical UCC pre-processing step is used to determine the important excitations in the UCC ansatz.
  arXiv  Detail & Related papers  (2021-08-24T18:34:14Z)
• Full-Dimensional Schr\"odinger Wavefunction Calculations using Tensors and Quantum Computers: the Cartesian component-separated approach [0.0]
  We explore a radically different approach, based on separability by Cartesian component, rather than by particle. The approach appears to be very well suited for 3D grid-based methods in quantum chemistry. We present an implementation for quantum computers, for which both the number of qubits, and the number of quantum gates, may be substantially reduced.
  arXiv  Detail & Related papers  (2021-05-08T21:54:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.