Searcharxiv⌕ Search

arXiv subjects

Michele Grossi

Publications and source records attributed to Michele Grossi.

At least 19 recordsLinked to original sources
arXiv2026

Weighted Quantum Signal Processing: Low-Depth Polynomial Approximation with Applications to Kolmogorov-Arnold Networks

Quantum Signal Processing is a powerful quantum framework for generating and approximating univariate polynomials. However, QSP is often limited by circuit-depth bottlenecks and parity constraints on the class of realizable polynomials. In this work, we introduce Weighted Quantum Signal Processing, an extension of QSP in which a weight function is assigned to the central rotation operator. This formulation provides a deeper understanding of QSP, which emerges as the special case of WQSP with unit weights. The choice of weights determines the structure and expressive capabilities of WQSP circuits. When the weights are natural numbers greater than one, WQSP reduces to a pruned version of QSP, revealing parameter redundancies in the standard framework. Through appropriate selection of integer weights, WQSP achieves linear-to-exponential reductions in the number of parameters required to realize arbitrary bounded univariate polynomials while preserving approximation quality. For generic weights, we establish corresponding approximation error bounds and show that, in many cases, the approximation is exact. We analyze WQSP from both a deterministic perspective, where polynomial generation is formulated as the solution of a linear system, and a quantum machine learning perspective, where WQSP serves as a structured and expressive quantum learning model. We further employ this learning framework to parameterize learnable activation functions in Kolmogorov--Arnold Networks for multivariate function approximation. Our results show that WQSP provides a compact, flexible, and theoretically grounded framework for realizing arbitrary univariate polynomials while requiring significantly fewer trainable parameters than conventional QSP. This yields expressive and parameter-efficient neural architectures, highlighting the potential of WQSP as a scalable primitive for quantum-enhanced machine learning.

quant-ph↗
arXiv2026

Universal Optimization and Tighter Fidelity Bounds for Approximate Quantum Error Correction

Approximate quantum error correction (AQEC) extends the framework of discrete- and continuous-variable quantum error correction beyond the Knill-Laflamme (KL) conditions, where the recovery performance is quantified by entanglement fidelity. Recent studies have enabled efficient evaluation of near-optimal entanglement fidelity using transpose-channel recovery. Yet, determining the global optimal recovery map and its entanglement fidelity for general codes beyond the KL conditions remains a major computational challenge. Direct optimization becomes prohibitive as the number of noise Kraus operators grows rapidly with system size, and existing approaches lack rigorous guarantees for reducing this optimization to a tractable dimension. Here, we derive an explicit characterization of the optimal environmental state of complement channel, which transforms the optimization over recovery channels into an equivalent optimization over quotient unitaries. For a broader class of codes that satisfy only the orthogonality part of the KL conditions, we show that the optimal recovery map admits an explicit analytical form. Building on this form, we derive novel rigorous lower bounds of entanglement fidelity that strictly improve upon the transpose-recovery bound. We further develop a novel recovery strategy based on principle components, and derive a rigorous bound on the error introduced by noise truncation. Our approach enables efficient searches for approximate recovery maps for AQEC codes, avoiding the need to optimize over the full Kraus-operator space.

quant-ph↗
arXiv2026

Neural quantum states for non-Abelian lattice gauge theories with dynamical fermions

Determining the ground state of non-Abelian lattice gauge theories coupled to dynamical fermions is key to understanding confinement and the phase structure of gauge--matter systems. We present a variational Monte Carlo framework for the ground state of the untruncated fully-continuous SU$(2)$ lattice gauge theory coupled to dynamical staggered fermions on an $L\times L$ square lattice. We work in the magnetic basis with a neural-network representation of the gauge wavefunction. The fermions are described by a gauge-covariant Gaussian fermionic correction built on a fixed Néel reference state where, for each sampled gauge configuration $\mathbf{U}$, the correction is generated by a Hermitian operator. This operator is constructed from short Wilson lines and the eigenvectors of the mass--hopping Hamiltonian, with number of variational parameters polynomial in the system size. This Gaussian structure also gives analytical expressions for all fermionic contributions to the energy and related observables in terms of the fermion occupation matrix. The results are validated against strong-coupling perturbation theory, where they recover the expected effective antiferromagnetic spin Hamiltonian. Using this framework, we map a coarse ground state phase diagram in the plane of independent electric and magnetic couplings $(g^2, λ)$ and show that a hysteresis analysis can identify the existence of phase transitions. Restoring the physical relation $λ=4/g^2$, we characterize how increasing the system size and changing the electric coupling $g^2$ move the state away from the reference Néel state, for lattice sizes $L=4,6,8$. More broadly, the method offers a sign-problem-free variational framework for continuous non-Abelian gauge groups with dynamical matter that should extend to other matter content and higher-dimensional lattices.

hep-lat↗
arXiv2026

Quantum Phase Diagram of the $2+1$D Untruncated SU$(2)$ Lattice Gauge Theory with Dynamical Fermions

Non-Abelian gauge theories with dynamical matter govern the strong interaction and a broad class of strongly correlated quantum systems, yet their ground-state properties remain difficult to obtain from first principles. Using a continuous-group variational Monte Carlo approach that retains the full SU$(2)$ gauge field without truncation, we determine the ground-state behavior of the SU$(2)$ lattice gauge theory with staggered fermions on an $L\times L$ square lattice. Treating the magnetic and electric couplings $λ$ and $g^2$ independently, we find a magnetic-flux transition at $λ^\ast=-0.040\pm 0.005$, with no resolvable drift of the transition point as the electric coupling is varied. Along the physical coupling line $λ=4/g^2$, for $L=4,6,8$, we uncover a gauge-matter delocalization crossover from a flux-disordered regime at strong electric coupling to an ordered unity-flux regime at weak coupling. The chiral condensate, a gauge-invariant Wilson-line meson correlator, and the local color density consistently reveal the emergence of coherent gauge-assisted matter dynamics. Together, these results provide a unified physical picture of how magnetic-flux ordering and fermionic coherence develop in an untruncated non-Abelian lattice gauge theory.

hep-lat↗
arXiv2026

MPStab: an hybrid stabilizers tensor-network quantum circuit simulator

The development of techniques for simulating quantum systems using classical computers is a paramount task for two primary reasons: i) there exist configurations for which classical computers are remarkably effective and will continue to be so, and ii) exploring the limits of classical computation facilitates the identification of the regimes of competence for quantum computers. In this work, we present MPStab, a quantum circuit simulator based on a hybrid formalism combining stabilizers and tensor networks, recently introduced in Ref. [1]. We present the package, its core functionalities, and explore its performances in a few interesting simulation regimes.

quant-ph↗
arXiv2026

Hybrid Method of Efficient Simulation of Physics Applications for a Quantum Computer

Quantum chemistry and materials science are among the most promising areas for demonstrating algorithmic quantum advantage and quantum utility due to their inherent quantum mechanical nature. Still, large-scale simulations of quantum circuits are essential for determining the problem size at which quantum solutions outperform classical methods. In this work, we present a novel hybrid simulation approach, forming a hybrid of a fullstate and a Clifford simulator, specifically designed to address the computational challenges associated with the time evolution of quantum chemistry Hamiltonians. Our method focuses on the efficient emulation of multi-qubit rotations, a critical component of Trotterized Hamiltonian evolution. By optimizing the representation and execution of multi-qubit operations leveraging the Pauli frame, our approach significantly reduces the computational cost of simulating quantum circuits, enabling more efficient simulations. Beyond its impact on chemistry applications, our emulation strategy has broad implications for any computational workload that relies heavily on multi-qubit rotations. By increasing the efficiency of quantum simulations, our method facilitates more accurate and cost-effective studies of complex quantum systems. We quantify the performance improvements and computational savings for this emulation strategy, and we obtain a speedup of a factor $\approx 18$ ($\approx 22$ with MPI) for our evaluated chemistry Hamiltonians with 24 qubits. Thus, we evaluate our integration of this emulation strategy into the Intel Quantum SDK, further bridging the gap between theoretical algorithm development and practical quantum software implementations.

quant-ph↗
arXiv2026

Optimization-based Unfolding in High-Energy Physics

In experimental High-Energy Physics, unfolding refers to the problem of estimating the underlying distribution of a physical observable from detector-level data, in the presence of statistical fluctuations and systematic uncertainties. Starting from its reformulation as a regularized quadratic optimization problem, we develop a framework to address unfolding 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 datasets 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.

quant-ph↗
arXiv2026

Quantum Fourier Generative Models Trainable at Large Scale

We propose an algorithmic framework for building and training quantum generative models corresponding to multivariate probability distributions. Our model uses parallel Fourier feature maps for embedding continuous-valued variables combined with a forrelation-type quantum circuit for tuning Fourier coefficients of the quantum model. Crucially, we develop a distinct training strategy where training is enabled at large scale by log-likelihood loss with unbiased Monte Carlo estimator based on Parseval's identity. Unlike prior work that relied on maximal mean discrepancy (MMD) loss, our approach goes beyond matching just low frequency moments, while enabling efficient classical training. Once the model is trained, we use inverse quantum Fourier transforms to map it into a separate sampling circuit in the computational basis. We demonstrate the efficiency of the suggested framework by validating loss estimation at the scale of over 1000 qubits on a single GPU. We show that univariate and bivariate models with highly non-trivial structure can be trained to low total variation distance, while fine-tuned IQP models with MMD loss show poor performance. Comparing to classical baselines represented by normalizing flow and diffusion models, we show that our approach avoids oversmoothing and preserves multi-modal structure of the target. Finally, we have deployed the trained models on superconducting quantum devices, successfully sampling distributions with per-sample execution times of approximately $300\,μ\mathrm{s}$. Our work shows that quantum generative models with the train-on-classical deploy-on-quantum approach can provide both high-quality structure at increased scale and fast sampling access needed for inference.

quant-ph↗
arXiv2026

Physics inspired quantum algorithm for QCD splitting functions

We introduce a modular quantum circuit primitive to model entanglement dynamics in QCD parton splitting and use it as a composable building block for data-driven, physics-consistent event generation. For the pure-gluon channel, we derive an analytic expression for the helicity entanglement generated at the splitting vertex, quantified via the concurrence, and construct a two-qubit circuit whose measurement outcomes encode the momentum shared between outgoing gluons while reproducing the QCD-predicted entanglement structure. Calibrating the circuit parameters to LHC jet substructure data maps, reconstructed momentum-sharing fractions are directly related to circuit rotation angles. Composing multiple splitting primitives yields multi-prong momentum-fraction distributions; we validate the three- and four-prong cases against experimental data and find good agreement. For the three-prong configuration, we execute the circuit on superconducting quantum hardware and obtain results consistent with simulation after standard quality cuts, enabled by the low qubit count and shallow circuit depth. This work provides a concrete framework for quantum-native parton-shower modules that encode quantum correlations at the level of splitting dynamics, and offers physics-informed ansätze for future quantum algorithms for QCD.

quant-ph↗
arXiv2026

When is randomization advantageous in quantum simulation?

We study the regimes in which Hamiltonian simulation benefits from randomization. We introduce a sparse-QSVT construction based on composite stochastic decompositions, where dominant terms are treated deterministically and smaller contributions are sampled stochastically. Crucially, we analyze how stochastic and approximation errors propagate through block-encoding and QSVT procedures. To benchmark this approach, we construct ensembles of random Hamiltonians with controlled coefficient dispersion, locality, and number of terms, designed to favor randomization, and therefore providing an upper bound on its practical advantage. For Hamiltonians with many terms and highly inhomogeneous coefficient distributions, randomized methods reduce gate counts by up to an order of magnitude. However, this advantage is confined to moderate-precision regimes: as the target error decreases, deterministic methods become more efficient, with a crossover near $\varepsilon \sim 10^{-3}$. Although this regime partially overlaps with quantum chemistry Hamiltonians, realistic systems exhibit additional structure, such as commutation patterns, not captured by our model, which are expected to further favor deterministic approaches.

quant-ph↗
arXiv2026

Kubernetes-Orchestrated Hybrid Quantum-Classical Workflows

Hybrid quantum-classical workflows combine quantum processing units (QPUs) with classical hardware to address computational tasks that are challenging or infeasible for conventional systems alone. Coordinating these heterogeneous resources at scale demands robust orchestration, reproducibility, and observability. Even in the presence of fault-tolerant quantum devices, quantum computing will continue to operate within a broader hybrid ecosystem, where classical infrastructure plays a central role in task scheduling, data movement, error mitigation, and large-scale workflow coordination. In this work, we present a cloud-native framework for managing hybrid quantum-HPC pipelines using Kubernetes, Argo Workflows, and Kueue. Our system unifies CPUs, GPUs, and QPUs under a single orchestration layer, enabling multi-stage workflows with dynamic, resource-aware scheduling. We demonstrate the framework with a proof-of-concept implementation of distributed quantum circuit cutting, showcasing execution across heterogeneous nodes and integration of classical and quantum tasks. This approach highlights the potential for scalable, reproducible, and flexible hybrid quantum-classical computing in cloud-native environments.

quant-ph↗
arXiv2026

Probabilistic modeling over permutations using quantum computers

Quantum computers provide a super-exponential speedup for performing a Fourier transform over the symmetric group, an ability for which practical use cases have remained elusive so far. In this work, we leverage this ability to unlock spectral methods for machine learning over permutation-structured data, which appear in applications such as multi-object tracking and recommendation systems. It has been shown previously that a powerful way of building probabilistic models over permutations is to use the framework of non-Abelian harmonic analysis, as the model's group Fourier spectrum captures the interaction complexity: "low frequencies" correspond to low order correlations, and "high frequencies" to more complex ones. This can be used to construct a Markov chain model driven by alternating steps of diffusion (a group-equivariant convolution) and conditioning (a Bayesian update). However, this approach is computationally challenging and hence limited to simple approximations. Here we construct a quantum algorithm that encodes the exact probabilistic model -- a classically intractable object -- into the amplitudes of a quantum state by making use of the Quantum Fourier Transform (QFT) over the symmetric group. We discuss the scaling, limitations, and practical use of such an approach, which we envision to be a first step towards useful applications of non-Abelian QFTs.

quant-ph↗
arXiv2026

Trainability barriers and opportunities in quantum generative modeling

Quantum generative models provide inherently efficient sampling strategies and thus show promise for achieving an advantage using quantum hardware. In this work, we investigate the barriers to the trainability of quantum generative models posed by barren plateaus and exponential loss concentration. We explore the interplay between explicit and implicit models and losses, and show that using quantum generative models with explicit losses such as the KL divergence leads to a new flavour of barren plateaus. In contrast, the implicit Maximum Mean Discrepancy loss can be viewed as the expectation value of an observable that is either low-bodied and provably trainable, or global and untrainable depending on the choice of kernel. In parallel, we find that solely low-bodied implicit losses cannot in general distinguish high-order correlations in the target data, while some quantum loss estimation strategies can. We validate our findings by comparing different loss functions for modelling data from High-Energy-Physics.

quant-ph↗
arXiv2026

Coherent Quantum Evaluation of Collider Amplitudes for Effective Field Theory Constraints

Precision measurements at electron-positron colliders provide stringent tests of the Standard Model and powerful probes of possible higher-dimensional interactions. We present a hybrid quantum-classical framework for computing leading-order helicity amplitudes for $e^+e^-\to \ell^+\ell^-$ scattering on gate-based quantum hardware and using the resulting cross sections to constrain both Standard Model couplings and effective field theory operators. In our approach, external kinematics are encoded into single-qubit Weyl spinors, and full helicity amplitudes are reconstructed by coherently combining diagrammatic contributions within a single quantum circuit. Classical post-processing yields physical amplitudes and differential cross sections that can be directly compared with collider data. As a proof of concept, we compute unpolarised angular distributions and perform binned likelihood fits to precision electron-positron measurements. The extracted bounds are statistically consistent with Standard Model expectations, demonstrating that quantum-assisted amplitude evaluation can interface directly with phenomenological analyses and experimental data. This work establishes a concrete pathway toward applying quantum computing to precision collider physics and effective field theory studies.

hep-ph↗
arXiv2026

Learning partial transpose signatures in qubit ququart states from a few measurements

Higher-dimensional quantum systems are attracting interest for improving quantum protocol performance by increasing memory space. Characterizing quantum resources of such systems is fundamental but experimentally costly. We tackle the first non-trivial example: a qubit-ququart system, focusing on partial-transpose spectral classification. Entanglement distillation extracts maximally entangled states from noisy resources, but determining distillability typically requires full state tomography, experimentally prohibitive for high-dimensional systems. We explore a machine learning framework to classify distillable bipartite quantum states using fewer measurements than complete tomography. Our approach employs the PPT criterion, categorizing states by negative eigenvalues in the partial transpose. We use various ML algorithms, including Support Vector Machines, Random Forest, and Artificial Neural Networks, with features from fixed measurements and learnable observables. Results show learnable observables consistently outperform Collective Measurement Witnesses methods. While all models distinguish between non-distillable (PPT) and distillable (NPT) states, differentiating NPT subclasses remains challenging, underscoring the intricate Hilbert space geometry. This work provides an experimentally friendly tool for distillability verification in high-dimensional quantum systems without full state reconstruction

quant-ph↗
arXiv2025

On Dequantization of Supervised Quantum Machine Learning via Random Fourier Features

In the quest for quantum advantage, a central question is under what conditions can classical algorithms achieve a performance comparable to quantum algorithms--a concept known as dequantization. Random Fourier features (RFFs) have demonstrated potential for dequantizing certain quantum neural networks (QNNs) applied to regression tasks, but their applicability to other learning problems and architectures remained unexplored. In this work, we derive bounds on the true risk gap between classical RFF models and quantum models for regression and classification tasks with both QNN and quantum kernel architectures. Furthermore, we provide sufficient conditions under which this gap is small and thus the quantum system can be dequantized via the RFF method. We support our findings with numerical experiments that illustrate the practical dequantization of existing quantum kernel-based methods. Our findings not only broaden the applicability of RFF-dequantization but also enhance the understanding of potential quantum advantages in practical machine-learning tasks.

quant-ph↗
arXiv2025

Learning Reduced Representations for Quantum Classifiers

Data sets that are specified by a large number of features are currently outside the area of applicability for quantum machine learning algorithms. An immediate solution to this impasse is the application of dimensionality reduction methods before passing the data to the quantum algorithm. We investigate six conventional feature extraction algorithms and five autoencoder-based dimensionality reduction models to a particle physics data set with 67 features. The reduced representations generated by these models are then used to train a quantum support vector machine for solving a binary classification problem: whether a Higgs boson is produced in proton collisions at the LHC. We show that the autoencoder methods learn a better lower-dimensional representation of the data, with the method we design, the Sinkclass autoencoder, performing 40% better than the baseline. The methods developed here open up the applicability of quantum machine learning to a larger array of data sets. Moreover, we provide a recipe for effective dimensionality reduction in this context.

quant-ph↗
arXiv2025

Quantum Chebyshev Probabilistic Models for Fragmentation Functions

Quantum generative modeling is emerging as a powerful tool for advancing data analysis in high-energy physics, where complex multivariate distributions are common. However, efficiently learning and sampling these distributions remains challenging. We propose a quantum protocol for a bivariate probabilistic model based on shifted Chebyshev polynomials, trained as a circuit-based representation of two correlated variables, with sampling performed via quantum Chebyshev transforms. As a key application we study fragmentation functions (FFs) of charged pions and kaons from single-inclusive hadron production in electron-positron annihilation. We learn the joint distribution of momentum fraction $z$ and energy scale $Q$, and infer their correlations from the entanglement structure. Building on the generalization capabilities of the quantum model and extended register architecture, we perform fine-grid multivariate sampling for FF dataset augmentation. Our results highlight the growing potential of quantum generative modeling to advance data analysis and scientific discovery in high-energy physics.

quant-ph↗