Projects

  • Quantum Guessing Games (2024)
    Supervisors: Peter Brown, Cambyse Rouzé
    • M1 internship research. We investigated quantum guessing games, a generalization of two well-studied quantum information problems: quantum state discrimination and quantum state antidiscrimination. Our work involved finding closed-form solutions for specific games, analyzing the pretty good measurement in this broader context, and studying the convergence behavior of an iterative algorithm for determining the optimal strategy. (Report)
  • Positive but not Completely Positive Maps (2023 - 2024)
    Supervisor: Peter Brown
    • Aimed at investigating the applications of positive but not completely positive maps in quantum information theory, with a specific emphasis on their role as entanglement criteria. (Report)
  • Bachelor thesis: Quantum (Non-interactive) Proofs (2022-2023), Supervisor: Shahram Khazaei
    • A literature survey on quantum non-interactive proof systems (The QMA complexity class, Quantum PCP conjecture and obstacles in proving it). (Thesis)
  • Quantum Attacks on Symmetric Cryptography Schemes (Fall 2022)
    • The course project of the graduate seminar course in Cryptography (Instructor: Shahram Khazaei); A survey on the use of quantum algorithms in breaking symmetric cryptography schemes. (Report)
  • An Overview of the BQP Class (Summer 2022)
    • The course project of the graduate Complexity Theory course (Instructor: Amir Daneshgar); A literature survey on quantum computational models (quantum Turing machines and quantum circuits), the BQP class, how it relates to classical complexity classes, and oracle separation results.
  • Quantum Dynamic Logic (Summer 2022)
    • A literature survey for the graduate seminar course in Mathematical Logic (Instructor: Mohammad Ardeshir); The survey is on dynamical approaches to logical verification of quantum programs, and a detailed analysis of the correctness of the quantum teleportation protocol. (Report)
  • PCP Theorem and the Hardness of Approximation (Summer 2021)
    • A literature survey for the graduate seminar course in Complexity Theory (Instructor: Javad Ebrahimi); The survey is on the two equivalent statements of the PCP theorem, some of its applications, and the sketch of its proof.