Optimization-based Unfolding in High-Energy Physics

• URL: http://arxiv.org/abs/2602.22776v1
• Date: Thu, 26 Feb 2026 09:11:34 GMT
• Title: Optimization-based Unfolding in High-Energy Physics
• Authors: Simone Gasperini, Gianluca Bianco, Marco Lorusso, Carla Rieger, Michele Grossi,
• Abstract summary: In High-Energy Physics, unfolding is the process of reconstructing true distributions of physical observables from detector-distorted measurements.<n>We develop a framework to tackle this problem using both classical and quantum-compatible methods.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In High-Energy Physics, unfolding is the process of reconstructing true distributions of physical observables from detector-distorted measurements. Starting from its reformulation as a regularized quadratic optimization, we develop a framework to tackle this problem using both classical and quantum-compatible methods. In particular, we derive a Quadratic Unconstrained Binary Optimization (QUBO) representation of the unfolding objective, allowing direct implementation on quantum annealing and hybrid quantum-classical solvers. The proposed approach is implemented in QUnfold, an open-source Python package integrating classical mixed-integer solvers and D-Wave's hybrid quantum solver. We benchmark the method against widely used unfolding techniques in RooUnfold, including response Matrix Inversion, Iterative Bayesian Unfolding, and Singular Value Decomposition unfolding, using synthetic dataset with controlled distortion effects. Our results demonstrate that the optimization-based approach achieves competitive reconstruction accuracy across multiple distributions while naturally accommodating regularization within the objective function. This work establishes a unified optimization perspective on unfolding and provides a practical pathway for exploring quantum-enhanced methods in experimental HEP data analysis.

Related papers

• Variational Entropic Optimal Transport [67.76725267984578]
  We propose Variational Entropic Optimal Transport (VarEOT) for domain translation problems.<n>VarEOT is based on an exact variational reformulation of the log-partition $log mathbbE[exp(cdot)$ as a tractable generalization over an auxiliary positive normalizer.<n> Experiments on synthetic data and unpaired image-to-image translation demonstrate competitive or improved translation quality.
  arXiv  Detail & Related papers  (2026-02-02T15:48:44Z)
• A Lyapunov Framework for Quantum Algorithm Design in Combinatorial Optimization with Approximation Ratio Guarantees [15.259020859762556]
  We develop a framework aiming at designing quantum algorithms for optimization problems.<n>We provide theoretical guarantees on their approximation ratios.<n>We apply our framework to Max-Cut problem, implementing it as an adaptive variational quantum algorithm.
  arXiv  Detail & Related papers  (2025-12-25T15:38:24Z)
• Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming [47.98440449939344]
  Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability.<n>This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA) and alternating optimization to address the problem of b-bit quantized phase shifters both at the transmitter and the receiver.<n>We demonstrate that the structure of this quantized beamforming problem aligns naturally with hybrid-classical methods like QAOA, as the phase shifts used in beamforming can be directly mapped to rotation gates in a quantum circuit.
  arXiv  Detail & Related papers  (2025-10-07T17:53:02Z)
• Neural Optimal Transport Meets Multivariate Conformal Prediction [58.43397908730771]
  We propose a framework for conditional vectorile regression (CVQR)<n>CVQR combines neural optimal transport with quantized optimization, and apply it to predictions.
  arXiv  Detail & Related papers  (2025-09-29T19:50:19Z)
• Quantum Approximate and Quantum Walk Optimization Approaches to Set Balancing [0.0]
  We explore the application of variational quantum algorithms to the NP-hard set balancing problem.<n>The problem is mapped to an Ising model, with tailored Quadratic Unconstrained Binary Optimization (QUBO) formulations and cost Hamiltonians expressed in Pauli-Z form.<n>For QAOA, we perform a comparative analysis of six mixer Hamiltonians (X, XY, Full-SWAP, Ring-SWAP, Grover, and Warm-Started), employing scaled-exponential Pauli-string realizations of the mixer unitaries.<n>We introduce a Shannon-entropy-based post
  arXiv  Detail & Related papers  (2025-09-08T20:31:30Z)
• Optimizing Unitary Coupled Cluster Wave Functions on Quantum Hardware: Error Bound and Resource-Efficient Optimizer [0.0]
  We study the projective quantum eigensolver (PQE) approach to optimizing unitary coupled cluster wave functions on quantum hardware.<n>We derive a bound relating off-diagonal coefficients (residues) of the Hamiltonian to the energy error of the algorithm and the overlap achieved by the obtained wavefunction.
  arXiv  Detail & Related papers  (2024-10-19T15:03:59Z)
• Quantum algorithms for the variational optimization of correlated electronic states with stochastic reconfiguration and the linear method [0.0]
  We present quantum algorithms for the variational optimization of wavefunctions correlated by products of unitary operators. While an implementation on classical computing hardware would require exponentially growing compute cost, the cost (number of circuits and shots) of our quantum algorithms is in system size.
  arXiv  Detail & Related papers  (2024-08-03T17:53:35Z)
• A Deep Unrolling Model with Hybrid Optimization Structure for Hyperspectral Image Deconvolution [50.13564338607482]
  We propose a novel optimization framework for the hyperspectral deconvolution problem, called DeepMix.<n>It consists of three distinct modules, namely, a data consistency module, a module that enforces the effect of the handcrafted regularizers, and a denoising module.<n>This work proposes a context aware denoising module designed to sustain the advancements achieved by the cooperative efforts of the other modules.
  arXiv  Detail & Related papers  (2023-06-10T08:25:16Z)
• A real world test of Portfolio Optimization with Quantum Annealing [0.0]
  We describe an experiment on portfolio optimization using the Quadratic Unconstrained Binary Optimization (QUBO) formulation. We find satisfactory results, consistent with the global optimum obtained by the exact classical strategy. Since the tuning of QUBO parameters is crucial for the optimization, we investigate a hybrid method that allows for automatic tuning.
  arXiv  Detail & Related papers  (2023-03-22T14:38:13Z)
• Direct Optimal Control Approach to Laser-Driven Quantum Particle Dynamics [77.34726150561087]
  We propose direct optimal control as a robust and flexible alternative to indirect control theory. The method is illustrated for the case of laser-driven wavepacket dynamics in a bistable potential.
  arXiv  Detail & Related papers  (2020-10-08T07:59:29Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Cross Entropy Hyperparameter Optimization for Constrained Problem Hamiltonians Applied to QAOA [68.11912614360878]
  Hybrid quantum-classical algorithms such as Quantum Approximate Optimization Algorithm (QAOA) are considered as one of the most encouraging approaches for taking advantage of near-term quantum computers in practical applications. Such algorithms are usually implemented in a variational form, combining a classical optimization method with a quantum machine to find good solutions to an optimization problem. In this study we apply a Cross-Entropy method to shape this landscape, which allows the classical parameter to find better parameters more easily and hence results in an improved performance.
  arXiv  Detail & Related papers  (2020-03-11T13:52:41Z)

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.