SearcharxivSearch

arXiv subjects

Francesco Caravelli

Publications and source records attributed to Francesco Caravelli.

At least 19 recordsLinked to original sources

Large deviations for linear regressions

Linear regression is one of the simplest and most widely used tools to learn patterns from data: it fits a set of coefficients so that a linear combination of predictors best matches observed responses. The quality of the fit is measured by the residual sum of squares, the total squared mismatch between predictions and data, whose minimum defines the training loss. We consider Gaussian design and noise, with teacher coefficients independently drawn from a general distribution $p(\beta)$, and a general class of separable regularizers, including Ridge and Lasso. Using the zero-temperature replica method, we compute analytically the large-deviation statistics of the minimum training loss for large numbers $P$ of predictors and $N$ of observations, with $r=P/N$ fixed. The rate function we compute governs rare sample-to-sample fluctuations of the optimal loss. Extensive numerical simulations are in excellent agreement with our theory and clearly show a pronounced deviation from the Gaussian regime of typical fluctuations in the tails.

cond-mat.stat-mech

Quantum error correction with global control

Reaching fault tolerance means scaling qubit counts by orders of magnitude, a jump that conventional superconducting architectures cannot sustain without solving the so-called `wiring problem'. Global control sidesteps this bottleneck, but implementing quantum error correction (QEC) on previously proposed global architectures incurs extremely steep overhead costs, due to the need for separate correction procedures for the computational and auxiliary qubits that comprise the global device. We resolve this by introducing the first globally-controlled architecture with zero qubit overhead. Every physical qubit is a computational qubit, and thus, every qubit is protected under a single error correcting scheme. We identify a class of cyclic stabilizer codes realizable through global iSWAP and single-qubit gates, yielding QEC thresholds nearly seven orders of magnitude larger than previous estimates for globally-controlled arrays. We further show these thresholds improve systematically as the global architecture is augmented with a limited amount of local measurement sites, demonstrating a trade-off between wiring simplicity and fault-tolerant performance.

quant-ph

Mitigating quantum decoherence via global optimal control

We show that global optimal control can drastically suppress the impact of decoherence in globally driven superconducting quantum computing architectures, taking as a prototype a recently proposed quasi-two-dimensional ladder geometry. Using a tensor-network-based approach, we quantify how amplitude-damping and dephasing channels degrade the flow of quantum information along the ladder and the fidelity of one- and two-qubit gate operations. We then demonstrate that shaping the global drive compresses the gate sequences by an order of magnitude in time, restoring high gate fidelities. We stress that this mitigation is far from trivial: in a globally driven processor, dissipation acts on every physical qubit---including those outside the logical register that sustain the surrounding ordered phases---so its impact cannot be suppressed by protecting an isolated subsystem, and is instead overcome purely through the temporal shaping of the global drive.

quant-ph

A Reservoir Computing Approach to Quantum Gate Synthesis

Quantum gate synthesis is essential for implementing quantum algorithms on real hardware, yet existing methods are often computationally demanding. Here, we introduce a novel approach based on reservoir computing, which we name Group Reservoir Computing, an efficient machine-learning paradigm for learning temporal dynamics whose training reduces to a single linear regression, to reduce the resources required. The method is grounded in the Wei--Norman decomposition, which provides a compact description of the evolution. We prove that the reconstructed dynamics always remain unitary by construction and derive formal error bounds that establish the theoretical validity of the strategy. On the standard single-qubit gate set the trained network produces a control pulse in a single pass, with mean fidelity 0.94 across the eight benchmark gates; used to warm-start gradient-based optimization, it roughly halves the number of iterations that plain gradient ascent needs to reach a target fidelity, so that the relevant figure of merit is the time to reach that threshold rather than the final accuracy after a fixed budget. Owing to its general formulation, the method applies to any finite-dimensional hardware platform; the route to multiqubit synthesis is discussed in the closing section.

quant-ph

Controlled topological dilution drives cooperative glassy dynamics in artificial spin ice

It has long been known that disorder, perturbing the energy landscape of magnetic systems, can introduce glassy dynamics. However, the controlled role of increasing disorder in driving glass formation remains difficult to isolate in naturally occurring materials. Artificial spin ice offers a unique model platform in which geometry, interactions, and disorder can be engineered at the nanoscale. Here, we investigate the impact of controlled disorder introduced through random decimation in artificial square spin ice. By systematically removing nanomagnets from random sites, we modify the vertex topology and progressively increase frustration in the spin network. Synchrotron-based photoemission electron microscopy reveals that decimation enhances the population of higher energy vertices and increases the configurational entropy of the system. Time-resolved temperature-dependent imaging further shows the emergence of slow cooperative dynamics at higher decimation, characterized by aging, a finite Edwards--Anderson order parameter, and enhanced dynamical heterogeneity quantified by the four-point susceptibility. The relaxation dynamics transition from thermally activated behavior at low decimation to Vogel--Fulcher--type freezing at higher decimation. These results demonstrate that random decimation drives artificial spin ice from long-range order to a glass-like magnetic state, establishing artificial spin systems as a tunable platform for studying glassy dynamics in frustrated matter.

cond-mat.mes-hall

How to Train Your Resistive Network: Generalized Equilibrium Propagation and Analytical Learning

Machine learning is a powerful method of extracting meaning from data; unfortunately, current digital hardware is extremely energy-intensive. There is interest in an alternative analog computing implementation that could match the performance of traditional machine learning while being significantly more energy-efficient. However, it remains unclear how to train such analog computing systems while adhering to locality constraints imposed by the physical (as opposed to digital) nature of these systems. Local learning algorithms such as Equilibrium Propagation and Coupled Learning have been proposed to address this issue. In this paper, we develop an algorithm to exactly calculate gradients using a graph theoretic and analytical framework for Kirchhoff's laws. We also introduce Generalized Equilibrium Propagation, a framework encompassing a broad class of Hebbian learning algorithms, including Coupled Learning and Equilibrium Propagation, and show how our algorithm compares. We demonstrate our algorithm using numerical simulations and show that we can train resistor networks without the need for a replica or readout over all resistors, only at the output layer. We also show that under the analytical gradient approach, it is possible to update only a subset of the resistance values without a strong degradation in performance.

cs.LG

Fingerprints of classical memory in quantum hysteresis

We present a simple framework for classical and quantum ``memory'' in which the Hamiltonian at time $t$ depends on past values of a control Hamiltonian through a causal kernel. This structure naturally describes finite-bandwidth or filtered control channels and provides a clean way to distinguish between memory in the control and genuine non-Markovian dynamics of the state. We focus on models where $H(t)=H_0+\int_{-\infty}^{t}K(t-s)\,H_1(s)\,ds$, and illustrate the framework on single-qubit examples such as $H(t)=\sigma_z+\Phi(t)\sigma_x$ with $\Phi(t)=\int_{-\infty}^{t}K(t-s)\,u(s)\,ds$. We derive basic properties of such dynamics, discuss conditions for unitarity, give an equivalent time-local description for exponential kernels, and show explicitly how hysteresis arises in the response of a driven qubit.

quant-ph

Experimental observation of dynamical blockade between transmon qubits via ZZ interaction engineering

We report the experimental realization of strong longitudinal (ZZ) coupling between two superconducting transmon qubits achieved solely through capacitive engineering. By systematically varying the qubit frequency detuning, we measure cross-Kerr inter-qubit interaction strengths ranging from 10 MHz up to 350 MHz, more than an order of magnitude larger than previously observed in similar capacitively coupled systems. In this configuration, the qubits enter a strong-interaction regime in which the excitation of one qubit inhibits that of its neighbor, demonstrating a dynamical blockade mediated entirely by the engineered ZZ coupling. Circuit quantization simulations accurately reproduce the experimental results, while perturbative models confirm the theoretical origin of the energy shift as a hybridization between the computational states and higher-excitation manifolds. We establish a robust and scalable method to access interaction-dominated physics in superconducting circuits, providing a pathway towards solid-state implementations of globally controlled quantum architectures and cooperative many-body dynamics.

quant-ph

Overcoming disorder in superconducting globally driven quantum computing

We study the impact of static disorder on a globally-controlled superconducting quantum computing architecture based on a quasi-two-dimensional ladder geometry [R. Menta et al., Phys. Rev. Research 7, L012065 (2025)]. Specifically, we examine how fabrication-induced inhomogeneities in qubit resonant frequencies and coupling strengths affect quantum state propagation and the fidelity of fundamental quantum operations. Using numerical simulations, we quantify the degradation in performance due to disorder and identify single-qubit rotations, two-qubit entangling gates, and quantum information transport as particularly susceptible. To address this challenge, we rely on pulse optimization schemes, and, in particular, on the GRAPE (Gradient Ascent Pulse Engineering) algorithm. Our results demonstrate that, even for realistic levels of disorder, optimized pulse sequences can achieve high-fidelity operations, exceeding 99.9% for the three quantum operations, restoring reliable universal quantum logic and robust information flow. These findings highlight pulse optimization as a powerful strategy to enhance the resilience to disorder of solid-state globally-driven quantum computing platforms.

quant-ph

Analog and Symbolic Computation through the Koopman Framework

We develop a Koopman operator framework for studying the {computational properties} of dynamical systems. Specifically, we show that the resolvent of the Koopman operator provides a natural abstraction of halting, yielding a ``Koopman halting problem that is recursively enumerable in general. For symbolic systems, such as those defined on Cantor space, this operator formulation captures the reachability between clopen sets, while for equicontinuous systems we prove that the Koopman halting problem is decidable. Our framework demonstrates that absorbing (halting) states {in finite automata} correspond to Koopman eigenfunctions with eigenvalue one, while cycles in the transition graph impose algebraic constraints on spectral properties. These results provide a unifying perspective on computation in symbolic and analog systems, showing how computational universality is reflected in operator spectra, invariant subspaces, and algebraic structures. Beyond symbolic dynamics, this operator-theoretic lens opens pathways to analyze {computational power of} a broader class of dynamical systems, including polynomial and analog models, and suggests that computational hardness may admit dynamical signatures in terms of Koopman spectral structure.

math-ph

Building globally controlled quantum processors with ZZ interactions

We present a comprehensive framework for constructing various architectures of globally driven quantum computers, with a focus on superconducting qubits. Our approach leverages static inhomogeneities in the Rabi frequencies of qubits controlled by a common classical pulse -- a technique we refer to as the "crossed-qubit" method. We detail the essential components and design principles required to realize such systems, highlighting how global control can be harnessed to perform local operations, enabling universal quantum computation. This framework offers a scalable pathway toward quantum processors by striking a balance between wiring complexity and computational efficiency, with potential applications in addressing current challenges to scalability.

quant-ph

Spectral Methods in Complex Systems

These notes offer a unified introduction to spectral methods for the study of complex systems. They are intended as an operative manual rather than a theorem-proof textbook: the emphasis is on tools, identities, and perspectives that can be readily applied across disciplines. Beginning with a compendium of matrix identities and inversion techniques, the text develops the connections between spectra, dynamics, and structure in finite-dimensional systems. Applications range from dynamical stability and random walks on networks to input-output economics, PageRank, epidemic spreading, memristive circuits, synchronization phenomena, and financial stability. Throughout, the guiding principle is that eigenvalues, eigenvectors, and resolvent operators provide a common language linking problems in physics, mathematics, computer science, and beyond. The presentation is informal, accessible to advanced undergraduates, yet broad enough to serve as a reference for researchers interested in spectral approaches to complex systems.

cond-mat.stat-mech

Self-Organising Memristive Networks as Physical Learning Systems

Learning with physical systems is an emerging paradigm that seeks to harness the intrinsic nonlinear dynamics of physical substrates for learning. The impetus for a paradigm shift in how hardware is used for computational intelligence stems largely from the unsustainability of artificial neural network software implemented on conventional transistor-based hardware. This Perspective highlights one promising approach using physical networks comprised of resistive memory nanoscale components with dynamically reconfigurable, self-organising electrical circuitry. Experimental advances have revealed the non-trivial interactions within these Self-Organising Memristive Networks (SOMNs), offering insights into their collective nonlinear and adaptive dynamics, and how these properties can be harnessed for learning using different hardware implementations. Theoretical approaches, including mean-field theory, graph theory, and concepts from disordered systems, reveal deeper insights into the dynamics of SOMNs, especially during transitions between different conductance states where criticality and other dynamical phase transitions emerge in both experiments and models. Furthermore, parallels between adaptive dynamics in SOMNs and plasticity in biological neuronal networks suggest the potential for realising energy-efficient, brain-like continual learning. SOMNs thus offer a promising route toward embedded edge intelligence, unlocking real-time decision-making for autonomous systems, dynamic sensing, and personalised healthcare, by embedding continuous learning in resource-constrained environments. The overarching aim of this Perspective is to show how the convergence of nanotechnology, statistical physics, complex systems, and self-organising principles offers a unique opportunity to advance a new generation of physical intelligence technologies.

cond-mat.dis-nn

Magnetic Memory and Hysteresis from Quantum Transitions: Theory and Experiments on Quantum Annealers

Quantum annealing leverages quantum tunneling for non-local searches, thereby minimizing memory effects that typically arise from metastabilities. Nonetheless, recent work has demonstrated robust hysteresis in large-scale transverse-field Ising systems implemented on D-Wave's analog quantum hardware. The quantum nature of these intriguing results remains to be understood at a deeper level. Here, we present a conceptual framework that explains the observed behavior by combining two-level Landau-Zener transitions via a first-order piecewise-constant propagator with semiclassical domain-wall kinetics. We test this approach experimentally on a quantum annealer, where we observe clear coercivity even in one-dimensional rings with periodic boundary conditions comprising up to 4,906 qubits-regimes where classical hysteresis is forbidden, but quantum hysteresis is not. Our framework reproduces the measured kink densities, hysteresis loop shapes, and longitudinal sweep-rate scaling trends observed in data from three different D-Wave quantum annealers. In particular, it captures striking non-monotonic features and transiently negative susceptibilities, identifying them as genuine quantum memory effects. These results establish programmable quantum annealers as powerful testbeds for exploring memory-endowed non-equilibrium dynamics in quantum many-body systems.

quant-ph

A unifying approach to self-organizing systems interacting via conservation laws

We present a unified framework for embedding and analyzing dynamical systems using generalized projection operators rooted in local conservation laws. By representing physical, biological, and engineered systems as graphs with incidence and cycle matrices, we derive dual projection operators that decompose network fluxes and potentials. This formalism aligns with principles of non-equilibrium thermodynamics and captures a broad class of systems governed by flux-forcing relationships and local constraints. We extend this approach to collective dynamics through the PRojective Embedding of Dynamical Systems (PrEDS), which lifts low-dimensional dynamics into a high-dimensional space, enabling both replication and recovery of the original dynamics. When systems fall within the PrEDS class, their collective behavior can be effectively approximated through projection onto a mean-field space. We demonstrate the versatility of PrEDS across diverse domains, including resistive and memristive circuits, adaptive flow networks (e.g., slime molds), elastic string networks, and particle swarms. Notably, we establish a direct correspondence between PrEDS and swarm dynamics, revealing new insights into optimization and self-organization. Our results offer a general theoretical foundation for analyzing complex networked systems and for designing systems that self-organize through local interactions.

cond-mat.soft

Voltage-Controlled Oscillator and Memristor-Based Analog Computing for Solving Systems of Linear Equations

Matrix computations have become increasingly significant in many data-driven applications. However, Moores law for digital computers has been gradually approaching its limit in recent years. Moreover, digital computers encounter substantial complexity when performing matrix computations and need a long time to finish the computations, and existing analog matrix computation schemes require a large chip area and power consumption. This paper proposes a linear algebra system of equations based on integrators, which features low power consumption, compact area, and fast computation time. Due to the simple structure of the ring oscillator, the ring oscillator-based integrator exhibits a compact area and low power consumption. Therefore, ring oscillator-based integrators are introduced into the linear algebra system of equations, and this system can be used to compute the linear algebra equations of the matrix with either positive or negative values. This paper provides a detailed analysis and verification of the proposed circuit structure. Compared to similar circuits, this work has significant advantages in terms of area, power consumption, and computation speed.

eess.SY

Classical Criticality via Quantum Annealing

Quantum annealing provides a powerful platform for simulating magnetic materials and realizing statistical physics models, presenting a compelling alternative to classical Monte Carlo methods. We demonstrate that quantum annealers can accurately reproduce phase diagrams and simulate critical phenomena without suffering from the critical slowing down that often affects classical algorithms. To illustrate this, we study the piled-up dominoes model, which interpolates between the ferromagnetic 2D Ising model and Villain's fully frustrated ``odd model''. We map out its phase diagram and for the first time, employ finite-size scaling and Binder cumulants on a quantum annealer to study critical exponents for thermal phase transitions. Our method achieves systematic temperature control by tuning the energy scale of the Hamiltonian, eliminating the need to adjust the physical temperature of the quantum hardware. This work demonstrates how, through fine-tuning and calibration, a quantum annealer can be employed to apply sophisticated finite-size scaling techniques from statistical mechanics. Our results establish quantum annealers as robust statistical physics simulators, offering a novel pathway for studying phase transitions and critical behavior.

cond-mat.stat-mech

DebtStreamness: An Ecological Approach to Credit Flows in Inter-Firm Networks

Understanding how credit flows through inter-firm networks is critical for assessing financial stability and systemic risk. In this study, we introduce DebtStreamness, a novel metric inspired by trophic levels in ecological food webs, to quantify the position of firms within credit chains. By viewing credit as the ``primary energy source'' of the economy, we measure how far credit travels through inter-firm relationships before reaching its final borrowers. Applying this framework to Uruguay's inter-firm credit network, using survey data from the Central Bank, we find that credit chains are generally short, with a tiered structure in which some firms act as intermediaries, lending to others further along the chain. We also find that local network motifs such as loops can substantially increase a firm's DebtStreamness, even when its direct borrowing from banks remains the same. Comparing our results with standard economic classifications based on input-output linkages, we find that DebtStreamness captures distinct financial structures not visible through production data. We further validate our approach using two maximum-entropy network reconstruction methods, demonstrating the robustness of DebtStreamness in capturing systemic credit structures. These results suggest that DebtStreamness offers a complementary ecological perspective on systemic credit risk and highlights the role of hidden financial intermediation in firm networks.

econ.GN