Computer Science Group

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 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 classical hardware. 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

Recent papers

  • M. Tomamichel, Y.L.Hu. (2024). Fundamental limits on quantum cloning from the no-signalling principle. Phys. Rev. A 109
  • M. Tomamichel, Mario Berta. (2024). Entanglement monogamy via multivariate trace inequalities. Comm. Math. Phys. 405
  • Marco Fanizza, J. Lumbreras, Andreas Winter. (2024). Quantum theory in finite dimension cannot explain every general process with finite memory. Comm. Math. Phys. 405
  • Mario Berta, Fernando G. S. L. Brandão, Gilad Gour, Ludovico Lami, Martin B. Plenio, Bartosz Regula, M. Tomamichel. (2023). The tangled state of quantum hypothesis testing. Nature Physics
  • Giovanni Chesi, Alberto Riccardi, R. Rubboli, Lorenzo Maccone, Chiara Macchiavello. (2023). A protocol for global multiphase estimation. Phys. Rev. A 108 012613
  • C. Hirche, Xinyue Guan, M. Tomamichel. (2023). Chain Rules for Renyi Information Combining. IEEE International Symposium on Information Theory (ISIT)
  • Y. Ouyang, M. Tomamichel, Min-Hsiu Hsieh, Barry C. Sanders, Jacquiline Romero, Kaumudibikash Goswami. (2023). Approximate reconstructability of quantum states and noisy quantum secret sharing schemes. Phys. Rev. A 108
  • Mario Berta, Fernando G. S. L. Brandão, Gilad Gour, Ludovico Lami, Martin B. Plenio, Bartosz Regula, M. Tomamichel. (2023). On a gap in the proof of the generalised quantum Stein\'s lemma and its consequences for the reversibility of quantum resources. Quantum 7 1103
  • E. Cervero, Kirill Plekhanov, Michael Lubasch. (2023). Barren plateaus in quantum tensor network optimization. Quantum 7 974
  • M. X. Cao, M. Tomamichel. (2023). Comments on “Channel Coding Rate in the Finite Blocklength Regime”: On the Quadratic Decaying Property of the Information Rate Function. IEEE Trans. Inf. 69
  • Y.L.Hu, Y. Ouyang, M. Tomamichel. (2023). Privacy and correctness trade-offs for information-theoretically secure quantum homomorphic encryption. Quantum 7 976
  • Markus Rambach, Akram Youssry, M. Tomamichel, Jacquiline Romero. (2023). Efficient Quantum State Tracking in Noisy Environments. Quantum Science and Technology 8
  • N. Ramakrishnan, M. Tomamichel, Mario Berta. (2023). Moderate deviation expansion for fully quantum tasks. IEEE Trans. Inf. 69 5041 - 5059
  • Shima Bab Hadiashar, Anurag Anshu, Dave Touchette, Ashwin Nayak, R. Jain. (2023). One-shot quantum state redistribution and quantum Markov chains. IEEE Trans. Inf.
  • Wu.Jiawei, Gui-Lu Long, M. Hayashi. (2022). Quantum secure direct communication with private dense coding using general preshared quantum state. Physical Review Applied 17 064011
more preprints > more publications >