Open positions
Postdoctoral Positions | Homotopical Quantum Computation
To apply, submit the following documents to mathjobs
Cover letter (detailing how your background and current research align with the project)
CV
Research statement
At least three references
Applications received by Nov 1, 2024, will receive full consideration for the starting date of March 1, 2025.
The current opening will prioritize applications from candidates with experience in
quantum computing, information, and foundations
algebraic topology and category theory
A Ph.D. in mathematics, physics, computer science, or a related area is required.
Project: This project aims to explore fundamental concepts in quantum foundations, with a specific focus on the framework of simplicial distributions introduced in [CKI22]. By leveraging methods from algebraic topology, the project seeks to identify quantum phenomena that can be harnessed for information processing. Additionally, it explores potential applications for achieving quantum advantage, particularly in the development of quantum algorithms and protocols.
These positions are part of the project "Homotopical Quantum Computation: Theory and Applications of Simplicial Distributions," funded by the U.S. Air Force Office of Scientific Research (2024-2029).
Postdoctoral Position | Foundations of Quantum Computing
To apply, submit the following documents to mathjobs
Cover letter (including a description of the relevance of the candidate’s research and potential contributions)
CV
Research statement
At least three references
Applications received by June 15, 2023, will receive full consideration for the starting date of September 1, 2023. However, applications will be accepted until the positions are filled.
The candidate will participate in the EU-Canada joint project “Foundations of quantum computational advantage” (FoQaCiA). There are no teaching duties. A Ph.D. in mathematics, physics, computer science, or a related area is required. More specifically, candidates with the following qualifications will be prioritized:
Quantum computing expertise with strong mathematical abilities.
Polyhedral computation expertise with an interest in quantum computing.
Project: Classical simulation algorithms provide a rigorous approach to analyzing the computational advantage of quantum computers. The advantage is achieved if all such classical simulation algorithms fail to simulate efficiently. Different classical simulation algorithms exist, e.g., based on stabilizer tableaus, stabilizer rank decompositions, and Wigner functions. Recently a new algorithm based on polytope theory has been introduced; see [ZOR]. The efficiency of this algorithm is only understood partially; see [OZR] and [ZORH]. This project aims to study the complexity of the algorithm using polytope-theoretic tools.