arXiv subjects

Siddharth Hariprakash

Publications and source records attributed to Siddharth Hariprakash.

6 recordsLinked to original sources

arXiv2025

The Practicality of Randomized Quantum Linear Systems Solvers

Randomized quantum algorithms have been proposed for quantum linear algebra with the goal of constructing shallower circuits than methods based on block encodings, and have been speculated to offer benefits in the early fault-tolerant era. In this work, we derive explicit, non-asymptotic error bounds on every algorithmic parameter of a randomized quantum linear systems solver that combines sampling from a Fourier series with Hamiltonian simulation, and confirm these bounds numerically. We show that even a $4 \times 4$ instance with condition number $\kappa = 100$ requires on the order of $10^{15}$ non-Clifford gates to converge, calling into question the practicality of such randomized schemes. Comparing the two Hamiltonian-simulation kernels, product formulas (PFs) and the random Taylor expansion (RTE), both our analytical bounds and experiments show RTE reaches a given target error with roughly an order of magnitude smaller total gate budget, although neither is practical. Our analysis bridges asymptotic proposals and hardware implementation.

quant-ph↗

arXiv2025

Truncation uncertainties for accurate quantum simulations of lattice gauge theories

The encoding of lattice gauge theories onto quantum computers requires a discretization of the gauge field's Hilbert space on each link, which presents errors with respect to the Kogut--Susskind limit. In the electric basis, Hilbert space fragmentation has recently been shown to limit the excitation of large electric fields. Here, we leverage this to develop a formalism for estimating the size of truncation errors in the electric basis. Generically, the truncation error falls off as a factorial of the field truncation. Examples of this formalism are applied to the Schwinger model and a pure U(1) lattice gauge theory. For reasonable choices of parameters, we improve on previous error estimates by a factor of 10^{306}.

quant-ph↗

arXiv2025

A Practical Guide to using Pauli Path Simulators for Utility-Scale Quantum Experiments

In this this paper we present an inexpensive protocol to perform runtime and memory estimation for large-scale experiments with Pauli Path simulators (PPS). Additionally, we propose a conceptually simple solution for studying whether PPS can be used as a scientific discovery tool, rather than reproducing existing answers. We start by analyzing the dynamics of the Pauli coefficients tracked in the Heisenberg picture. In addition to surprisingly generic convergence features of the Pauli coefficient distributions, we find certain regularities that allow for extrapolation of memory and runtime requirements for smaller and smaller coefficient truncation parameter $δ$. We then introduce a framework for understanding convergence in the absence of rigorous error guarantees on PPS. Combined with runtime analysis, we propose bifurcating quantum simulation problems broadly into two classes, based on whether there is apparent convergence of expectation values as a function of $δ$. This serves as a way for practitioners to understand where their problem falls on the frontier of classical simulability. In the case without apparent convergence, PPS may still serve useful as a Monte Carlo-like estimate. Applied to IBM's utility-scale experiments, we show parameter regimes where both behaviors are realized. Some of our key findings challenge conventional intuition: reducing $δ$ does not always improve accuracy, and deeper quantum circuits may actually be easier to simulate than shallower ones. The BlueQubit SDK implementing these methods has been released publicly, offering researchers a comprehensive toolkit for evaluating this frontier classical simulation approach. These results establish practical guidelines for when PPS can serve as a reliable verification tool versus when it should be used as a complementary estimate alongside quantum experiments.

quant-ph↗

arXiv2025

Obtaining continuum physics from dynamical simulations of Hamiltonian lattice gauge theories

Taking the continuum limit is essential for extracting physical observables from quantum simulations of lattice gauge theories. Achieving the correct continuum limit requires careful control of all systematic uncertainties, including those arising from approximate implementations of the time evolution operator. In this work, we review existing approaches based on renormalization techniques, and point out their limitations. To overcome these limitations, we introduce a new general framework -- the Statistically-Bounded Time Evolution (SBTE) protocol -- for rigorously controlling the impact of approximate time evolution on the continuum limit. The central insight is that, since exact time evolution introduces no UV divergences, errors from approximate evolution can be treated as a source of systematic uncertainty that can be neglected if reduced below the working statistical uncertainty. We show that, using the SBTE protocol, which prescribes driving the approximate time evolution error below the working statistical uncertainty, leads to a simplified renormalization procedure. Furthermore, we show that, due to the existence of rigorous error bounds, one can guarantee a priori that such errors are negligible and do not affect the continuum limit. Ultimately, our protocol lays the foundation for performing systematic and fair comparisons between different simulation algorithms for lattice gauge theory simulations.

hep-lat↗

arXiv2025

Block encoding bosons by signal processing

Block Encoding (BE) is a crucial subroutine in many modern quantum algorithms, including those with near-optimal scaling for simulating quantum many-body systems, which often rely on Quantum Signal Processing (QSP). Currently, the primary methods for constructing BEs are the Linear Combination of Unitaries (LCU) and the sparse oracle approach. In this work, we demonstrate that QSP-based techniques, such as Quantum Singular Value Transformation (QSVT) and Quantum Eigenvalue Transformation for Unitary Matrices (QETU), can themselves be efficiently utilized for BE implementation. Specifically, we present several examples of using QSVT and QETU algorithms, along with their combinations, to block encode Hamiltonians for lattice bosons, an essential ingredient in simulations of high-energy physics. We also introduce a straightforward approach to BE based on the exact implementation of Linear Operators Via Exponentiation and LCU (LOVE-LCU). We find that, while using QSVT for BE results in the best asymptotic gate count scaling with the number of qubits per site, LOVE-LCU outperforms all other methods for operators acting on up to $\lesssim11$ qubits, highlighting the importance of concrete circuit constructions over mere comparisons of asymptotic scalings. Using LOVE-LCU to implement the BE, we simulate the time evolution of single-site and two-site systems in the lattice $φ^4$ theory using the Generalized QSP algorithm and compare the gate counts to those required for Trotter simulation.

quant-ph↗

arXiv2024

Strategies for simulating time evolution of Hamiltonian lattice field theories

Simulating the time evolution of quantum field theories given some Hamiltonian $H$ requires developing algorithms for implementing the unitary operator e^{-iHt}. A variety of techniques exist that accomplish this task, with the most common technique used so far being Trotterization, which is a special case of the application of a product formula. However, other techniques exist that promise better asymptotic scaling in certain parameters of the theory being simulated, the most efficient of which are based on the concept of block encoding. In this work we study the performance of such algorithms in simulating lattice field theories. We derive and compare the asymptotic gate complexities of several commonly used simulation techniques in application to Hamiltonian Lattice Field Theories. Using the scalar ϕ^4 theory as a test, we also perform numerical studies and compare the gate costs required by Product Formulas and Signal Processing based techniques to simulate time evolution. For the latter, we use the the Linear Combination of Unitaries construction augmented with the Quantum Fourier Transform circuit to switch between the field and momentum eigenbases, which leads to immediate order-of-magnitude improvement in the cost of preparing the block encoding. The paper also includes a pedagogical review of utilized techniques, in particular Product Formulas, LCU, Qubitization, QSP, as well as a technique we call HHKL based on its inventors' names.

quant-ph↗