arXiv subjects

Davide Venturelli

Publications and source records attributed to Davide Venturelli.

At least 19 recordsLinked to original sources

arXiv2026

A fully parallel densely connected probabilistic Ising machine with inertia for real-time applications

Ising machines---special-purpose hardware for heuristically solving Ising optimization problems---based on probabilistic bits (p-bits) have been established as a promising alternative to heuristic optimization algorithms run on conventional computers. However, it has---until now---been thought that Ising spins that are connected in probabilistic Ising machines (PIMs) cannot be updated in parallel without ruining the machine's solving ability. This has presented a major challenge to realizing the potential for probabilistic Ising machines to act as fast solvers for densely connected Ising problems. In this paper, we show that it is possible to circumvent this conventional wisdom. We introduce a modified form of Ising spin dynamics for PIMs, adding an inertia term, and verify in algorithm simulations, field-programmable gate array (FPGA) emulation, and in FPGA experiments that the modified dynamics enables fully parallel, synchronous updates and at the same time improves the achieved success probability. Our evaluations were performed with various types of abstract (Max-Cut and Sherrington-Kirkpatrick model) and application-derived (multiple-input and multiple-output, MIMO detection) dense Ising benchmark instances. Performing fully parallel updates results in a speed advantage that grows superlinearly with the number of spins, giving rise to large time-to-solution reductions for practical problem sizes. For both MC and the SK model at a problem size of 200, our approach achieved an average speedup of ~34x, with the best single-instance speedup reaching 150x. As an example of the practical utility of our approach in an application where speed is critical, we co-design the algorithm dynamics and hardware implementation for MIMO detection, achieving improved detection accuracy relative to the standard linear detector and higher throughput than the conventional sequential-update PIM.

cs.ET↗

arXiv2026

Setting angles in quantum approximate optimization at utility-scale

The quantum approximate optimization algorithm (QAOA) is a powerful heuristic that seeks to solve combinatorial optimization problems using quantum hardware and classical optimization in tandem. Various methods exist to train the parameterized quantum circuits that serve as an ansatz in QAOA. However, which method works best to identify optimal angles for a given problem instance remains poorly understood, especially at utility-scale, i.e., $100$ qubits or more. In this work, we address this challenge through utility-scale benchmarks from which we distill operational guidance for QAOA practitioners. First, we investigate approximation techniques, such as matrix product states and Pauli propagation, to find optimal angles. Second, we train QAOA on small-scale representative problems and transfer the angles to larger ones. We then validate the results on quantum hardware for utility-scale problem instances that can be meaningfully executed. In this way, we identify insights for QAOA angle setting strategies that work best for problems at the utility scale, including as a function of resource cost for the search. Crucially, the operational implications we draw from our benchmarks will help quantum optimization practitioners execute QAOA end-to-end pipelines efficiently on current and future hardware.

quant-ph↗

arXiv2026

Quantum Approximate Optimization via Noise-Directed Adaptive Warm-Starting

Progress towards a quantum advantage using known heuristic methods for combinatorial optimization is impeded by hardware noise and limited qubit count. Here, we propose a noise-aware adaptive approach to quantum approximate optimization, Noise-Directed Adaptive Warm-Starting (ND-AWS), that builds on recent concepts such as Warm-Start QAOA and Noise-Directed Adaptive Remapping. By leveraging bitflip gauge transformations, our algorithm exploits amplitude-damping-like noise components. We experimentally implement high-performance quantum optimization ansätze on 100-qubit Ising Hamiltonians, showing that ND-AWS generally improves the performance over a non-gauge-transformed iterative Warm-Starting variant, at no additional circuit cost. This places our results among the highest-quality demonstrations of quantum optimization with similar ansätze at this scale. Crucially, the simplicity of the framework opens the door for future enhancements such as adaptive bias schedules, and integration with classical solvers.

quant-ph↗

arXiv2026

Temporal information processing on a 4,500-qubit quantum annealer

Quantum machine learning could uncover statistical structure beyond the reach of classical models, but this requires quantum models large and expressive enough to be useful and cheap enough to read out. Most approaches optimize many quantum parameters and are thus limited by expensive training loops. Here we report a quantum machine-learning model implemented on a programmable superconducting quantum annealer that processes temporal data at large scale using up to 4,500 qubits-the largest quantum machine-learning experiment performed to date. Following the quantum reservoir computing paradigm, the untrained native many-body dynamics generated by reverse annealing is directly used to process temporal data. We prove that the interactions produced during annealing are indispensable-a non-interacting reservoir retains no memory of its input. We evaluate our model experimentally on standard memory benchmarks and demonstrate that it can successfully forecast chaotic time series. These results establish quantum annealers as a scalable platform for large-scale quantum machine learning.

quant-ph↗

arXiv2026

How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits

In the span of four decades, quantum computation has evolved from an intellectual curiosity to a potentially realizable technology. Today, small-scale demonstrations have become possible for quantum algorithmic primitives on hundreds of physical qubits. Nevertheless, there are significant outstanding challenges in quantum hardware, fabrication, software architecture, and algorithms on the path towards a full-stack scalable quantum computing technology. Here, we provide a comprehensive review of these scaling challenges. We show how to facilitate scaling by adopting existing semiconductor technology to build much higher-quality qubits, employing systems engineering approaches, and performing distributed heterogeneous quantum-classical computing. We provide a detailed resource and sensitivity analysis for quantum applications on surface-code error-corrected quantum computers given current, target, and desired hardware specifications based on superconducting qubits, accounting for a realistic distribution of errors. We provide comprehensive resource estimates for several utility-scale applications including quantum chemistry calculations, catalyst design, NMR spectroscopy, and Fermi-Hubbard simulation. We show that orders of magnitude enhancement in performance could be obtained by a combination of hardware improvements and tight quantum-HPC integration. Furthermore, we introduce high-performance architectures for quantum-probabilistic computing with custom-designed accelerators to tackle today's industry-scale classical optimization, machine learning, and quantum simulation tasks in a cost-effective manner.

quant-ph↗

arXiv2026

Noise-Directed Adaptive Remapping for Integer Optimization: from qubits to (encoded) qudits

We extend Noise-Directed Adaptive Remapping (NDAR), a recently proposed heuristic meta-algorithm that leverages device noise as a computational resource, to optimization problems over discrete (integer) domains. While originally introduced for unconstrained binary optimization, the proposed generalization introduces additional gauge degrees of freedom at the logical level, such that the gauge transformation applied at each iteration is no longer unique, allowing tailoring to particular encodings or quantum hardware. We identify encoding-dependent requirements for NDAR beyond binary domains: feasibility of the noise attractor, existence of compatible gauge transformations that preserve an efficiently implementable circuit family, and a systematic way to select the transform to apply at each step. We analyze these criteria for qudit-native and for binary, one-hot, and domain-wall qubit encodings, using the Max-k-colorable subgraph problem as a running example. We demonstrate that these encodings can exhibit distinct advantages and tradeoffs when integrated within the NDAR framework, particularly in how noise-induced dynamics interact with the solution landscape and choice of encoding. Our results indicate that NDAR-guided noise considerations provide a new criterion for comparing device-level encoding choices for quantum optimization. Finally, we outline directions toward experimental realization in superconducting qudit devices and further algorithmic improvements.

quant-ph↗

arXiv2026

Level statistics in the fractal phase of generalized Rosenzweig--Porter models

The Rosenzweig--Porter (RP) random matrix ensemble has emerged as a minimal model for the integrability-to-chaos crossover in quantum many-body systems. Its phase diagram features a region with fractal eigenstates, exhibiting intermediate spectral and localization properties between the fully localized and fully delocalized regimes. In this work, we explore several generalizations of the RP model and determine their level statistics at the scale of the Thouless energy $E_T$, which characterizes the crossover. Using tools from free probability theory and the replica method, we compute the full counting statistics in the limit of large system size, and show that it takes a simple, universal scaling form around $E_T$, shared across all variations of the model. We validate our analytical predictions using exact numerical diagonalization of large samples, and large-deviation algorithms that resolve the full counting statistics down to probabilities as low as $10^{-40}$. We also contrast our predictions with measurements on the quantum random energy model, which is the simplest model displaying many-body localization.

cond-mat.dis-nn↗

arXiv2026

Macroscopic fluctuation theory of interacting Brownian particles

We apply the macroscopic fluctuation theory (MFT) to study the large-scale dynamical properties of Brownian particles with arbitrary pairwise interaction. By combining it with standard results of equilibrium statistical mechanics for the collective diffusion coefficient, the MFT gives access to the exact large-scale dynamical properties of the system, both in- and out-of-equilibrium. In particular, we obtain exact results for dynamical correlations between the density and the current of particles. For one-dimensional systems, this allows us to obtain a precise description of these correlations for emblematic models, such as the Calogero and Riesz gases, and for systems with nearest-neighbor interactions such as the Rouse chain of hardcore particles or the recently introduced model of tethered particles. Tracer diffusion with the single-file constraint (but for arbitrary pairwise interaction) is also studied. For higher-dimensional systems, we quantitatively characterize these dynamical correlations by relying on standard methods such as the virial expansion.

cond-mat.stat-mech↗

arXiv2026

Physics-Inspired Probabilistic Computing for Extremely Large-Scale MIMO Detection in Future 6G Wireless Systems

Extremely large-scale multiple-input multiple-output (XL-MIMO) architectures are a key enabler of forthcoming 6G wireless communication networks by allowing high data rates through massive spatial multiplexing. Here, we approach these problems with physics-inspired unconventional computing based on Ising machines (IMs). For binary modulation, probabilistic IMs (PIMs) and oscillator-based IMs achieve optimal ML detection with systems up to 2048x2048 antennas with only 100 iterations, matching optimal sphere decoder performance for computationally treatable sizes and outperforming the minimum mean-square error (MMSE) industrial standard. For M-QAM up to 256, a generalized PIM-inspired framework, based on d-dimensional probabilistic variables (p-dits) that directly encode QAM symbols, shows low bit-error-rate across sizes up to 256x256 antennas, outperforming or matching MMSE with reduced algorithmic complexity. Unlike the binary mapping, the p-dit interaction matrix is independent of the QAM order, enabling adaptive MIMO modulation. These results show a promising scalable paradigm for XL MIMO detection in future 6G networks.

cs.IT↗

arXiv2026

The Wishart--Rosenzweig--Porter random matrix ensemble

In recent years the Rosenzweig--Porter (RP) ensemble, obtained by adding a diagonal matrix with independent and identically distributed elements to a Gaussian random matrix, has been widely used as a minimal model for the emergence of fractal eigenstates in complex many-body systems. A key open question concerns the robustness of its phase diagram when the assumption of independent and uncorrelated entries is relaxed -- an assumption that simplifies its analysis, but is generally violated in realistic quantum systems. In this work, we take a first step in this direction by considering a deformed Wishart (rather than Gaussian) random matrix, which we dub the ``Wishart--RP'' ensemble. Using perturbation theory, as well as the cavity and replica methods and the Dyson Brownian motion approach, we characterize its phase diagram and localization properties. Remarkably, we show that the level compressibility, which quantifies spectral correlations in the fractal phase, coincides with that of the Gaussian RP model, thereby extending the universality conjectured in [SciPost Phys. 14, 110 (2023)] beyond the fully uncorrelated setting. We confirm our results with numerical tests.

cond-mat.stat-mech↗

arXiv2026

Sequential Reservoir Computing for Efficient High-Dimensional Spatiotemporal Forecasting

Forecasting high-dimensional spatiotemporal systems remains computationally challenging for recurrent neural networks (RNNs) and long short-term memory (LSTM) models due to gradient-based training and memory bottlenecks. Reservoir Computing (RC) mitigates these challenges by replacing backpropagation with fixed recurrent layers and a convex readout optimization, yet conventional RC architectures still scale poorly with input dimensionality. We introduce a Sequential Reservoir Computing (Sequential RC) architecture that decomposes a large reservoir into a series of smaller, interconnected reservoirs. This design reduces memory and computational costs while preserving long-term temporal dependencies. Using both low-dimensional chaotic systems (Lorenz63) and high-dimensional physical simulations (2D vorticity and shallow-water equations), Sequential RC achieves 15-25% longer valid forecast horizons, 20-30% lower error metrics (SSIM, RMSE), and up to three orders of magnitude lower training cost compared to LSTM and standard RNN baselines. The results demonstrate that Sequential RC maintains the simplicity and efficiency of conventional RC while achieving superior scalability for high-dimensional dynamical systems. This approach provides a practical path toward real-time, energy-efficient forecasting in scientific and engineering applications.

cs.LG↗

arXiv2025

Quantum Sensing using Geometrical Phase in Qubit-Oscillator Systems

We present a quantum sensing protocol for coupled qubit-oscillator systems that surpasses the standard quantum limit (SQL) by exploiting a geometrical phase. The signal is encoded in the geometrical phase that is proportional to the area enclosed in oscillator phase space. This area is amplified through squeezing, enabling sensitivities beyond the SQL. Our method is independent of oscillator's initial state, amenable to sensing with high-temperature or logical error-corrected states. The protocol shows robustness to qubit Markovian noise and preserves its state-independence, underscoring its practicality for next-generation quantum metrology. We demonstrate application to force sensing beyond the SQL in longitudinally coupled systems, and to high-precision measurements of couplings and pulse calibration surpassing SQL in dispersively coupled circuit quantum electrodynamics (cQED) architectures.

quant-ph↗

arXiv2025

Recoil of a driven tracer in a correlated medium

We study the stochastic dynamics of a Brownian particle after it is suddenly released from a harmonic trap moving with constant velocity through a fluctuating correlated medium, described by a scalar Gaussian field with relaxational dynamics and in contact with a thermal bath. We show that, after the release, the particle exhibits recoil, i.e., it moves in the direction opposite to the drag. As expected, this effect vanishes if the field equilibrates instantaneously. The final value of the average position of the particle is reached algebraically in time in the case of conserved dynamics of the field or for non-conserved dynamics at the critical point. Our predictions are expected to be relevant, at least qualitatively, to driven colloidal particles in liquid media close to critical points.

cond-mat.stat-mech↗

arXiv2025

Improving Quantum Approximate Optimization by Noise-Directed Adaptive Remapping

We present Noise-Directed Adaptive Remapping (NDAR), a heuristic algorithm for approximately solving binary optimization problems by leveraging certain types of noise. We consider access to a noisy quantum processor with dynamics that features a global attractor state. In a standard setting, such noise can be detrimental to the quantum optimization performance. Our algorithm bootstraps the noise attractor state by iteratively gauge-transforming the cost-function Hamiltonian in a way that transforms the noise attractor into higher-quality solutions. The transformation effectively changes the attractor into a higher-quality solution of the Hamiltonian based on the results of the previous step. The end result is that noise aids variational optimization, as opposed to hindering it. We present an improved Quantum Approximate Optimization Algorithm (QAOA) runs in experiments on Rigetti's quantum device. We report approximation ratios $0.9$-$0.96$ for random, fully connected graphs on $n=82$ qubits, using only depth $p=1$ QAOA with NDAR. This compares to $0.34$-$0.51$ for standard $p=1$ QAOA with the same number of function calls.

quant-ph↗

arXiv2025

Structure and dynamics of a Rouse polymer in a fluctuating correlated medium

We study the static and dynamical properties of a harmonically confined Rouse polymer coupled to a fluctuating correlated medium, which affect each other reciprocally during their stochastic evolution. The medium is modeled by a scalar Gaussian field which can feature modes with slow relaxation and long-range spatial correlations. We show that these modes affect the long-time behavior of the average position of the center of mass of the polymer, which, after a displacement, turns out to relax algebraically towards its equilibrium value. This is a manifestation of the non-Markovian nature of the effective evolution of the position of the center of mass, once the degrees of freedom of the medium have been integrated out. In contrast, we show that the coupling to the medium speeds up the relaxation of higher Rouse modes. We further characterize the typical size of the polymer as a function of its polymerization degree and of the correlation length of the medium, particularly when the system is driven out of equilibrium via the application of a constant external driving force. Finally, we study the response of a linear polymer to a tensile force acting on its terminal monomers.

cond-mat.soft↗

arXiv2025

From quantum feature maps to quantum reservoir computing: perspectives and applications

We explore the interplay between two emerging paradigms: reservoir computing and quantum computing. We observe how quantum systems featuring beyond-classical correlations and vast computational spaces can serve as non-trivial, experimentally viable reservoirs for typical tasks in machine learning. With a focus on neutral atom quantum processing units, we describe and exemplify a novel quantum reservoir computing (QRC) workflow. We conclude exploratively discussing the main challenges ahead, whilst arguing how QRC can offer a natural candidate to push forward reservoir computing applications.

quant-ph↗

arXiv2025

Exact large-scale correlations in diffusive systems with general interactions: explicit characterisation without the Dean--Kawasaki equation

Characterising the statistical properties of classical interacting particle systems is a long-standing question. For Brownian particles the microscopic density obeys a stochastic evolution equation, known as the Dean--Kawasaki equation. This equation remains mostly formal and linearization (or higher-order expansions) is required to obtain explicit expressions for physical observables, with a range of validity not easily defined. Here, by combining macroscopic fluctuation theory with equilibrium statistical mechanics, we provide a systematic alternative to the Dean--Kawasaki framework to characterize large-scale correlations. This approach enables us to obtain explicit and exact results for dynamical observables such as tracer cumulants and bath-tracer correlations in one dimension, both in and out of equilibrium. In particular, we reveal a generic non-monotonic spatial structure in the response of the bath following a temperature quench. Our approach applies to a broad class of interaction potentials and extends naturally to higher dimensions.

cond-mat.stat-mech↗

arXiv2025

Universal scale-free decay of tracer-bath correlations in $d$-dimensional interacting particle systems

Quantifying the correlations between the position of a tagged tracer and the density of surrounding bath particles is crucial for understanding tracer diffusion in interacting particle systems, and for characterizing the response properties of the bath. We address this problem analytically for both hard-core and soft-core interactions, using minimal yet paradigmatic models in $d$ spatial dimensions. In both cases, we derive analytical expressions for the spatial correlation profiles in the reference frame of the tracer. We reveal unexpected universal features in their large-distance behavior, characterized by power-law tails with exponents that depend solely on the spatial dimensionality of the system. Beyond these simple models, we demonstrate the robustness of our results across different regimes using particle-based numerical simulations.

cond-mat.stat-mech↗