Computer Science Group
Quantum mechanics and computer science are two of the biggest developments in the last century in science and technology: quantum mechanics gave us the opportunity to understand nature at the nanoscale, where the laws of physics are fundamentally different from the conventional (classical) physics; information technologies have revolutionized our everyday lives.
Quantum computing and quantum information science bring these fields together, applying quantum mechanics to problems in computing and communication. After Shor’s 1994 discovery of a quantum algorithm for factoring integers, which threatened the security of a widely-used encryption method, interest in quantum information science thrived. Other achievements of quantum information science include efficient and secure protocols for communication and cryptography. Those protocols have already resulted in quantum cryptography devices that are commercially available.
The computer science group’s activity covers a wide range of areas in quantum computing and information theory, often in close connection with related research areas in classical theoretical computer science. We mostly investigate quantum algorithms, complexity and quantum-safe cryptography. Quantum algorithms provide a recipe for efficiently solving practical problems on a quantum computer, of particular interest are problems which are difficult to solve on a classically. The study of quantum computational complexity is about understanding the fundamental limitations of information processing tasks in nature. By understanding such limits, it can offer a guide to crafting new algorithms and communication protocols. Quantum-safe cryptography is concerned with the design and the evaluation of cryptographic systems which are resistant even to quantum attacks.
More information at our homepage: http://cs.quantumlah.org/
Group Members
- Divesh Aggarwal(Principal Investigator)
- Hartmut Klauck(Principal Investigator)
- Miklos Santha(Principal Investigator)
- Rahul Jain(Principal Investigator)
- Patrick Rebentrost(Senior Research Fellow)
- Han-Hsuan Lin(Research Fellow (NTU))
- Hoeteck Wee(Research Affiliate)
- Iordanis Kerenidis(Research Affiliate)
- Maciej Obremski(Research Fellow)
- Bao Jinge(CQT PhD Student)
- Debbie Lim Huey Chih(CQT PhD Student)
- Kapshikar Upendra Shamrao(CQT PhD Student)
- Maharshi Ray(CQT PhD Student)
- Naresh Goud Boddu(CQT PhD Student)
- Srijita Kundu(CQT PhD Student)
- Yang Siyi(CQT PhD Student)
- Yohanes Yudhi Adikusuma(PhD Student (SoC, NUS))
- Gabor Ivanyos(Visiting Research Associate Professor)
- Serge Massar(Visiting Research Professor)
- Dmitry Gavinsky(Visiting Senior Research Fellow)
- Guo Siyao(Visiting Senior Research Fellow)
- Itai Arad(Visiting Senior Research Fellow)
- Marco Tomamichel(Visiting Senior Research Fellow)
- Noah Stephens-Davidowitz(Visiting Research Fellow)
Recent papers
- Youming Qiao, Gábor Ivanyos. (2019). Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing. SIAM Journal of Computing
- Lajos Rónyai, Péter Kutas, Gábor Ivanyos. (2019). Explicit equivalence of quadratic forms over $\\\\mathbb{F}_q(t)$. Finite Fields and Their Applications
- D. Aggarwal, Maciej Lukasz Obremski. Inception makes non-malleable codes shorter as well!.
- Mark Simkin, Joao Ribeiro, Jesper Buus Nielsen, Ivan Damgard, Maciej Lukasz Obremski, E. Purwanto, D. Aggarwal. (2019). Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures. Proceedings of CRYPTO
- Maciej Obremski, Jesper Buus Nielsen, E. Purwanto, Nico Dottling, D. Aggarwal. (2019). Continuous non-malleable codes in the 8-split-state model. Springer EUROCRYPT 531-561
- Swagato Sanyal, M. Santha, T. Lee, D. Gavinsky. A composition theorem for randomized query complexity via max conflict complexity. Automata, Languages, and Programming
- M. Santha, M.Ray, T. Lee. Strategies for quantum races. ITCS
- M. Tomamichel, M. Santha, T. Lee, Gavin K. Brennen, D. Aggarwal. Quantum attacks on Bitcoin, and how to protect against them.
- Justin Yirka, Aarthi Sundaram, Jamie Sikora, M. Santha, Sevag Gharibian. (2018). Quantum generalizations of the polynomial hierarchy with applications to QMA(2). International Symposium MFCS 1-16
- Gábor Ivanyos, Péter Kutas, Lajos Rónyai. (2019). Explicit equivalence of quadratic forms over $\\mathbb{F}_q(t)$. Finite Fields and Their Applications 55 33-63
- Lajos Rónyai, Péter Kutas, Gábor Ivanyos. (2018). Computing explicit isomorphisms with full matrix algebras over $\mathbb{F}_q(x)$. Foundations of Computational Mathematics 18 381-397
- K. V. Subrahmanyam, Youming Qiao, Gábor Ivanyos. (2018). Constructive noncommutative rank computation is in deterministic polynomial time. Computational Complexity 27 561–593
- Youming Qiao, Gábor Ivanyos. (2019). Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing. SIAM Journal of Computing 48 926-963
- K. V. Subrahmanyam, Gábor Ivanyos, Youming Qiao. (2018). Constructive noncommutative rank computation is in deterministic polynomial time. Computational Complexity 27 561-593
- M. Tomamichel, R. Jain, Mario Berta, Anurag Anshu. A minimax approach to one-shot entropy inequalities.
