Pulkit Sinha

Orcid: 0009-0002-9289-3776

According to our database1, Pulkit Sinha authored at least 5 papers between 2024 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances.
CoRR, September, 2025

Dimension Independent and Computationally Efficient Shadow Tomography.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2024
Optimal Lower Bounds for Quantum Learning via Information Theory.
IEEE Trans. Inf. Theory, 2024

Proper vs Improper Quantum PAC learning.
CoRR, 2024

NP-Hardness of Testing Equivalence to Sparse Polynomials and to Constant-Support Polynomials.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024


  Loading...