activity
20202026
collaborators

6 papers

quant-ph2026

Quantum Lattice Boltzmann Solutions for Transport under 3D Spatially Varying Advection on Trapped Ion Hardware

Sayonee Ray, Jezer Jojo, Jason Iaconis +5

The Quantum Lattice Boltzmann Method (QLBM) has emerged as one of the most promising quantum computing approaches for the numerical simulation of problems in computational fluid dy…

cs.AI2026

Domain-Filtered Knowledge Graphs from Sparse Autoencoder Features

John Winnicki, Abeynaya Gnanasekaran, Eric Darve

Sparse autoencoders (SAEs) extract millions of interpretable features from a language model, but flat feature inventories aren't very useful on their own. Domain concepts get mixed…

quant-ph2025

Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things

Abeynaya Gnanasekaran, Amit Surana

We present a novel framework for Linear Combination of Unitaries (LCU)-style decomposition tailored to structured sparse matrices, which frequently arise in the numerical solution…

quant-ph2024

Variational Quantum Framework for Nonlinear PDE Constrained Optimization Using Carleman Linearization

Abeynaya Gnanasekaran, Amit Surana, Hongyu Zhu

We present a novel variational quantum framework for nonlinear partial differential equation (PDE) constrained optimization problems. The proposed work extends the recently introdu…

math.NA2021

Hierarchical Orthogonal Factorization: Sparse Least Squares Problems

Abeynaya Gnanasekaran, Eric Darve

In this work, we develop a fast hierarchical solver for solving large, sparse least squares problems. We build upon the algorithm, spaQR (sparsified QR), that was developed by the…

math.NA2020

Hierarchical Orthogonal Factorization: Sparse Square matrices

Abeynaya Gnanasekaran, Eric Darve

In this work, we develop a new fast algorithm, spaQR -- sparsified QR, for solving large, sparse linear systems. The key to our approach is using low-rank approximations to sparsif…