Unfolding as Quantum Annealing

Abstract

High-energy physics is replete with hard computational problems and it is one of the areas where quantum computing could be used to speed up calculations. We present an implementation of likelihood-based regularized unfolding on a quantum computer. The inverse problem is recast in terms of quadratic unconstrained binary optimization (QUBO), which has the same form of the Ising hamiltonian and hence it is solvable on a programmable quantum annealer. We tested the method using a model that captures the essence of the problem, and compared the results with a baseline method commonly used in precision measurements at the Large Hadron Collider (LHC) at CERN. The unfolded distribution is in very good agreement with the original one. We also show how the method can be extended to include the effect of nuisance parameters representing sources of systematic uncertainties affecting the measurement.

arXiv comment8 pages, 5 figures, the source code is available at https://github.com/rdisipio/quantum_unfolding

References in corpus (9)

• Quantum Computing in the NISQ era and beyond
• A Brief Introduction to PYTHIA 8.1
• A variational eigenvalue solver on a quantum processor
• DELPHES 3, A modular framework for fast simulation of a generic collider experiment
• Herwig 7.0 / Herwig++ 3.0 Release Note
• What is the Computational Value of Finite Range Tunneling?
• TUnfold: an algorithm for correcting migration effects in high energy physics
• A deceptive step towards quantum speedup detection
• FLUKA as a new high energy cosmic ray generator

Cited by in corpus (5)

• Prospects for Quantum Enhancement with Diabatic Quantum Annealing
• Quantum Machine Learning in High Energy Physics
• Event Classification with Quantum Machine Learning in High-Energy Physics
• Initial-State Dependent Optimization of Controlled Gate Operations with Quantum Computer
• Quantum Gate Pattern Recognition and Circuit Optimization for Scientific Applications