Partonic collinear structure by quantum computing

• URL: http://arxiv.org/abs/2106.03865v2
• Date: Wed, 18 Oct 2023 02:29:58 GMT
• Title: Partonic collinear structure by quantum computing
• Authors: Tianyin Li, Xingyu Guo, Wai Kin Lai, Xiaohui Liu, Enke Wang, Hongxi Xing, Dan-Bo Zhang, Shi-Liang Zhu
• Abstract summary: We present a systematic quantum algorithm, which integrates hadronic state preparation and the evaluation of real-time light-front correlators. As a proof of concept, we demonstrate the first direct simulation of the PDFs in the 1+1 dimensional Nambu-Jona-Lasinio model. The presented quantum algorithm is expected to have many applications in high energy particle and nuclear physics.
• Score: 0.9384929040129515
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a systematic quantum algorithm, which integrates both the hadronic state preparation and the evaluation of real-time light-front correlators, to study parton distribution functions (PDFs). As a proof of concept, we demonstrate the first direct simulation of the PDFs in the 1+1 dimensional Nambu-Jona-Lasinio model. We show the results obtained by exact diagonalization and by quantum computation using classical hardware. The agreement between these two distinct methods and the qualitative consistency with QCD PDFs validate the proposed quantum algorithm. Our work suggests the encouraging prospects of calculating QCD PDFs on current and near-term quantum devices. The presented quantum algorithm is expected to have many applications in high energy particle and nuclear physics.

Related papers

• Quantum Jacobi-Davidson Method [2.6739754727815708]
  We develop and implement the Quantum Jacobi-Davidson (QJD) method and its quantum diagonalization variant, the Sample-Based Quantum Jacobi-Davidson (SBQJD) method.<n>Our results show that both QJD and SBQJD achieve significantly faster convergence and fewer Pauli measurements compared to the recently reported Quantum Davidson method.<n>These findings establish the QJD framework as an efficient general-purpose subspace-based technique for solving quantum eigenvalue problems.
  arXiv  Detail & Related papers  (2026-02-02T05:39:09Z)
• Quantum computing applications in High Energy Physics: clustering, integration and generative models [0.0]
  thesis explores the potential of quantum computing to address computational challenges in high-energy physics (HEP)<n>We develop quantum subroutines for computing Minkowski distances and identify maximum values in unsorted data, inserting them into clustering algorithms such as $k$-means and $k_T$-jet clustering.<n>We introduce a novel quantum Monte Carlo integrator, Quantum Fourier Iterative Amplitude Estimation (QFIAE), which combines a quantum neural network with amplitude estimation.
  arXiv  Detail & Related papers  (2025-12-01T12:14:56Z)
• Quantum state preparation with polynomial resources: Branched-Subspaces Adiabatic Preparation (B-SAP) [0.0]
  We introduce a hybrid algorithm that integrates the conceptual strengths of Variational Quantum Algorithms (VQAs) and Adiabatic Preparation (AP)<n>Our approach is validated on the one-dimensional XYZ Heisenberg model with periodic boundary conditions across a broad parameters range and system sizes.<n>These results highlight the accuracy, efficiency, and robustness of the proposed algorithm, which offers a compelling pathway for the actual preparation of targeted quantum states on near-term quantum devices.
  arXiv  Detail & Related papers  (2025-05-19T20:26:35Z)
• Quantum-Centric Algorithm for Sample-Based Krylov Diagonalization [0.6512657417859998]
  We introduce a quantum diagonalization algorithm which combines two key ideas on quantum subspaces. We prove that our algorithm converges under working assumptions of Krylov quantum diagonalization and sparseness of ground state. We then show numerical investigations of lattice Hamiltonians, which indicate that our method can outperform existing Krylov quantum diagonalization in presence of shot noise.
  arXiv  Detail & Related papers  (2025-01-16T17:56:19Z)
• Hybrid Quantum-Classical Clustering for Preparing a Prior Distribution of Eigenspectrum [10.950807972899575]
  We consider preparing the prior distribution and circuits for the eigenspectrum of time-independent Hamiltonians. The proposed algorithm unfolds in three strategic steps: Hamiltonian transformation, parameter representation, and classical clustering. The algorithm is showcased through applications to the 1D Heisenberg system and the LiH molecular system.
  arXiv  Detail & Related papers  (2024-06-29T14:21:55Z)
• 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)
• 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)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Improved iterative quantum algorithm for ground-state preparation [4.921552273745794]
  We propose an improved iterative quantum algorithm to prepare the ground state of a Hamiltonian system. Our approach has advantages including the higher success probability at each iteration, the measurement precision-independent sampling complexity, the lower gate complexity, and only quantum resources are required when the ancillary state is well prepared.
  arXiv  Detail & Related papers  (2022-10-16T05:57:43Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• Quantum circuits for the preparation of spin eigenfunctions on quantum computers [63.52264764099532]
  Hamiltonian symmetries are an important instrument to classify relevant many-particle wavefunctions. This work presents quantum circuits for the exact and approximate preparation of total spin eigenfunctions on quantum computers.
  arXiv  Detail & Related papers  (2022-02-19T00:21:46Z)
• Recompilation-enhanced simulation of electron-phonon dynamics on IBM Quantum computers [62.997667081978825]
  We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems. We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling. Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
  arXiv  Detail & Related papers  (2022-02-16T19:00:00Z)
• State preparation and evolution in quantum computing: a perspective from Hamiltonian moments [5.774827369850958]
  Recent efforts highlight the development of quantum algorithms based upon quantum computed Hamiltonian moments. This tutorial review focuses on the typical ways of computing Hamiltonian moments using quantum hardware and improving the accuracy of the estimated state energies.
  arXiv  Detail & Related papers  (2021-09-27T04:24:19Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
  We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
  arXiv  Detail & Related papers  (2021-03-05T08:32:43Z)
• Determining the proton content with a quantum computer [0.0]
  We present a first attempt to design a quantum circuit for the determination of the parton content of the proton through the estimation of parton distribution functions (PDFs) We show experiments about the deployment of qPDFs on real quantum devices, taking into consideration current experimental limitations.
  arXiv  Detail & Related papers  (2020-11-27T19:00:00Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)

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.