Srinivasan Arunachalam

845 total citations
18 papers, 186 citations indexed

About

Srinivasan Arunachalam is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Atomic and Molecular Physics, and Optics. According to data from OpenAlex, Srinivasan Arunachalam has authored 18 papers receiving a total of 186 indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Artificial Intelligence, 7 papers in Computational Theory and Mathematics and 4 papers in Atomic and Molecular Physics, and Optics. Recurrent topics in Srinivasan Arunachalam's work include Quantum Computing Algorithms and Architecture (14 papers), Machine Learning and Algorithms (11 papers) and Quantum Information and Cryptography (6 papers). Srinivasan Arunachalam is often cited by papers focused on Quantum Computing Algorithms and Architecture (14 papers), Machine Learning and Algorithms (11 papers) and Quantum Information and Cryptography (6 papers). Srinivasan Arunachalam collaborates with scholars based in Netherlands, United States and India. Srinivasan Arunachalam's co-authors include Ronald de Wolf, Anurag Anshu, Vincent M. Russo, Nathaniel Johnston, Vojtěch Havlíček, Paweł Wocjan, Kristan Temme, Jop Briët, Carlos Palazuelos and Sourav Chakraborty and has published in prestigious journals such as Journal of Machine Learning Research, SIAM Journal on Computing and Nature Reviews Physics.

In The Last Decade

Srinivasan Arunachalam

17 papers receiving 181 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Srinivasan Arunachalam Netherlands	6	167	62	61	10	9	18	186
Harumichi Nishimura Japan	9	237 1.4×	107 1.7×	90 1.5×	3 0.3×	11 1.2×	36	246
Mehdi Mhalla France	7	126 0.8×	66 1.1×	45 0.7×	4 0.4×	11 1.2×	22	146
Kristen L. Pudenz United States	2	181 1.1×	87 1.4×	39 0.6×	5 0.5×	16 1.8×	2	188
Chunhao Wang United States	7	99 0.6×	64 1.0×	19 0.3×	11 1.1×	8 0.9×	12	119
Shelby Kimmel United States	6	183 1.1×	112 1.8×	27 0.4×	8 0.8×	18 2.0×	12	189
Hlér Kristjánsson United Kingdom	4	228 1.4×	110 1.8×	31 0.5×	15 1.5×	21 2.3×	5	255
Narendra N. Hegade Spain	6	170 1.0×	90 1.5×	38 0.6×	11 1.1×	13 1.4×	15	218
Niel de Beaudrap United Kingdom	7	98 0.6×	87 1.4×	29 0.5×	11 1.1×	7 0.8×	15	130
Lennart Bittel Germany	2	256 1.5×	141 2.3×	51 0.8×	15 1.5×	12 1.3×	4	290
Alexander Poremba United States	3	217 1.3×	91 1.5×	45 0.7×	7 0.7×	27 3.0×	5	229

Countries citing papers authored by Srinivasan Arunachalam

Since Specialization

Citations

This map shows the geographic impact of Srinivasan Arunachalam's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Srinivasan Arunachalam with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Srinivasan Arunachalam more than expected).

Fields of papers citing papers by Srinivasan Arunachalam

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Srinivasan Arunachalam. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Srinivasan Arunachalam. The network helps show where Srinivasan Arunachalam may publish in the future.

Co-authorship network of co-authors of Srinivasan Arunachalam

This figure shows the co-authorship network connecting the top 25 collaborators of Srinivasan Arunachalam. A scholar is included among the top collaborators of Srinivasan Arunachalam based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Srinivasan Arunachalam. Srinivasan Arunachalam is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

18 of 18 papers shown

Arunachalam, Srinivasan, et al.. (2025). Polynomial-Time Tolerant Testing Stabilizer States. 1234–1241. 4 indexed citations

Arunachalam, Srinivasan, et al.. (2025). Testing and Learning Structured Quantum Hamiltonians. 1263–1270. 1 indexed citations

Arunachalam, Srinivasan, et al.. (2024). Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case. arXiv (Cornell University). 16(4). 1–38.

Anshu, Anurag & Srinivasan Arunachalam. (2023). A survey on the complexity of learning quantum states. Nature Reviews Physics. 6(1). 59–69. 38 indexed citations

Arunachalam, Srinivasan, Vojtěch Havlíček, Giacomo Nannicini, Kristan Temme, & Paweł Wocjan. (2022). Simpler (classical) and faster (quantum) algorithms for Gibbs partition functions. Quantum. 6. 789–789. 9 indexed citations

Arunachalam, Srinivasan, et al.. (2021). Communication Memento: Memoryless Communication Complexity. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 20. 1 indexed citations

Arunachalam, Srinivasan, et al.. (2021). Improved Bounds on Fourier Entropy and Min-entropy. UvA-DARE (University of Amsterdam). 13(4). 1–40. 3 indexed citations

Arunachalam, Srinivasan, et al.. (2021). Two new results about quantum exact learning. Quantum. 5. 587–587. 3 indexed citations

Arunachalam, Srinivasan, et al.. (2020). Quantum coupon collector. Data Archiving and Networked Services (DANS). 1 indexed citations

10.

Arunachalam, Srinivasan, et al.. (2020). Quantum Boosting. 1 indexed citations

11.

Arunachalam, Srinivasan, et al.. (2019). Two New Results About Quantum Exact Learning. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations

12.

Arunachalam, Srinivasan, Jop Briët, & Carlos Palazuelos. (2019). Quantum Query Algorithms Are Completely Bounded Forms. SIAM Journal on Computing. 48(3). 903–925. 6 indexed citations

13.

Arunachalam, Srinivasan & Ronald de Wolf. (2018). Optimal quantum sample complexity of learning algorithms. Journal of Machine Learning Research. 19(71). 1–36. 17 indexed citations

14.

Arunachalam, Srinivasan. (2018). Quantum algorithms and learning theory. UvA-DARE (University of Amsterdam). 1 indexed citations

15.

Arunachalam, Srinivasan, Jop Briët, & Carlos Palazuelos. (2018). Quantum Query Algorithms are Completely Bounded Forms. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 94. 21. 1 indexed citations

16.

Arunachalam, Srinivasan & Ronald de Wolf. (2017). Guest Column. ACM SIGACT News. 48(2). 41–67. 81 indexed citations

17.

Arunachalam, Srinivasan, Nathaniel Johnston, & Vincent M. Russo. (2015). Is absolute separability determined by the partial transpose?. Quantum Information and Computation. 15(7&8). 694–720. 14 indexed citations

18.

Arunachalam, Srinivasan. (2012). Quantum Key Distribution: A Resource Letter. International Journal of Computer Applications. 37(3). 11–17. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact