Miklós Sántha

Computer Science · Physical Sciences

26h-index3.5kcitations178works1.02yr avg
OpenAlex↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Quantum Computing Algorithms and Architecture(82), Complexity and Algorithms in Graphs(72), Machine Learning and Algorithms(34), Cryptography and Data Security(32), Coding theory and cryptography(29)

Publications178 total

Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
arXiv (Cornell University)·2025Open Access
On generating direct powers of dynamical Lie algebras
ArXiv.org·2025Open Access
Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates
Quantum·2024· 7 citedOpen Access
Quasi-quantum states and the quasi-quantum PCP theorem
arXiv (Cornell University)·2024Open Access
On the dynamical Lie algebras of quantum approximate optimization algorithms
arXiv (Cornell University)·2024Open Access
Polynomial Time Algorithms for Integer Programming and Unbounded Subset Sum in the Total Regime
arXiv (Cornell University)·2024Open Access
Beyond Bell sampling: stabilizer state learning and quantum pseudorandomness lower bounds on qudits
arXiv (Cornell University)·2024Open Access
On the Quantum Time Complexity of Divide and Conquer
arXiv (Cornell University)·2023· 1 citedOpen Access
Quantum Alphatron: quantum advantage for learning with kernels and noise
Quantum·2023· 2 citedOpen Access
Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates
arXiv (Cornell University)·2023· 2 citedOpen Access
Untitled
Theory of Computing·2023Open Access
Quantum generalizations of the polynomial hierarchy with applications to QMA(2)
Computational Complexity·2022· 3 citedOpen Access
Classical and Quantum Algorithms for Variants of Subset-Sum via Dynamic Programming
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2022Open Access
Quantum Algorithm for Stochastic Optimal Stopping Problems with Applications in Finance
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021· 13 citedOpen Access
Characterising the intersection of QMA and coQMA
Quantum Information Processing·2021Open Access
Classical and quantum dynamic programming for Subset-Sum and variants.
arXiv (Cornell University)·2021Open Access
Classical and Quantum Algorithms for Variants of Subset-Sum via Dynamic Programming
arXiv (Cornell University)·2021Open Access
Quantum Alphatron.
arXiv (Cornell University)·2021· 1 citedOpen Access
Characterizing the intersection of QMA and coQMA
arXiv (Cornell University)·2021Open Access
Quantum algorithms for hedging and the learning of Ising models
Physical review. A/Physical review, A·2021· 10 citedOpen Access
page 1 of 9Next →

Frequent Co-authors

Frédéric Magniez(16), Gábor Ivanyos(8), Ashwin Nayak(5), Troy Lee(5), Christoph Dürr(5), Márió Szegedy(4), Katalin Friedl(3), Jérémie Roland(2), Umesh Vazirani(2), Divesh Aggarwal(2), Claude Crépeau(2), José L. Balcázar(2), Joaquim Gabarró(2), Peter C. Richter(2), Luc Sanselme(2), Wim van Dam(2), Michele Mosca(2), Gavin K. Brennen(1), Marco Tomamichel(1), Pranab Kumar Sen(1)