arXiv subjects

Pratik Sathe

Publications and source records attributed to Pratik Sathe.

At least 19 recordsLinked to original sources

arXiv2026

Analog-Digital Quantum Computing with Quantum Annealing Processors

Quantum annealing processors typically control qubits in unison, attenuating quantum fluctuations uniformly until the applied system Hamiltonian is diagonal in the computational basis. This simplifies control requirements, allowing annealing QPUs to scale to much larger sizes than gate-based systems, but constraining the class of available operations. Here we expand the class by performing analog-digital quantum computing in a highly-multiplexed, superconducting quantum annealing processor. This involves evolution under a fixed many-body Hamiltonian that, in the weak-coupling regime, is well-described by an effective XY model, together with arbitrary-basis initialization and measurement via auxiliary qubits. Operationally, this is equivalent to implementing single-qubit gates at the beginning and end of an analog quantum evolution. We demonstrate this capability with several foundational applications: single-qubit and two-qubit coherent oscillations with varying initialization and measurement bases, a multi-qubit quantum walk with fermionic dispersion in line with theory, and Anderson localization in a disordered chain. These experiments open the door to a wide range of new possibilities in quantum computation and simulation, greatly expanding the applications of commercially available quantum annealing processors.

quant-ph↗

arXiv2025

Classical Thermometry of Quantum Annealers

Quantum annealers are emerging as programmable, dynamical experimental platforms for probing strongly correlated spin systems. Yet key thermal assumptions, chiefly a Gibbs-distributed output ensemble, remain unverified in the large-scale regime. Here, we experimentally and quantitatively assess Gibbs sampling fidelity across system sizes spanning over three orders of magnitude. We explore a wide parameter space of coupling strengths, system sizes, annealing times, and D-wave hardware architectures. We find that the naively assumed scaling law for the effective temperature requires a non-negligible, coupling-independent offset that is robust across machines and parameter regimes, quantifying residual non-thermal effects that still conform to an effective Gibbs description. These non-idealities are further reflected in a systematic discrepancy between the physical temperature inferred from the sampled ensemble and the nominal cryogenic temperature of the device. Our results systematically assess the viability of quantum annealers as experimental platforms for probing classical thermodynamics, correct previous assumptions, and provide a physically grounded thermometry framework to benchmark these machines for future thermodynamic experiments.

quant-ph↗

arXiv2025

Probing Antiferromagnetic Hysteresis on Programmable Quantum Annealers

Using programmable analog quantum annealing processors, we implement a sampling-based magnetic hysteresis protocol to probe the counterintuitive notion of magnetic memory in antiferromagnetic models. A key component of this protocol responsible for the hysteresis is a transverse field, which enables state transitions, while the longitudinal magnetic field sweep is done via a longitudinal control field. We observe intriguing non-monotonic magnetization, alongside full saturation and reversal of the hysteresis curve, Barkhausen-like noise, as well as emergent magnetic domains mediated by quantum fluctuations that give rise to the magnetic memory effect in antiferromagnets.

quant-ph↗

arXiv2025

Uncovering and Circumventing Noise in Quantum Algorithms via Metastability

The presence of noise is the primary challenge in realizing fault-tolerant quantum computers. In this work, we introduce and experimentally validate a novel strategy to circumvent noise by exploiting the phenomenon of metastability, where a dynamical system exhibits a separation of time scales in its evolution. We demonstrate that if quantum hardware noise exhibits metastability, both digital and analog algorithms can be designed in a noise-aware fashion to achieve intrinsic resilience. We develop a general theoretical framework and introduce an efficiently computable noise vulnerability metric that avoids the need for full classical simulation of the quantum algorithm. We show that the noise vulnerability index bounds errors in noisy implementations, with smaller values indicating greater fidelity between the achieved and target quantum states. We illustrate the use of our framework with applications to variational quantum algorithms and analog adiabatic state preparation. Crucially, we provide experimental evidence supporting the presence of metastable noise in gate-model quantum processors and quantum annealing devices. Thus, we establish that the noise properties in near-term quantum hardware can directly inform practical implementation strategies, enabling the preparation of final noisy states that more closely approximate the ideal ones.

quant-ph↗

arXiv2025

Universal localization-delocalization transition in chiral-symmetric Floquet drives

Periodically driven systems often exhibit behavior distinct from static systems. In single-particle, static systems, any amount of disorder generically localizes all eigenstates in one dimension. In contrast, we show that in topologically nontrivial, single-particle Floquet loop drives with chiral symmetry in one dimension, a localization-delocalization transition occurs as the time $t$ is varied within the driving period ($0 \le t \le \td$). We find that the time-dependent localization length $\lloc(t)$ diverges with a universal exponent as $t$ approaches the midpoint of the drive: $\lloc(t) \sim (t - \td/2)^{-ν}$ with $ν=2$. We provide analytical and numerical evidence for the universality of this exponent within the AIII symmetry class.

cond-mat.dis-nn↗

arXiv2025

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↗

arXiv2025

Magnetic Hysteresis Experiments Performed on Quantum Annealers

While quantum annealers have emerged as versatile and controllable platforms for experimenting on correlated spin systems, the important phenomenology of magnetic memory and hysteresis remain unexplored on hardware designed to escape metastable states via quantum tunneling. Here, we present the first general protocol to experiment on magnetic hysteresis on programmable quantum annealers, and implement it on three D-Wave superconducting qubit quantum annealers, using up to thousands of spins, for both ferromagnetic and disordered Ising models, and across different graph topologies. We observe hysteresis loops whose area depends non-monotonically on quantum fluctuations, exhibiting both expected and unexpected features, such as disorder-induced steps and non-monotonicities. Our work establishes quantum annealers as a platform for probing non-equilibrium emergent magnetic phenomena, thereby broadening the role of analog quantum computers into foundational questions in condensed matter physics.

quant-ph↗

arXiv2025

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↗

arXiv2024

A Comprehensive Cross-Model Framework for Benchmarking the Performance of Quantum Hamiltonian Simulations

Quantum Hamiltonian simulation is one of the most promising applications of quantum computing and forms the basis for many quantum algorithms. Benchmarking them is an important gauge of progress in quantum computing technology. We present a methodology and software framework to evaluate various facets of the performance of gate-based quantum computers on Trotterized quantum Hamiltonian evolution. We propose three distinct modes for benchmarking: (i) comparing simulation on a real device to that on a noiseless classical simulator, (ii) comparing simulation on a real device with exact diagonalization results, and (iii) using scalable mirror circuit techniques to assess hardware performance in scenarios beyond classical simulation methods. We demonstrate this framework on five Hamiltonian models from the HamLib library: the Fermi and Bose-Hubbard models, the transverse field Ising model, the Heisenberg model, and the Max3SAT problem. Experiments were conducted using Qiskit's Aer simulator, BlueQubit's CPU cluster and GPU simulators, and IBM's quantum hardware. Our framework, extendable to other Hamiltonians, provides comprehensive performance profiles that reveal hardware and algorithmic limitations and measure both fidelity and execution times, identifying crossover points where quantum hardware outperforms CPU/GPU simulators.

quant-ph↗

arXiv2024

Universally-Charging Protocols for Quantum Batteries: A No-Go Theorem

The effectiveness of a quantum battery relies on a robust charging process, yet these are often sensitive to initial state of the battery. We introduce the concept of a universally-charging (UC) protocol, defined as one that either increases or maintains the average battery energy for all initial states, without ever decreasing it. We show that UC protocols are impossible for closed quantum batteries, thus necessitating interactions with auxilliary quantum systems. To that end, we prove a no-go theorem which prohibits UC protocols for closed quantum batteries with finite-dimensional Hilbert spaces. Leveraging a no-go theorem for topological quantum walks, we argue that even for infinite-dimensional Hilbert spaces, while unitary UC operators exist, they cannot be generated by physically reasonable Hamiltonian protocols. However, regardless of the dimension, non-unitary UC protocols can be achieved in open quantum batteries. To illustrate this, we present a general model with a control qubit, whose state interpolates between universal-charging and universal-discharging protocols.

quant-ph↗

arXiv2024

Quantum Uncertainty Relations for Thermodynamic Energy Flows

The Heisenberg uncertainty relation, which links the uncertainties of the position and momentum of a particle, has an important footprint on the quantum behavior of a physical system. Analogous to this principle, we propose that thermodynamic currents associated with work, heat, and internal energy satisfy their own uncertainty relations. To formalize this idea, we represent these currents by well-defined Hermitian operators, constructed so that their expectation values match the corresponding average currents. Because these operators generally do not commute, the resulting quantum currents differ fundamentally from their classical counterparts. Using the Robertson-Schr\"odinger uncertainty relation, we derive various uncertainty relations that link different thermodynamic flows. We further illustrate this approach by applying it to quantum batteries, where we derive an energy-power uncertainty relationship and show how measurements affect the fluctuations.

quant-ph↗

arXiv2024

Scattering Expansion for Localization in One Dimension: from Disordered Wires to Quantum Walks

We present a perturbative approach to disordered systems in one spatial dimension that accesses the full range of phase disorder and clarifies the connection between localization and phase information. We consider a long chain of identically disordered scatterers and expand in the reflection strength of any individual scatterer. We apply this expansion to several examples, including the Anderson model, a general class of periodic-on-average-random potentials, and a two-component discrete-time quantum walk, showing analytically in the latter case that the localization length can depend non-monotonically on the strength of phase disorder (whereas expanding in weak disorder yields monotonic decrease). More generally, we obtain to all orders in the expansion a particular non-separable form for the joint probability distribution of the transmission coefficient logarithm and reflection phase. Furthermore, we show that for weak local reflection strength, a version of the scaling theory of localization holds: the joint distribution is determined by just three parameters.

cond-mat.dis-nn↗

arXiv2024

Scattering Expansion for Localization in One Dimension

We present a perturbative approach to disordered systems in one spatial dimension that accesses the full range of phase disorder and clarifies the connection between localization and phase information. We consider a long chain of identically disordered scatterers and expand in the reflection strength of any individual scatterer. As an example application, we show analytically that in a discrete-time quantum walk, the localization length can depend non-monotonically on the strength of phase disorder (whereas expanding in weak disorder yields monotonic decrease). More generally, we obtain to all orders in the expansion a particular non-separable form for the joint probability distribution of the transmission coefficient logarithm and reflection phase. Furthermore, we show that for weak local reflection strength, a version of the scaling theory of localization holds: the joint distribution is determined by just three parameters.

cond-mat.dis-nn↗

arXiv2024

Benchmarking the Operation of Quantum Heuristics and Ising Machines: Scoring Parameter Setting Strategies on Optimization Applications

We discuss guidelines for evaluating the performance of parameterized stochastic solvers for optimization problems, with particular attention to systems that employ novel hardware, such as digital quantum processors running variational algorithms, analog processors performing quantum annealing, or coherent Ising Machines. We illustrate through an example a benchmarking procedure grounded in the statistical analysis of the expectation of a given performance metric measured in a test environment. In particular, we discuss the necessity and cost of setting parameters that affect the algorithm's performance. The optimal value of these parameters could vary significantly between instances of the same target problem. We present an open-source software package that facilitates the design, evaluation, and visualization of practical parameter tuning strategies for complex use of the heterogeneous components of the solver. We examine in detail an example using parallel tempering and a simulator of a photonic Coherent Ising Machine computing and display the scoring of an illustrative baseline family of parameter-setting strategies that feature an exploration-exploitation trade-off.

quant-ph↗

arXiv2024

Compact Wannier Functions in One Dimension

Wannier functions have widespread utility in condensed matter physics and beyond. Topological physics, on the other hand, has largely involved the related notion of compactly-supported Wannier-type functions, which arise naturally in flat bands. In this paper, we establish a connection between these two notions, by finding the necessary and sufficient conditions under which compact Wannier functions exist in one dimension. We present an exhaustive construction of models with compact Wannier functions and show that the Wannier functions are unique, and in general, distinct from the corresponding maximally-localized Wannier functions.

cond-mat.mes-hall↗

arXiv2024

Optimization Applications as Quantum Performance Benchmarks

Combinatorial optimization is anticipated to be one of the primary use cases for quantum computation in the coming years. The Quantum Approximate Optimization Algorithm (QAOA) and Quantum Annealing (QA) can potentially demonstrate significant run-time performance benefits over current state-of-the-art solutions. Inspired by existing methods to characterize classical optimization algorithms, we analyze the solution quality obtained by solving Max-Cut problems using gate-model quantum devices and a quantum annealing device. This is used to guide the development of an advanced benchmarking framework for quantum computers designed to evaluate the trade-off between run-time execution performance and the solution quality for iterative hybrid quantum-classical applications. The framework generates performance profiles through compelling visualizations that show performance progression as a function of time for various problem sizes and illustrates algorithm limitations uncovered by the benchmarking approach. As an illustration, we explore the factors that influence quantum computing system throughput, using results obtained through execution on various quantum simulators and quantum hardware systems.

quant-ph↗

arXiv2023

Topological Triviality of Flat Hamiltonians

Landau levels play a key role in theoretical models of the quantum Hall effect. Each Landau level is degenerate, flat and topologically non-trivial. Motivated by Landau levels, we study tight-binding Hamiltonians whose energy levels are all flat. We demonstrate that in two dimensions, for such Hamiltonians, the flat bands must be topologically trivial. To that end, we show that the projector onto each flat band is necessarily strictly local. Our conclusions do not need the assumption of lattice translational invariance.

cond-mat.mes-hall↗

arXiv2021

Compactly Supported Wannier Functions and Strictly Local Projectors

Wannier functions that are maximally localized help in understanding many properties of crystalline materials. In the absence of topological obstructions, they are at least exponentially localized. In some cases such as flat-band Hamiltonians, it is possible to construct Wannier functions that are even more localized, so that they are compactly supported thus having zero support outside their corresponding locations. Under what general conditions is it possible to construct compactly supported Wannier functions? We answer this question in this paper. Specifically, we show that in 1d non-interacting tight-binding models, strict locality of the projection operator is a necessary and sufficient condition for a subspace to be spanned by a compactly supported orthogonal basis, independent of lattice translation symmetry. For any strictly local projector, we provide a procedure for obtaining such a basis. For higher dimensional systems, we discuss some additional conditions under which an occupied subspace is spanned by a compactly supported orthogonal basis, and show that the corresponding projectors are topologically trivial in many cases. We also show that a projector in arbitrary dimensions is strictly local if and only if for any chosen axis, its image is spanned by hybrid Wannier functions that are compactly supported along that axis.

cond-mat.mes-hall↗