Welcome to the Quantum Computing Systems (QCS) research group

An initiative based at the Department of Information Technology, Uppsala University.
Founded by Ramanathan Thinniyam Srinivasan, October 2025.

We are laying the foundations for a full-stack quantum computing ecosystem at Uppsala University — by developing core expertise in systems, theory, and verification, and by collaborating across divisions to expand into emerging domains such as quantum control, machine learning, and applications.

⚛️ What is Quantum Computing?

Quantum computing is the study of how information can be represented and processed using the principles of quantum mechanics. It is a new computational paradigm — not just classical simulation of quantum phenomena.

Quantum computing ≠ Classical computing about quantum systems.
While much classical research focuses on using conventional computers to simulate physical systems like molecules or materials, quantum computing builds entirely new machines — based on quantum primitives such as qubits, unitary gates, and quantum measurements.

This paradigm shift enables radically new forms of computation, grounded in superposition, entanglement, and interference — allowing us to solve certain problems faster than any classical algorithm can.

At QCS, we view quantum computing through the lens of the quantum computing stack:

These layers form a coherent and rigorous computational stack — not unlike the classical computing ecosystem — and require deep computer science foundations.

Our perspective is simple but important: Quantum computing is still computing. It is not a subfield of physics, but a full-fledged computational discipline — asking core questions like:
What is a computation? What can be computed efficiently? How can we verify correctness?

🧩 Current Focus: Verification of Quantum Programs

At QCS, our current focus lies in Quantum Program Verification (QPV) — the challenge of reasoning formally about the correctness of quantum algorithms and circuits.

We approach this problem using tools from automata theory and logic, drawing on decades of expertise in classical verification from the Division of Computer Systems (DoCS) at Uppsala University.

Our recent work includes a POPL 2026 paper on verifying quantum circuits using weighted tree automata, becoming one of the first efforts to enable parametrised verification (i.e. the ability to verify entire families of circuits in one shot). This work is in collaboration with researchers in Taiwan and the Czech Republic.

🎯 Mandate and Vision

The mission of QCS is twofold:

  1. Develop foundational quantum computing expertise in the Core Areas — quantum analogues of classical research strengths in the DoCS and CSD divisions of the Department of Information Technology.
  2. Foster collaborations with other divisions to help them engage with quantum computing in their own domains (Allied Areas) — including control, machine learning, scientific computing, and applications.

Our long-term vision is to create a robust quantum research ecosystem within the Department of Information Technology — aligned with our classical strengths and outward-looking toward collaboration and growth.

Core Areas

Allied Areas

📬 Mailing Lists

We coordinate our activities through two mailing lists — open to different levels of involvement:

👥 Group

Contact person (For seminar coordination, inquiries, or collaboration):

Members: