arXiv subjects

Adam Byrne

Publications and source records attributed to Adam Byrne.

5 recordsLinked to original sources

arXiv2026

Quantum algorithms for stochastic nonlinear differential equations

Stochastic nonlinear dynamics underlie many models in engineering and computational physics, yet accurate high-dimensional simulation remains challenging. We present a quantum algorithm for a broad class of $N$-dimensional stochastic differential equations with dissipation and quadratic drift. The algorithm applies to strongly nonlinear systems with all-to-all interactions, thereby extending the scope of previously known quantum algorithms that were limited to weak nonlinearity and sparse systems. For norm-preserving drifts, a condition satisfied by key fluid dynamics discretizations, our method approximates expectation values of low-order correlation functions with rigorous error bounds at a cost polynomial in $\log{(N)}$ and linear in the evolution time. Our main technical advance is a subroutine for simulating an auxiliary system of $N$ interacting quantum harmonic oscillators with cost polylogarithmic in $N$. Finally, we formulate turbulence models, including Navier-Stokes and damped Euler equations, within this framework, opening a route to quantum simulation of strongly nonlinear SDEs governing turbulence and nonlinear wave dynamics.

quant-ph↗

arXiv2025

Quantum Krylov Subspace Diagonalization via Time Reversal Symmetries

Krylov quantum diagonalization methods have emerged as a promising use case for quantum computers. However, many existing implementations rely on controlled operations, which pose challenges to near-term quantum hardware. We introduce a novel protocol, termed Krylov Time Reversal (KTR), that circumvents these bottlenecks by leveraging time-reversal symmetry in Hamiltonian evolution. Using symmetric time dynamics, we show that it is possible to recover real-valued Krylov matrix elements, which significantly reduces the circuit depth and enhances compatibility with shallow quantum architectures. Furthermore, the protocol's structure indirectly reduces the total evolution time, benefiting both near-term and long-term architectures. We validate our method through numerical simulations on paradigmatic Hamiltonians exhibiting time-reversal symmetry, including the transverse-field Ising model and a lattice gauge theory, demonstrating accurate spectral estimation and favorable circuit constructions.

quant-ph↗

arXiv2024

The quantum super-Krylov method

The problem of estimating the ground-state energy of a quantum system is ubiquitous in chemistry and condensed matter physics. Krylov quantum diagonalization (KQD) has emerged as a promising approach for this task. However, many KQD methods rely on subroutines, particularly the Hadamard test, that are challenging to implement on near-term quantum computers. We present a novel KQD method that uses only real-time evolutions and recovery probabilities, making it well adapted for existing quantum hardware. The method entails numerical differentiation in post-processing, and so we present a novel derivative estimation algorithm that is robust to noisy data. Under assumptions on the spectrum of the Hamiltonian, we prove that our algorithm converges exponentially quickly to the ground-state energy and present a numerical demonstration using tensor network simulations.

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↗

arXiv2023

Emergence of power-law distributions in self-segregation reaction-diffusion processes

Many natural or human-made systems encompassing local reactions and diffusion processes exhibit spatially distributed patterns of some relevant dynamical variable. These interactions, through self-organization and critical phenomena, give rise to power-law distributions, where emergent patterns and structures become visible across vastly different scales. Recent observations reveal power-law distributions in the spatial organization of, e.g., tree clusters and forest patch sizes. Crucially, these patterns do not follow a spatially periodic order but rather a statistical one. Unlike the spatially periodic patterns elucidated by the Turing mechanism, the statistical order of these particular vegetation patterns suggests an incomplete understanding of the underlying mechanisms. Here, we present a novel self-segregation mechanism, driving the emergence of power-law scalings in pattern-forming systems. The model incorporates an Allee-logistic reaction term, responsible for the local growth, and a nonlinear diffusion process accounting for positive interactions and limited resources. According to a self-organized criticality (SOC) principle, after an initial decrease, the system mass reaches an analytically predictable threshold, beyond which it self-segregates into distinct clusters, due to local positive interactions that promote cooperation. Numerical investigations show that the distribution of cluster sizes obeys a power-law with an exponential cutoff.

nlin.PS↗