Searcharxiv⌕ Search

arXiv subjects

Sayan Das

Publications and source records attributed to Sayan Das.

At least 19 recordsLinked to original sources

Resolving and Suppressing Temporally Correlated Noise in Quantum Error Correction

Scaling fault-tolerant quantum error correction (QEC) requires suppressing errors in both space and time, yet standard logical memory experiments primarily probe spatial faults. Here, we use a 105-qubit Willow superconducting quantum processor to realize and scale the surface code stability experiment, which is alternatively sensitive to temporal error chains. Scaling from patch sizes of $3 \times 3$ to $7 \times 7$, we realize a timelike block suppression factor of $μ_T = 1.47 \pm 0.25$, demonstrating the ability to maintain temporal error suppression as the number of qubits increases. By extending the stability experiment for many cycles, we uncover a sum-of-exponentials behavior in error suppression caused by a temporally correlated error: data-qubit heating to the third excited state $|3\rangle$. We fully capture this effect with a parameter-free, device-level leakage model incorporating higher-state transport during syndrome extraction cycles. To suppress this error, we develop and realize a walking stability circuit, reaching a logical error probability floor of $\le 3.20\times 10^{-8}$ at 60 cycles---two orders of magnitude below the standard construction---and limited by ionizing radiation error bursts. Finally, by adaptively terminating syndrome extraction based on decoder confidence in an offline analysis, we reduce spacetime logical error by 38% and time overhead by 34% compared to the optimal fixed-cycle strategy.

quant-ph↗

SEDATE: Do Large Language Models Share an Aggression Circuit Across Languages?

As the applications of AI continue to expand across various multimodal and multilingual domains, ensuring safe and responsible deployment of these systems has become an important concern. A wide-range of interventions have been proposed to make AI responses safer and more reliable. They often incur substantial computational or annotation costs, or cannot be extended to multilingual settings. In this work, we propose Selective Detection And Targeted Editing (SEDATE), a training-free approach based on detect-edit-verify strategy. SEDATE first detects the responsible neurons, edits them as and when necessary and finally verifies the model responses; all without any additional model training. We evaluate SEDATE across 7 languages and 4 model families. We further evaluate its effectiveness across 4 out-of-distribution languages and 4 additional datasets. We show that SEDATE achieves substantially superior safety scores across all languages and models over the best-performing baseline while retaining the general capabilities and incurring negligible overhead. Our results are robust, with the trends remaining similar for out-of-distribution languages and datasets.

cs.CL↗

The half-space KPZ line ensemble and its scaling limit

For each $α\in \mathbb{R}, t\ge 1$, we show that there exists a unique $\mathbb{N}$-indexed line ensemble of random continuous curves $\mathbb{R}_{\le 0} \to \mathbb{R}$ with the following properties: (1) The top curve is distributed as the time-$t$ Cole--Hopf solution to the half-space KPZ equation with narrow wedge initial condition and Neumann boundary condition with parameter $α$. (2) The line ensemble satisfies a one-sided resampling invariance property, involving softly non-intersecting Brownian motions with an attractive potential between pairs at the boundary. We call this object the half-space KPZ line ensemble. For $α=μt^{-1/3}$ with $μ\in \mathbb{R}$ fixed (critical regime) and for $α>0$ fixed (supercritical regime), we show that the half-space KPZ line ensemble near the boundary is tight under 1:2:3 KPZ scaling as $t\to\infty$. Moreover, all subsequential limits approximate a parabola and enjoy a one-sided Brownian Gibbs property, described by non-intersecting Brownian motions with pairwise interaction at the boundary. In the supercritical case, one of the main technical contributions of this paper is the first rigorous demonstration of a structure involving pairwise pinned Brownian motions, previously conjectured in [BCD23]. Away from the boundary, we show that the half-space KPZ line ensemble converges to the (full-space) Airy line ensemble under 1:2:3 KPZ scaling as $t\to\infty$. A key ingredient in our arguments, which may be of independent interest, is a novel identity relating the full- and half-space KPZ equations, which may be valuable in deducing various geometric properties of the latter.

math.PR↗

Multifractal and Glassy Signatures of Non-Ergodic 2D Quantum Dynamics

The fate of ergodicity and localization in disordered, interacting quantum systems in two spatial dimensions remains an outstanding open problem in non-equilibrium physics. Theoretical and numerical approaches are severely constrained by exponential Hilbert space growth. Here, we leverage the high data-acquisition rates of superconducting quantum processors to extensively sample Hilbert space configurations, effectively imaging the state as a wavefunction network (WFN). Tracking the bitstring return probability across varied disorder strengths, we find heavy-tailed distributions and power-law typical decay characteristic of glassy relaxation. Furthermore, the distribution of bitstring probabilities transitions from a Porter-Thomas form at low disorder to an eight-decade power law at stronger disorder. In the reconstructed configuration space, WFN connectivity is compatible with a random geometric network at low disorder and becomes scale-free at stronger disorder. Finally, a multifractal analysis based on the binary intrinsic dimension (BID) reveals a non-ergodic regime where the wavefunction support saturates to a finite fraction of the total Hilbert space. Together, these results rule out a direct ergodic-to-localized transition, pointing instead to an extended multifractal regime. By visualizing wavefunction dynamics directly in configuration space, this work complements traditional real-space studies, showing the potential of quantum processors to resolve long-standing questions in non-equilibrium physics.

quant-ph↗

Solving marginals of the LDP for the directed landscape

We identify the explicit rate function for the upper-tail LDP of the parabolic Airy process and characterize the minimizing metrics, or equivalently the limit shape of the directed landscape, under the upper-tail conditioning. The LDP result answers Conjecture 10.1 in Das, Dauvergne, and Virág (2024, DDV), and the limit shape result gives the first proof of the limit shape in similar contexts beyond the case where the minimizer is piecewise linear. The starting point of our proof is the metric-level LDP for the directed landscape from DDV that reduces our work to solving a variational problem. Our proof demonstrates how the variational problem fits into the Jensen-Varadhan theory of hydrodynamic large deviations Jensen (2000), Varadhan (2004). The proof is PDE-based and uses geometric arguments, connecting the variational problem to weak solutions of Burgers' equation, and may be generalized to those models in the KPZ universality class that enjoy similar metric-level LDPs proven in DDV.

math.PR↗

Berry--Esseen bounds and bootstrap approximations for the Hilbert-space norm of $U$-statistics

We establish non-asymptotic Berry--Esseen bounds and bootstrap approximations for the Hilbert-space norm of nondegenerate $U$-statistics. Our triangular-array framework allows the kernel to take values in a separable Hilbert space $H_n$ that may vary with the sample size, thereby covering both infinite-dimensional spaces and Euclidean spaces of increasing dimension. The Gaussian approximation combines a Hilbert-space version of Stein's method with refined control of the higher-order terms in the Hoeffding decomposition. Its error depends on fourth moments of the kernel and on the spectral geometry of the covariance operator of the Hájek projection, particularly the proportion of squared spectral mass lying outside the leading eigendirection. Consequently, the theory accommodates singular and approximately low-rank covariance operators, provided that sufficient spectral mass remains beyond the leading direction. For $H_n=\mathbb{R}^{d_n}$, we obtain dimension-explicit bounds under coordinatewise fourth-moment conditions. We also establish approximation bounds for the empirical, Gaussian-weighted, and jackknife multiplier bootstraps, yielding tests with asymptotically correct size and consistency against alternatives at covariance-dependent separation rates. For testing the vector of pairwise Kendall's tau coefficients, a matching minimax lower bound shows that the resulting separation rate is minimax rate-optimal over dense Gaussian correlation alternatives.

math.ST↗

Fast high-dimensional mean testing via logistic regression

We propose computationally efficient tests for equality of mean vectors of two or more high-dimensional populations. Central to our approach is an equivalence between equality of means and a zero population logistic regression parameter. We establish this equivalence for independently distributed observations without imposing common distributional assumptions across populations. Our procedure uses logistic Lasso to screen informative variables and an unpenalized logistic refit for inference in the reduced dimension, yielding asymptotically correct size and consistency. For a specified two-sample Gaussian submodel and sparse discriminative class, the test also attains the minimax separation rate. The framework extends to multiple populations through multi-class logistic regression. Simulations demonstrate accurate size control, strong power, and favorable computational scaling compared with existing tests under unbalanced designs and variance heterogeneity. Applications to gene-expression data with more than twenty-two thousand variables illustrate the practical scalability of the proposed procedures.

stat.ME↗

Testing Microbiome Community Differences in High Dimensions: A Bootstrap Approach for Compositional Data

Understanding differences in microbial community structure is critical for uncovering risk factors and mechanisms underlying diseases such as colorectal cancer and preterm birth. Microbiome data present unique statistical challenges because they are compositional in nature, violating assumptions of many classical inference procedures. We propose an empirical bootstrap framework that enables robust hypothesis testing for equality of microbial community means across groups, including two-sample, paired, and multi-sample settings. The method accounts for the simplex structure of microbiome data and provides valid inference even in high-dimensional regimes. Through applications to two large-scale studies, fecal microbiota in colorectal adenoma and cancer patients, and vaginal microbiota in pregnancy with preterm birth outcomes-we demonstrate that our approach identifies clinically meaningful differences that conventional methods fail to detect, such as age-related differences in adenoma prevalence and race-associated disparities in vaginal microbiome composition. These results highlight the potential of resampling-based inference for advancing microbiome research, improving reproducibility, and uncovering clinically relevant microbial signatures.

stat.ME↗

Precision quantum simulation of magnon spectra and interactions

Quantum simulation promises to advance materials discovery by accurately simulating complex states of matter, their microscopic excitations, and macroscopic response functions. The central challenge in resolving the underlying interacting dynamics is to combine high-fidelity evolution with the sophisticated control necessary to manipulate individual quasi-particles in quantum many-body states. Here, we report on high-precision simulation of both linear and non-linear response functions in a 2D XY spin-1/2 magnet using an analog-digital superconducting processor of up to 97 qubits. By interleaving digital gates with analog evolution precisely characterized via Hamiltonian learning, we selectively excite magnons at tunable energy densities. Measuring first the linear magnon response -- a central probe in neutron-scattering experiments -- we extract temperature-dependent spectra and lifetimes. Our results reveal stark variations in magnon decay rates across the Brillouin zone, with enhancement near van Hove singularities and suppression for edge-localized modes. Next, we perform a suite of nonlinear measurements, including the study of self-scattering mechanisms, as well as pump-probe spectroscopy to directly characterize the magnon interactions. While matrix-product state simulations capture the dynamics well in either small systems or at low temperatures, their predictions become inaccurate away from these limits. This work demonstrates precise simulation of the interacting dynamics in quantum magnets, and provides key insights into quasi-particles and their microscopic scattering mechanisms.

quant-ph↗

Memory-like effects and kinematics of trajectories in Cyclotron motion

We investigate the collective dynamics of a bundle of charged particles undergoing cyclotron motion in a uniform magnetic field when subjected to a short-duration electric pulse. Using the geometric framework based on the evolution of trajectory congruences, we analyze how the pulse affects the expansion, shear, and rotation of a small family of trajectories. We show that the geometric imprint persists after the pulse has vanished, manifesting as a memory of the transient perturbation. Unlike gravitational memory effects, this does not manifest itself in focusing behaviour of the trajectories, and instead implies a restructuring of the shear component before and after the pulse. We offer direct analytic and regression based arguments for the same.

physics.class-ph↗

On Optimal Data Splitting for Split Conformal Prediction

Conformal prediction and its variants, including the split conformal prediction, provide a distribution-free framework for uncertainty quantification by constructing prediction intervals or sets with finite-sample coverage guarantees. The statistical efficiency of these intervals depends critically on how the data are split into training and calibration samples. Despite its practical importance, a principled characterization of the training-calibration split that minimizes prediction interval length while maintaining coverage has remained largely unresolved. In this paper, we develop a theoretical framework for optimal data splitting in split conformal prediction. We first analyze the problem in a general setting and derive analytical characterizations of the length-optimal split ratio under both symmetric and asymmetric regimes. We then show how the general results specialize to several commonly used regression settings, including linear regression, nonparametric regression, and neural networks, thereby demonstrating the scope of the framework. We also describe a data-based method for selecting the optimal proportion. Our analysis clarifies how model-related features govern the optimal allocation of samples between training and calibration and provides principled guidance for constructing shorter prediction intervals. Experiments on both synthetic and real-world datasets demonstrate the applicability of the proposed methodology across a variety of practical scenarios.

math.ST↗

Reinforcement Learning Control of Quantum Error Correction

Quantum error correction (QEC) is the primary strategy for protecting a quantum computer from the environment. Its prerequisite is that errors must remain sufficiently rare, which requires perpetually adapting the computer's control parameters to the drifting environment conditions. The current solution to this problem is to terminate the entire quantum computation for recalibration, but it is incompatible with the long runtimes of future quantum algorithms. We address this challenge by unifying calibration with computation. We grant the QEC process a dual role: its error detection events are not only used to correct the logical quantum state, but are also repurposed as a learning signal, teaching a reinforcement learning (RL) agent to continuously steer the control parameters and stabilize the quantum system during computation. We experimentally demonstrate this framework on a Willow superconducting processor, improving the logical stability of the surface code 3.5-fold against injected drift. By synthesizing our full suite of technological advances, we achieve record performance of the surface and color codes, with average logical error per cycle of $7.72(9)\times10^{-4}$ and $8.19(14)\times10^{-3}$ respectively. Numerical simulations of large codes with tens of thousands of control parameters confirm the scalability of our RL framework, revealing an optimization speed that is independent of system size. This work thus enables a new paradigm: a quantum computer that learns from its errors and never stops computing.

quant-ph↗

Krylov Complexity: Flat bands and Carroll breaking deformations

Systems with flat band structures, when written in the language of Compact Localised States (CLS), have been shown to be explicitly invariant under supertranslation symmetries, making Carrollian symmetries inherently important for such systems. In this work, we explore the state dynamics of these systems, focusing on quenches induced by Carroll breaking perturbations, through the probe of Krylov (spread) Complexity. We specialise to Fermionic ladder Hamiltonians with all bands flat (ABF) scenario, augmented by a supertranslation preserving interaction, and discuss Krylov state complexity for quenches across critical lines. We further discuss how the growth of Krylov complexity sharply resolves the phase-dependent resilience of Carrollian sectors against delocalising perturbations. This is augmented by a complementary mechanism for Krylov growth in a continuum Carroll scalar field theory with a gradient deformation, which exhibits strong ultraviolet sensitivity (UV/IR mixing).

hep-th↗

Invariant measures for half-space geometric LPP: classification and the one force--one solution principle

We prove a complete characterization of the extremal invariant measures for half-space geometric last-passage percolation with an arbitrary boundary parameter. This is the first result of its kind for a model in the KPZ universality class that has boundary effects and an unbounded domain. A description of a class of invariant measures was previously given in a work of Barraquand and Corwin, where it was conjectured that these should comprise all extremal invariant measures. To complete the classification, we prove a one force--one solution principle: when started in the distant past from an arbitrary initial condition with a given asymptotic slope at $\infty$, the recentered solution at time $0$ converges to a process which is distributed as the associated invariant measure with the specified slope. This limiting process is called the Busemann process, the first of its kind constructed for a half-space model. The Busemann process across all slopes is distributed as the joint invariant measure for geometric half-space LPP, recently constructed by Dauvergne and Zhang. There, it was conjectured that the constructed family of jointly invariant measures comprises all extremal jointly invariant measures; our analysis also confirms this conjecture. When the model has a strong (attractive) boundary, the collection of slopes for the invariant measures has a discontinuity, which does not arise in the full-space case. To handle this difficulty, we combine the control of the directions of semi-infinite geodesics with techniques from the theory of half-space Gibbsian line ensembles. Along the way, we classify the set of directions of semi-infinite geodesics for half-space geometric LPP, confirming a recent conjecture of Dauvergne and Zhang.

math.PR↗

Pinning in non-critical half-space geometric last passage percolation

We study a symmetrized (half-space) version of geometric last passage percolation with a boundary parameter $c$ that interpolates between subcritical, critical, and supercritical behavior. This model gives rise to a family of interlacing random curves, or a line ensemble, which encode both the usual last passage time and its higher-rank analogues. Although these ensembles are understood in most space-time regions, their behavior near the diagonal -- where the boundary effects are strongest -- has remained unclear outside the critical regime. We determine the universal scaling limits of the line ensemble in this near-diagonal region for both subcritical ($c < 1$) and supercritical ($c > 1$) phases. In the subcritical case, after appropriate centering and scaling, the entire line ensemble converges to the pinned half-space Airy line ensemble, a universal Brownian Gibbsian object recently constructed as a canonical limit for half-space models in the KPZ universality class in arXiv:2601.04546. In the supercritical case, we prove an analogous convergence together with a curve-separation phenomenon: the lower curves converge to the same pinned half-space Airy limit, while the top curve decouples and converges to Brownian motion. These results essentially complete the asymptotic description of half-space geometric last passage percolation and provide a new rigorous instance of the pinned half-space Airy line ensemble as a universal scaling limit.

math.PR↗

Observation of disorder-induced superfluidity

The emergence of states with long-range correlations in a disordered landscape is rare, as disorder typically suppresses the particle mobility required for long-range coherence. But when more than two energy levels are available per site, disorder can induce resonances that locally enhance mobility. Here we explore phases arising from the interplay between disorder, kinetic energy, and interactions on a superconducting processor with qutrit readout and control. Compressibility measurements distinguish an incompressible Mott insulator from surrounding compressible phases and reveal signatures of glassiness, reflected in non-ergodic behavior. Spatially-resolved two-point correlator measurements identify regions of the phase diagram with a non-vanishing condensate fraction. We also visualize the spectrum by measuring the dynamical structure factor. A linearly-dispersing phonon mode materializes in the superfluid, appearing even when disorder is introduced to the clean Mott insulator. Our results provide strong experimental evidence for disorder-induced superfluidity.

quant-ph↗

Magic state cultivation on a superconducting quantum processor

Fault-tolerant quantum computing requires a universal gate set, but the necessary non-Clifford gates represent a significant resource cost for most quantum error correction architectures. Magic state cultivation offers an efficient alternative to resource-intensive distillation protocols; however, testing the proposal's assumptions represents a challenging departure from quantum memory experiments. We present an experimental study of magic state cultivation on a superconducting quantum processor. We implement cultivation, including code-switching into a surface code, and develop a fault-tolerant measurement protocol to bound the magic state fidelity. Cultivation reduces the error by a factor of 40, with a state fidelity of 0.9999(1) (retaining 8% of attempts). Our results experimentally establish magic state cultivation as a viable solution to one of quantum computing's most significant challenges.

quant-ph↗

Novel Deep Learning Architectures for Classification and Segmentation of Brain Tumors from MRI Images

Brain tumors pose a significant threat to human life, therefore it is very much necessary to detect them accurately in the early stages for better diagnosis and treatment. Brain tumors can be detected by the radiologist manually from the MRI scan images of the patients. However, the incidence of brain tumors has risen amongst children and adolescents in recent years, resulting in a substantial volume of data, as a result, it is time-consuming and difficult to detect manually. With the emergence of Artificial intelligence in the modern world and its vast application in the medical field, we can make an approach to the CAD (Computer Aided Diagnosis) system for the early detection of Brain tumors automatically. All the existing models for this task are not completely generalized and perform poorly on the validation data. So, we have proposed two novel Deep Learning Architectures - (a) SAETCN (Self-Attention Enhancement Tumor Classification Network) for the classification of different kinds of brain tumors. We have achieved an accuracy of 99.38% on the validation dataset making it one of the few Novel Deep learning-based architecture that is capable of detecting brain tumors accurately. We have trained the model on the dataset, which contains images of 3 types of tumors (glioma, meningioma, and pituitary tumors) and non-tumor cases. and (b) SAS-Net (Self-Attentive Segmentation Network) for the accurate segmentation of brain tumors. We have achieved an overall pixel accuracy of 99.23%.

cs.CV↗