Searcharxiv⌕ Search

arXiv subjects

Michele Grossi

Publications and source records attributed to Michele Grossi.

At least 37 records · Page 2Linked to original sources

Sample-based training of quantum generative models

Quantum computers can efficiently sample from probability distributions that are believed to be classically intractable, providing a foundation for quantum generative modeling. However, practical training of such models remains challenging, as gradient evaluation via the parameter-shift rule scales linearly with the number of parameters and requires repeated expectation-value estimation under finite-shot noise. We introduce a training framework that extends the principle of contrastive divergence to quantum models. By deriving the circuit structure and providing a general recipe for constructing it, we obtain quantum circuits that generate the samples required for parameter updates, yielding constant scaling with respect to the cost of a forward pass, analogous to backpropagation in classical neural networks. Numerical results demonstrate that it attains comparable accuracy to likelihood-based optimization while requiring substantially fewer samples. The framework thereby establishes a scalable route to training expressive quantum generative models directly on quantum hardware.

quant-ph↗

Qiboml: towards the orchestration of quantum-classical machine learning

We present Qiboml, an open-source software library for orchestrating quantum and classical components in hybrid machine learning workflows. Building on Qibo's quantum computing capabilities and integrating with popular machine learning frameworks such as TensorFlow and PyTorch, Qiboml enables the construction of quantum and hybrid models that can run on a broad range of backends: (i) multi-threaded CPUs, GPUs, and multi-GPU systems for simulation with statevector or tensor network methods; (ii) quantum processing units, both on-premise and through cloud providers. In this paper, we showcase its functionalities, including diverse simulation options, noise-aware simulations, and real-time error mitigation and calibration.

quant-ph↗

Quantum Information meets High-Energy Physics: Input to the update of the European Strategy for Particle Physics

Some of the most astonishing and prominent properties of Quantum Mechanics, such as entanglement and Bell nonlocality, have only been studied extensively in dedicated low-energy laboratory setups. The feasibility of these studies in the high-energy regime explored by particle colliders was only recently shown and has gathered the attention of the scientific community. For the range of particles and fundamental interactions involved, particle colliders provide a novel environment where quantum information theory can be probed, with energies exceeding by about 12 orders of magnitude those employed in dedicated laboratory setups. Furthermore, collider detectors have inherent advantages in performing certain quantum information measurements, and allow for the reconstruction of the state of the system under consideration via quantum state tomography. Here, we elaborate on the potential, challenges, and goals of this innovative and rapidly evolving line of research and discuss its expected impact on both quantum information theory and high-energy physics.

hep-ph↗

Z-boson quantum tomography at next-to-leading order

We investigate the origin of the unusually large electroweak (EW) radiative effects observed in the extraction of the spin-density matrix and related observables at colliders, focusing on leptonic Z-boson decays. We compute the Z-boson-decay spin-density matrix at next-to-leading order (NLO) and find that, while its analytic structure remains essentially unchanged with respect to leading order, the EW corrections induce a sizeable $-35\%$ shift in the spin-analysing-power parameter $η_\ell$. This effect alone accounts for the striking size of the corrections. For boosted Z bosons, we further show that the treatment of photon radiation in lepton-dressing algorithms significantly affects the extraction of spin-density-matrix coefficients at NLO and must be carefully controlled. To address these challenges, we propose a quantum tomography procedure that is applicable to any final state with one or more on-shell Z bosons that is robust under higher-order corrections. We illustrate its validity and limitations in ${\textrm{pp}} \to {\textrm{ZZ}} \to 4\ell$ and in heavy ($M_{\textrm{H}}>2 M_{\textrm{Z}}$) Higgs-boson decay ${\textrm{H}}\to {\textrm{ZZ}} \to 4\ell$.

hep-ph↗

Quantum Advantage in Learning Quantum Dynamics via Fourier coefficient extraction

One of the key challenges in quantum machine learning is finding relevant machine learning tasks with a provable quantum advantage. A natural candidate for this is learning unknown Hamiltonian dynamics. Here, we tackle the supervised learning version of this problem, where we are given random examples of the inputs to the dynamics as classical data, paired with the expectation values of some observable after the time evolution, as corresponding output labels. The task is to replicate the corresponding input-output function. We prove that this task can yield provable exponential classical-quantum learning advantages under common complexity assumptions in natural settings. To design our quantum learning algorithms, we introduce a new method, which we term \textit{\subroutine}~algorithm for parametrized circuit functions, and which may be of independent interest. Furthermore, we discuss the limitations of generalizing our method to arbitrary quantum dynamics while maintaining provable guarantees. We explain that significant generalizations are impossible under certain complexity-theoretic assumptions, but nonetheless, we provide a heuristic kernel method, where we trade-off provable correctness for broader applicability.

quant-ph↗

Statistics of topological defects across a phase transition in a digital superconducting quantum processor

When a quantum phase transition is crossed within a finite time, critical slowing down disrupts adiabatic dynamics, resulting in the formation of topological defects. The average density of these defects scales with the quench rate, adhering to a universal power law as predicted by the Kibble-Zurek mechanism (KZM). In this study, we aim to investigate the counting statistics of kink density in the 1D transverse-field quantum Ising model. We demonstrate on multiple quantum processing units up to 100 qubits, that higher-order cumulants follow a universal power law scaling as a function of the quench time. We also show the breakdown of the KZM for short quenches for finite-size systems. Tensor network simulations corroborate our quantum simulation results for bigger systems not in the asymptotic limit.

quant-ph↗

Guided Graph Compression for Quantum Graph Neural Networks

Graph Neural Networks (GNNs) are effective for processing graph-structured data but face challenges with large graphs due to high memory requirements and inefficient sparse matrix operations on GPUs. Quantum Computing (QC) offers a promising avenue to address these issues and inspires new algorithmic approaches. In particular, Quantum Graph Neural Networks (QGNNs) have been explored in recent literature. However, current quantum hardware limits the dimension of the data that can be effectively encoded. Existing approaches either simplify datasets manually or use artificial graph datasets. This work introduces the Guided Graph Compression (GGC) framework, which uses a graph autoencoder to reduce both the number of nodes and the dimensionality of node features. The compression is guided to enhance the performance of a downstream classification task, which can be applied either with a quantum or a classical classifier. The framework is evaluated on the Jet Tagging task, a classification problem of fundamental importance in high energy physics that involves distinguishing particle jets initiated by quarks from those by gluons. The GGC is compared against using the autoencoder as a standalone preprocessing step and against a baseline classical GNN classifier. Our numerical results demonstrate that GGC outperforms both alternatives, while also facilitating the testing of novel QGNN ansatzes on realistic datasets.

cs.LG↗

Estimates of loss function concentration in noisy parametrized quantum circuits

Variational quantum computing offers a powerful framework with applications across diverse fields such as quantum chemistry, machine learning, and optimization. However, its scalability is hindered by the exponential concentration of the loss function, known as the barren plateau problem. While significant progress has been made and prior work has separately analyzed barren plateaus in unitary and noisy settings, their combined impact remains poorly understood, largely due to limitations in conventional Lie-algebraic approaches. In this work, we introduce a novel analytical framework based on non-negative matrix theory that enables the description of the variance in layered noisy quantum circuits with arbitrary noise channels. This approach enables the derivation of exact expressions in the deep-circuit regime, uncovering the complex interplay between unitary layers and noise. Notably, we identify a noise-induced absorption mechanism-a phenomenon absent in purely unitary dynamics-which provides new insight into how noise shapes circuit behavior. We further present a controlled convergence analysis, establishing general lower bounds on the variance of both deep and shallow circuits. This leads to a principled connection between noise resilience and the expressive capacity of parameterized quantum circuits, particularly under smart initialization strategies. Our theoretical results are supported by numerical simulations and illustrative applications.

quant-ph↗

Simulating Bell inequalities with Qibo

We present educational material about Bell inequalities in the context of quantum computing. In particular, we provide software tools to simulate their violation, together with a guide for the classroom discussion. The material is organized in three modules of increasing difficulty, and the relative implementation has been written in Qibo, an open-source software suite to simulate quantum circuits with the ability to interface with quantum hardware. The topic of inequalities allows not only to introduce undergraduate or graduate students to crucial theoretical issues in quantum mechanics -- like entanglement, correlations, hidden variables, non-locality --, but also to practically put hands on tools to implement a real simulation, where statistical aspects and noise coming from current quantum chips also come into play.

physics.ed-ph↗

Quantum integration of decay rates at second order in perturbation theory

We present the first quantum computation of a total decay rate in high-energy physics at second order in perturbative quantum field theory. This work underscores the confluence of two recent cutting-edge advances. On the one hand, the quantum integration algorithm Quantum Fourier Iterative Amplitude Estimation (QFIAE), which efficiently decomposes the target function into its Fourier series through a quantum neural network before quantumly integrating the corresponding Fourier components. On the other hand, causal unitary in the loop-tree duality (LTD), which exploits the causal properties of vacuum amplitudes in LTD to coherently generate all contributions with different numbers of final-state particles to a scattering or decay process, leading to singularity-free integrands that are well suited for Fourier decomposition. We test the performance of the quantum algorithm with benchmark decay rates in a quantum simulator and in quantum hardware, and find accurate theoretical predictions in both settings.

quant-ph↗

Expressive equivalence of classical and quantum restricted Boltzmann machines

Quantum computers offer the potential for efficiently sampling from complex probability distributions, attracting increasing interest in generative modeling within quantum machine learning. This surge in interest has driven the development of numerous generative quantum models, yet their trainability and scalability remain significant challenges. A notable example is a quantum restricted Boltzmann machine (QRBM), which is based on the Gibbs state of a parameterized non-commuting Hamiltonian. While QRBMs are expressive, their non-commuting Hamiltonians make gradient evaluation computationally demanding, even on fault-tolerant quantum computers. In this work, we propose a semi-quantum restricted Boltzmann machine (sqRBM), a model designed for classical data that mitigates the challenges associated with previous QRBM proposals. The sqRBM Hamiltonian is commuting in the visible subspace while remaining non-commuting in the hidden subspace. This structure allows us to derive closed-form expressions for both output probabilities and gradients. Leveraging these analytical results, we demonstrate that sqRBMs share a close relationship with classical restricted Boltzmann machines (RBM). Our theoretical analysis predicts that, to learn a given probability distribution, an RBM requires three times as many hidden units as an sqRBM, while both models have the same total number of parameters. We validate these findings through numerical simulations involving up to 100 units. Our results suggest that sqRBMs could enable practical quantum machine learning applications in the near future by significantly reducing quantum resource requirements.

quant-ph↗

Operational Framework for a Quantum Database

Databases are an essential component of modern computing infrastructures and allow efficient manipulation of inherently structured data. The structure depends on the type and relationships of the individual data elements and on the access pattern. Extending the concept of databases to the quantum domain is expected to increase both the storage efficiency and the access parallelism through quantum superposition. In addition, quantum databases may be seen as the result of a prior state preparation ready to be used by quantum algorithms when needed. On the other hand, limiting factors exist and include entanglement creation, the impossibility of perfect copying due to the no-cloning theorem, and the impossibility of coherently erasing a quantum state. In this work, we introduce quantum databases within the broader context of data structures using classical, or more precisely cloneable, and quantum data and indexing. In particular, we are interested in quantum databases' practical implementation and usability, focusing on the definition of the basic operations needed to create and manipulate data stored in a superposition state. Specifically, we address the case of quantum indexing in combination with cloneable data. For this scenario, we define the operations for database preparation, extension, removal of indices, writing, and read-out of data, as well as index permutation. We present their algorithmic implementation and highlight their advantages and limitations. Finally, we introduce the next steps toward defining the same operations in the more general context of quantum indexing and quantum data.

quant-ph↗

Automatic and effective discovery of quantum kernels

Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data. Quantum kernels are able to capture relationships in the data that are not efficiently computable on classical devices. However, there is no straightforward method to engineer the optimal quantum kernel for each specific use case. We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML, to automatically find an optimal kernel in a heuristic manner. To this purpose we define an algorithm for constructing a quantum circuit implementing the similarity measure as a combinatorial object, which is evaluated based on a cost function and then iteratively modified using a meta-heuristic optimization technique. The cost function can encode many criteria ensuring favorable statistical properties of the candidate solution, such as the rank of the Dynamical Lie Algebra. Importantly, our approach is independent of the optimization technique employed. The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach, showing the potential of our technique to deliver superior results with reduced effort.

quant-ph↗

Enhanced feature encoding and classification on distributed quantum hardware

The steady progress of quantum hardware is motivating the search for novel quantum algorithm optimization strategies for near-term, real-world applications. In this study, we propose a novel feature map optimization strategy for Quantum Support Vector Machines (QSVMs), designed to enhance binary classification while taking into account backend-specific parameters, including qubit connectivity, native gate sets, and circuit depth, which are critical factors in noisy intermediate scale quantum (NISQ) devices. The dataset we utilised belongs to the neutrino physics domain, with applications in the search for neutrinoless double beta decay. A key contribution of this work is the parallelization of the classification task to commercially available superconducting quantum hardware to speed up the genetic search processes. The study was carried out by partitioning each quantum processing unit (QPU) into several sub-units with the same topology to implement individual QSVM instances. We conducted parallelization experiments with three IBM backends with more than 100 qubits, ranking the sub-units based on their susceptibility to noise. Data-driven simulations show how, under certain restrictions, parallelized genetic optimization can occur with the tested devices when retaining the top 20% ranked sub-units in the QPU.

quant-ph↗

Quantum anomaly detection in the latent space of proton collision events at the LHC

The ongoing quest to discover new phenomena at the LHC necessitates the continuous development of algorithms and technologies. Established approaches like machine learning, along with emerging technologies such as quantum computing show promise in the enhancement of experimental capabilities. In this work, we propose a strategy for anomaly detection tasks at the LHC based on unsupervised quantum machine learning, and demonstrate its effectiveness in identifying new phenomena. The designed quantum models, an unsupervised kernel machine and two clustering algorithms, are trained to detect new-physics events using a latent representation of LHC data, generated by an autoencoder designed to accommodate current quantum hardware limitations on problem size. For kernel-based anomaly detection, we implement an instance of the model on a quantum computer, and we identify a regime where it significantly outperforms its classical counterparts. We show that the observed performance enhancement is related to the quantum resources utilised by the model.

quant-ph↗

Guided Quantum Compression for High Dimensional Data Classification

Quantum machine learning provides a fundamentally different approach to analyzing data. However, many interesting datasets are too complex for currently available quantum computers. Present quantum machine learning applications usually diminish this complexity by reducing the dimensionality of the data, e.g., via auto-encoders, before passing it through the quantum models. Here, we design a classical-quantum paradigm that unifies the dimensionality reduction task with a quantum classification model into a single architecture: the guided quantum compression model. We exemplify how this architecture outperforms conventional quantum machine learning approaches on a challenging binary classification problem: identifying the Higgs boson in proton-proton collisions at the LHC. Furthermore, the guided quantum compression model shows better performance compared to the deep learning benchmark when using solely the kinematic variables in our dataset.

quant-ph↗

Loop Feynman integration on a quantum computer

This work investigates in detail the performance and advantages of a new quantum Monte Carlo integrator, dubbed Quantum Fourier Iterative Amplitude Estimation (QFIAE), to numerically evaluate for the first time loop Feynman integrals in a near-term quantum computer and a quantum simulator. In order to achieve a quadratic speedup, QFIAE introduces a Quantum Neural Network (QNN) that efficiently decomposes the multidimensional integrand into its Fourier series. For a one-loop tadpole Feynman diagram, we have successfully implemented the quantum algorithm on a real quantum computer and obtained a reasonable agreement with the analytical values. One-loop Feynman diagrams with more external legs have been analyzed in a quantum simulator. These results thoroughly illustrate how our quantum algorithm effectively estimates loop Feynman integrals and the method employed could also find applications in other fields such as finance, artificial intelligence, or other physical sciences.

hep-ph↗

From angular coefficients to quantum observables: a phenomenological appraisal in di-boson systems

Motivated by the growing interest in accessing the spin structure of multi-boson processes and in measuring quantum entanglement at high energies, we study polarisation and spin-correlation coefficients in di-boson systems. We show that higher-order corrections of QCD and electroweak type, off-shell modelling, and realistic effects such as fiducial selections and neutrino reconstruction are unavoidable to properly determine such coefficients, and consequently to provide a sound interpretation of observables sensitive to quantum entanglement and Bell-inequality violation. Our findings are based on a detailed phenomenological analysis of boson pairs at the LHC, either in inclusive electroweak production or coming from Higgs-boson decays.

hep-ph↗