Abeynaya Gnanasekaran

According to our database, Abeynaya Gnanasekaran authored at least 14 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2026

Domain-Filtered Knowledge Graphs from Sparse Autoencoder Features.

John Winnicki, Abeynaya Gnanasekaran, Eric Darve

CoRR, April, 2026

Variational Quantum Framework for Partial Differential Equation Constrained Optimization.

Amit Surana, Abeynaya Gnanasekaran

ACM Trans. Quantum Comput., March, 2026

2025

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

Abeynaya Gnanasekaran, Amit Surana

CoRR, July, 2025

Discovering Algorithms with Computational Language Processing.

Théo Bourdais, Abeynaya Gnanasekaran, Houman Owhadi, Tuhin Sahai

CoRR, July, 2025

Variational Quantum Framework for Nonlinear PDE Constrained Optimization Using Carleman Linearization.

Abeynaya Gnanasekaran, Amit Surana, Hongyu Zhu

Quantum Inf. Comput., 2025

2024

An efficient quantum algorithm for simulating polynomial dynamical systems.

Amit Surana, Abeynaya Gnanasekaran, Tuhin Sahai

Quantum Inf. Process., March, 2024

On the Emergence of Ergodic Dynamics in Unique Games.

Tuhin Sahai, Abeynaya Gnanasekaran

CoRR, 2024

Efficient Variational Quantum Linear Solver for Structured Sparse Matrices.

Abeynaya Gnanasekaran, Amit Surana

Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2024

2023

Efficient Quantum Algorithms for Nonlinear Stochastic Dynamical Systems.

Abeynaya Gnanasekaran, Amit Surana, Tuhin Sahai

Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2023

2022

Hierarchical Orthogonal Factorization: Sparse Square Matrices.

Abeynaya Gnanasekaran, Eric Darve

SIAM J. Matrix Anal. Appl., 2022

Hierarchical Orthogonal Factorization: Sparse Least Squares Problems.

Abeynaya Gnanasekaran, Eric Darve

J. Sci. Comput., 2022

Carleman linearization based efficient quantum algorithm for higher order polynomial differential equations.

Amit Surana, Abeynaya Gnanasekaran, Tuhin Sahai

CoRR, 2022

Scalable low-rank factorization using a task-based runtime system with distributed memory.

Abeynaya Gnanasekaran, Eric Darve

Proceedings of the PASC '22: Platform for Advanced Scientific Computing Conference, Basel, Switzerland, June 27, 2022

2021

A fast sparse QR factorization for solving linear least squares problems in graphics.

Abeynaya Gnanasekaran, Eric Darve

Proceedings of the SIGGRAPH 2021: Special Interest Group on Computer Graphics and Interactive Techniques Conference, 2021