Abeynaya Gnanasekaran

Orcid: 0000-0001-7088-9261

According to our database1, Abeynaya Gnanasekaran authored at least 10 papers between 2021 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
An efficient quantum algorithm for simulating polynomial dynamical systems.
Quantum Inf. Process., March, 2024

Variational Quantum Framework for Partial Differential Equation Constrained Optimization.
CoRR, 2024

Efficient Variational Quantum Linear Solver for Structured Sparse Matrices.
CoRR, 2024

On the Emergence of Ergodic Dynamics in Unique Games.
CoRR, 2024

2023
Efficient Quantum Algorithms for Nonlinear Stochastic Dynamical Systems.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2023

2022
Hierarchical Orthogonal Factorization: Sparse Square Matrices.
SIAM J. Matrix Anal. Appl., 2022

Hierarchical Orthogonal Factorization: Sparse Least Squares Problems.
J. Sci. Comput., 2022

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

Scalable low-rank factorization using a task-based runtime system with distributed memory.
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.
Proceedings of the SIGGRAPH 2021: Special Interest Group on Computer Graphics and Interactive Techniques Conference, 2021


  Loading...