Get more replies from employers
Send a job-specific resume in minutes.
Phasecraft in Greater London seeks a Quantum Algorithms Scientist to focus on theoretical and applied research for quantum computing applications. The candidate will contribute to optimizing and solving real-world problems through advanced algorithms.
The ideal applicant will possess strong skills in quantum information theory or classical optimization, with a PhD being advantageous. This role invites collaboration with a dedicated team and offers opportunities for innovative research across quantum technologies.
Phasecraft is the quantum algorithms company. We are building the mathematical foundations for quantum computing applications that solve real-world problems. Founded in 2019 by Toby Cubitt, Ashley Montanaro and John Morton, we are based in London and Bristol in the UK and opened an office in Washington DC in 2024, led by Steve Flammia. In 2023 we completed a $17m Series A funding round led by leading Silicon Valley deep tech VC, Playground Global.
Phasecraft's unprecedented access to today's best quantum computers – through partnerships with Google, IBM, Quantinuum and QuEra – provides us with unique opportunities to develop foundational IP, inform the development of next‑generation quantum hardware, and accelerate commercialization of high‑value breakthroughs.
We are looking to hire a Quantum Algorithms Scientist to join our team. The ideal candidate will have experience in the theory and/or implementation of optimization algorithms for gate‑model quantum computers, or in classical optimization or constraint satisfaction algorithms; or otherwise strong evidence of potential to contribute to these areas. Their work will initially focus on these topics, though they will have the opportunity to grow a portfolio of research activity across the breadth of Phasecraft's interests. A background in quantum computing is not necessarily required, though a successful candidate will have evidence of the ability to design and implement advanced algorithms for optimization and/or constraint satisfaction.