About Me

I am currently doing a PhD between IRIF, Université de Paris and the Centre for Quantum Technologies, Singapore under the supervision of Frédéric Magniez and Miklos Santha.

Research Interest

My main research interest is to understand the impact of quantum mechanics on algorithm design and computational complexity theory. I have contributed to new quantum algorithms for optimization, statistical analysis, streaming data, random sampling and graph problems. I have worked on lower bounds in query complexity with applications to cryptography. I am also interested in computational learning theory and communication complexity.

scholar cv

Publications

  1. Quantum Time-Space Tradeoff for Finding Multiple Collision Pairs
    Previous title: “Quantum Time-Space Tradeoffs by Recording Queries”
    Yassine Hamoudi, Frédéric Magniez
    Proceedings of the 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021) - To appear.
    [PDF] [arXiv]

  2. Quantum algorithms for hedging and the learning of Ising models
    Previous title: “Quantum algorithms for hedging and the Sparsitron”
    Patrick Rebentrost, Yassine Hamoudi, Maharshi Ray, Xin Wang, Siyi Yang, Miklos Santha
    Physical Review A, vol. 103, p. 012418 (2021).
    [PDF] [arXiv] [Journal]

  3. Quantum and Classical Algorithms for Approximate Submodular Function Minimization
    Yassine Hamoudi, Patrick Rebentrost, Ansis Rosmanis, Miklos Santha
    Quantum Information & Computation, vol. 19, pp. 1325–1349 (2019).
    [PDF] [arXiv] [Journal]

  4. Quantum Chebyshev’s Inequality and Applications
    Yassine Hamoudi, Frédéric Magniez
    Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019).
    [PDF] [arXiv] [Conference]

  5. Simultaneous Multiparty Communication Complexity of Composed Functions
    Yassine Hamoudi
    Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018).
    [PDF] [arXiv] [Conference]

  6. Balanced Mobiles with applications to phylogenetic trees and Huffman-like problems
    Yassine Hamoudi, Sophie Laplante, Roberto Mantaci
    Preprint (2017).
    [PDF]

Other Manuscripts

Talks

Teaching Assistant

Service

I am in charge of organizing the Algorithms and Complexity seminar at IRIF.

I have been a reviewer for: MFCS 2018, ICALP 2019, FSTTCS 2020, ITCS 2021, SODA 2021, STACS 2021, QIP 2021, ICALP 2021.


Theme's credit