The Quantum Trellis: A classical algorithm for sampling the parton shower with interference effects

• URL: http://arxiv.org/abs/2112.12795v1
• Date: Thu, 23 Dec 2021 19:00:05 GMT
• Title: The Quantum Trellis: A classical algorithm for sampling the parton shower with interference effects
• Authors: Sebastian Macaluso, Kyle Cranmer
• Abstract summary: We present a classical algorithm called the quantum trellis to efficiently compute the un-normalized probability density over N-body phase space. This provides a potential path forward for classical computers and a strong baseline for approaches based on quantum computing.
• Score: 9.690748017851927
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Simulations of high-energy particle collisions, such as those used at the Large Hadron Collider, are based on quantum field theory; however, many approximations are made in practice. For example, the simulation of the parton shower, which gives rise to objects called `jets', is based on a semi-classical approximation that neglects various interference effects. While there is a desire to incorporate interference effects, new computational techniques are needed to cope with the exponential growth in complexity associated to quantum processes. We present a classical algorithm called the quantum trellis to efficiently compute the un-normalized probability density over N-body phase space including all interference effects, and we pair this with an MCMC-based sampling strategy. This provides a potential path forward for classical computers and a strong baseline for approaches based on quantum computing.

Related papers

• Hybrid quantum-classical approach for combinatorial problems at hadron colliders [7.2572969510173655]
  We explore the potential of quantum algorithms to resolve the problems in particle physics experiments. We consider top quark pair production in the fully hadronic channel at the Large Hadron Collider. We show that the efficiency for selecting the correct pairing is greatly improved by utilizing quantum algorithms.
  arXiv  Detail & Related papers  (2024-10-29T18:00:07Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Universal Euler-Cartan Circuits for Quantum Field Theories [0.0]
  A hybrid quantum-classical algorithm is presented for the computation of non-perturbative characteristics of quantum field theories. The algorithm relies on a universal parametrized quantum circuit ansatz based on Euler and Cartan's decompositions of single and two-qubit operators.
  arXiv  Detail & Related papers  (2024-07-31T01:59:09Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Adaptively partitioned analog quantum simulation on near-term quantum computers: The nonclassical free-induction decay of NV centers in diamond [0.24475591916185496]
  We propose an alternative analog simulation approach on near-term quantum devices. Our approach circumvents the limitations by adaptively partitioning the bath into several groups. This work sheds light on a flexible approach to simulate large-scale materials on noisy near-term quantum computers.
  arXiv  Detail & Related papers  (2023-03-03T14:39:48Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Expanding variational quantum eigensolvers to larger systems by dividing the calculations between classical and quantum hardware [0.0]
  We present a hybrid classical/quantum algorithm for efficiently solving the eigenvalue problem of many-particle Hamiltonians on quantum computers with limited resources. This algorithm reduces the needed number of qubits at the expense of an increased number of quantum evaluations.
  arXiv  Detail & Related papers  (2021-12-09T17:37:41Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Limitations of optimization algorithms on noisy quantum devices [0.0]
  We present a transparent way of comparing classical algorithms to quantum ones running on near-term quantum devices. Our approach is based on the combination of entropic inequalities that determine how fast the quantum state converges to the fixed point of the noise model.
  arXiv  Detail & Related papers  (2020-09-11T17:07:26Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)

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.