arXiv subjects

Nathan Keenan

Publications and source records attributed to Nathan Keenan.

8 recordsLinked to original sources

arXiv2026

Storage, Scrambling, and Loss of Information in the Quantum Reservoir Computing Paradigm

The suitability of a quantum reservoir computing (QRC) platform for a given time-series processing task is closely tied to the dynamical properties of its computational substrate and design. Information is injected into, processed by, and read from this substrate, and finally passed to a linear readout layer which is trained to perform a specific task. In this work we introduce a classical-quantum state derived from the process tensor representing the dynamical part of this process for typical QRC protocols found in the literature. Using this object, mutual informations between physical subsystems and subsets of past inputs can be written as Holevo quantities, which we then use to numerically investigate information saturation in the substrate, fading memory of past inputs, and the local accessibility of injected information for a commonly used QRC platform. We then extract two diagnostics that characterise the nonlocal scrambling of information within, and loss of information from the substrate, and compare these to QRC performance across Hamiltonian parameters and measurement strengths. Finally, we comment on future directions that the framework introduced here opens up for the study and extension of the QRC program.

quant-ph↗

arXiv2026

$σ$-VQE: Excited-state preparation of quantum many-body scars with shallow circuits

We present and benchmark a type of variational quantum eigensolver (VQE), which we denote $σ$-VQE. It is designed to target mid-spectrum eigenstates and prepare quantum many-body scar states. The approach leverages the fact that noisy intermediate-scale quantum devices are limited in their ability to generate generic highly entangled states. This modified VQE pairs a low-depth circuit with an energy-selective objective that explicitly penalizes energy variance around a chosen target energy. The cost function exploits the limited expressibility of the shallow circuit as atypical low-entanglement eigenstates such as scar states are preferentially selected. We validate this mechanism across two complementary families of models that contain many-body scar states: the Shiraishi-Mori embedding approach and a matrix product state parent Hamiltonian construction. We define an unbiased estimation scheme for the nonlinear cost function that is compatible with qubit-wise commuting grouping and bitstring reuse. A proof-of-principle demonstration using a small-system instance was performed on IBM Fez (Heron r2 QPU). These results motivate its use as a practical algorithm for detecting quantum many-body scars and variationally generating states with appreciable scar state overlap.

quant-ph↗

arXiv2025

A Random Matrix Theory of Pauli Tomography

Quantum state tomography (QST), the process of reconstructing some unknown quantum state $\hatρ$ from repeated measurements on copies of said state, is a foundationally important task in the context of quantum computation and simulation. For this reason, a detailed characterization of the error $Δ\hatρ= \hatρ-\hatρ^\prime$ in a QST reconstruction $\hatρ^\prime$ is of clear importance to quantum theory and experiment. In this work, we develop a fully random matrix theory (RMT) treatment of state tomography in informationally-complete bases; and in doing so we reveal deep connections between QST errors $Δ\hatρ$ and the gaussian unitary ensemble (GUE). By exploiting this connection we prove that wide classes of functions of the spectrum of $Δ\hatρ$ can be evaluated by substituting samples of an appropriate GUE for realizations of $Δ\hatρ$. This powerful and flexible result enables simple analytic treatments of the mean value and variance of the error as quantified by the trace distance $\|Δ\hatρ\|_\mathrm{Tr}$ (which we validate numerically for common tomographic protocols), allows us to derive a bound on the QST sample complexity, and subsequently demonstrate that said bound doesn't change under the most widely-used rephysicalization procedure. These results collectively demonstrate the flexibility, strength, and broad applicability of our approach; and lays the foundation for broader studies of RMT treatments of QST in the future.

quant-ph↗

arXiv2025

Realization of Two-dimensional Discrete Time Crystals with Anisotropic Heisenberg Coupling

A discrete time crystal (DTC) is the paradigmatic example of a phase of matter that occurs exclusively in systems out of equilibrium. This phenomenon is characterized by the spontaneous symmetry breaking of discrete time-translation and provides a rich playground to study a fundamental question in statistical physics: what mechanism allows for driven quantum systems to exhibit emergent behavior that deviates from their counterparts with time-independent evolution? Unlike equilibrium phases, DTCs exhibit macroscopic manifestations of coherent quantum dynamics, challenging the conventional narrative that thermodynamic behavior universally erases quantum signatures. However, due to the difficulty of simulating these systems with either classical or quantum computers, previous studies have been limited to a set of models with Ising-like couplings -- and mostly only in one dimension -- thus precluding our understanding of the existence (or not) of DTCs in models with interactions that closely align with what occurs in nature. In this work, by combining the latest generation of IBM quantum processors with state-of-the-art tensor network methods, we are able to demonstrate the existence of a DTC in a two-dimensional system governed by anisotropic Heisenberg interactions. Our comprehensive analysis reveals a rich phase diagram encompassing spin-glass, ergodic, and time-crystalline phases, highlighting the tunability of these phases through multiple control parameters. Crucially, our results emphasize the interplay of initialization, interaction anisotropy, and driving protocols in stabilizing the DTC phase. By extending the study of Floquet matter beyond simplified models, we lay the groundwork for exploring how driven systems bridge the gap between quantum coherence and emergent non-equilibrium thermodynamics.

quant-ph↗

arXiv2024

Dynamical simulations of many-body quantum chaos on a quantum computer

Quantum circuits with local unitaries have emerged as a rich playground for the exploration of many-body quantum dynamics of discrete-time systems. While the intrinsic locality makes them particularly suited to run on current quantum processors, the task of verification at non-trivial scales is complicated for non-integrable systems. Here, we study a special class of maximally chaotic circuits known as dual unitary circuits -- exhibiting unitarity in both space and time -- that are known to have exact analytical solutions for certain correlation functions. With advances in noise learning and the implementation of novel error mitigation methods, we show that a superconducting quantum processor with 91 qubits is able to accurately simulate these correlators. We then probe dynamics beyond exact verification, by perturbing the circuits away from the dual unitary point, and compare our results to classical approximations with tensor networks. These results cement error-mitigated digital quantum simulation on pre-fault-tolerant quantum processors as a trustworthy platform for the exploration and discovery of novel emergent quantum many-body phases.

quant-ph↗

arXiv2024

Tensor Network enhanced Dynamic Multiproduct Formulas

Tensor networks and quantum computation are two of the most powerful tools for the simulation of quantum many-body systems. Rather than viewing them as competing approaches, here we consider how these two methods can work in tandem. We introduce a novel algorithm that combines tensor networks and quantum computation to produce results that are more accurate than what could be achieved by either method used in isolation. Our algorithm is based on multiproduct formulas (MPF) - a technique that linearly combines Trotter product formulas to reduce algorithmic error. Our algorithm uses a quantum computer to calculate the expectation values and tensor networks to calculate the coefficients used in the linear combination. We present a detailed error analysis of the algorithm and demonstrate the full workflow on a one-dimensional quantum simulation problem on $50$ qubits using two IBM quantum computers: $ibm\_torino$ and $ibm\_kyiv$.

quant-ph↗

arXiv2024

Can Quantum Computers Do Nothing?

Quantum computing platforms are subject to contradictory engineering requirements: qubits must be protected from mutual interactions when idling ('doing nothing'), and strongly interacting when in operation. If idling qubits are not sufficiently protected, information can 'leak' into neighbouring qubits, become non-locally distributed, and ultimately inaccessible. Candidate solutions to this dilemma include patterning-enhanced many-body localization, dynamical decoupling, and active error correction. However, no information-theoretic protocol exists to actually quantify this information loss due to internal dynamics in a similar way to e.g. SPAM errors or dephasing times. In this work, we develop a scalable, flexible, device non-specific protocol for quantifying this bitwise idle information loss based on the exploitation of tools from quantum information theory. We implement this protocol in over 3500 experiments carried out across 4 months (Dec 2023 - Mar 2024) on IBM's entire Falcon 5.11 series of processors. After accounting for other sources of error, and extrapolating results via a scaling analysis in shot count to zero shot noise, we detect idle information leakage to a high degree of statistical significance. This work thus provides a firm quantitative foundation from which the protection-operation dilemma can be investigated and ultimately resolved.

quant-ph↗

arXiv2022

Evidence of Kardar-Parisi-Zhang scaling on a digital quantum simulator

Understanding how hydrodynamic behaviour emerges from the unitary evolution of the many-particle Schrödinger equation is a central goal of non-equilibrium statistical mechanics. In this work we implement a digital simulation of the discrete time quantum dynamics of a spin-$\frac{1}{2}$ XXZ spin chain on a noisy near-term quantum device, and we extract the high temperature transport exponent at the isotropic point. We simulate the temporal decay of the relevant spin correlation function at high temperature using a pseudo-random state generated by a random circuit that is specifically tailored to the ibmq-montreal $27$ qubit device. The resulting output is a spin excitation on a highly inhomogeneous background. From the subsequent discrete time dynamics on the device we are able to extract an anomalous super-diffusive exponent consistent with the conjectured Kardar-Parisi-Zhang (KPZ) scaling at the isotropic point. Furthermore we simulate the restoration of spin diffusion with the application of an integrability breaking potential.

quant-ph↗