Aarthi Sundaram
Cím
Hivatkozott rá
Hivatkozott rá
Év
Linear time algorithm for quantum 2SAT
I Arad, M Santha, A Sundaram, S Zhang
Theory of Computing 14 (1), 1 -- 27, 2018
142018
Quantum generalizations of the polynomial hierarchy with applications to QMA (2)
S Gharibian, M Santha, J Sikora, A Sundaram, J Yirka
arXiv preprint arXiv:1805.11139, 2018
62018
On the complexity of trial and error for constraint satisfaction problems
G Ivanyos, R Kulkarni, Y Qiao, M Santha, A Sundaram
Journal of Computer and System Sciences 92, 48-64, 2018
42018
Quantum hardness of learning shallow classical circuits
S Arunachalam, AB Grilo, A Sundaram
arXiv preprint arXiv:1903.02840, 2019
32019
Gottesman Types for Quantum Programs
R Rand, A Sundaram, K Singhal, B Lackey
Proc. QPL 20, 2020
12020
A Type System for Quantum Resources
R Rand, A Sundaram, K Singhal, B Lackey
12019
On the complexity of probabilistic trials for hidden satisfiability problems
I Arad, A Bouland, D Grier, M Santha, A Sundaram, S Zhang
arXiv preprint arXiv:1606.03585, 2016
12016
Mathematical methods for resource-based type theories
A Sundaram, B Lackey
arXiv preprint arXiv:1812.08726, 2018
2018
Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA (2)
M Santha, S Gharibian, J Sikora, A Sundaram, J Yirka
2018
On classical and quantum constraint satisfaction problems in the trial and error model
A Sundaram
PQDT-Global, 2017
2017
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–10