PhD Student in Scalable Quantum Program Verification at Uppsala University

September 11, 2026
Application ends: November 15, 2026
Apply Now

Job Description

Uppsala University’s Department of Information Technology is recruiting a PhD student to develop scalable verification methods for quantum programs, combining classical verification and programming-language theory with techniques for complex arithmetic, as quantum software grows more sophisticated and hybrid quantum-classical systems such as error correction become common.

At a glance

  • Position: Doctoral student (1 post), Department of Information Technology
  • Environment: Verification and programming-language groups known for tools such as UPPAAL, Concuerror and Nidhugg
  • Contact: Assistant Professor Ramanathan Thinniyam Srinivasan, ramanathan.s.thinniyam@it.uu.se
  • Start: 15 January 2027 or as agreed (see note below)
  • Reference: UFV-PA 2026/2571
  • Apply: 15 November 2026

About the doctoral project

  • Develop theory and software tools for verifying quantum programs at scale
  • Handle hybrid quantum-classical architectures, such as programs involving quantum error correction
  • Combine classical verification and programming-language theory with techniques for complex arithmetic
  • Devote most time to doctoral education, with up to 20% teaching and administration

Swedish doctoral positions are salaried jobs rather than scholarships: you are employed by the university, take doctoral courses, do research with a supervisor, and may teach up to a fifth of the time.

What Uppsala University is looking for

  • A master’s (second-cycle) degree in computer science, mathematics or a related field, or at least 240 credits including 60 at master’s level with a 15-credit independent project, or equivalent knowledge
  • A mathematical background, excellent problem-solving skills and persistence on difficult problems
  • Interest in programming, good communication and sufficient English, and the ability to work independently and collaboratively

Nice to have

  • Formal methods, programming language theory or semantics, logic, automata theory or automated theorem proving
  • Quantum computing

Pay and location

Uppsala University lists a fixed salary on the doctoral salary ladder; the posting gives no figure. The position is in Uppsala, Sweden. Note: the posting text gives a start date of 15 January 2027 or as agreed, while its summary box says 1 September 2026 or as agreed; the text’s date looks like the intended one, but confirm with the contact.

How to apply

Apply through the official Uppsala University page. The closing date is 15 November 2026. Apply through Uppsala University’s recruitment system using the link on the official posting. Include a statement of at most two pages (motivation, research interests, a summary of your master’s thesis and your earliest start date) with contact details for at least one reference (no letter needed yet), a CV, degrees and transcripts (officially translated into English or Swedish), and your master’s thesis or draft and any publications. Promising applicants will be interviewed.

See all our PhD positions, or browse more research jobs on ResearchJobs.in.

Hiring institution: Uppsala University

Official advertisement: uu.varbi.com

How to prepare for this application

  • Quantum basics: make sure you can reason about quantum circuits and their semantics.
  • Verification: revise model checking, abstract interpretation or deductive verification.
  • Why it matters: read about bugs in quantum software and why testing is hard.
  • Thesis summary: write a crisp half-page summary of your master's thesis for the statement.
  • Timeline: the deadline is 15 November 2026.

About Uppsala University

Uppsala University, founded in 1477, is Sweden's oldest university and a broad research university. Doctoral students there are employed on a salary ladder under a local collective agreement, with the doctorate corresponding to four years of full-time study.

We send one confirmation email first. Every alert has an unsubscribe link.