Active Computing & AI Physics & Astronomy

(De)constructing Quantum Software (DeQS)

In plain English

AI plain-English summary

Quantum computers need a new kind of software, and today’s tools for writing and checking that software are not up to the job. This project aims to fix that by building better ways to compile high-level quantum algorithms into instructions that real hardware can execute, to simulate quantum computations on classical supercomputers, and to automatically verify whether a quantum calculation is correct. The core problem is that quantum computers are fundamentally different from classical ones. Their software must manage fragile quantum states and obey strict physical constraints, yet current compilers and verification tools are ad hoc and error-prone. This research uses the ZX calculus—a graphical method that represents quantum computations as networks of nodes and wires—to turn software design into a process of simplifying and rearranging those graphs using rigorous rules. If successful, the work could make quantum computers more reliable and practical for tasks like simulating new materials, optimising supply chains, or cracking encryption. But this is primarily fundamental science: it is developing the mathematical and logical foundations for a future quantum software stack. Past work on graphical calculi for quantum theory has already led to unexpected advances in classical circuit optimisation and error correction, so deeper understanding here could open doors that are not yet visible.

View original technical description
As quantum computing begins to shift from a theoretical to a practical enterprise, it has become clear that the challenges involved in designing the software to drive quantum computers are much broader than just the discovery of new algorithms. This proposal is to develop better techniques both to construct (i.e. compile) and deconstruct (i.e. analyse, verify, and classically simulate) quantum software, based on the common framework of graphical simplification and decomposition. In particular, this research programme addresses three fundamental challenges: (i) to develop better quantum compilers for translating high-level algorithms to real hardware, (ii) to simulate more complex quantum computations with classical (super)computers, and (iii) to automatically verify the exact or approximate correctness of quantum computations. The core methodology relies the ZX calculus, which represents quantum computations as graphs that can be transformed and simplified using rigorous, compositional rules.

View the original record at the funder ↗

Researchers

Aleks Kissinger (Principal Investigator)

Related Research

Grants with similar aims, by meaning.

Diagrammatic Quantum Computation
Applied Category Theory for Compilation of Quantum Algorithms
Adiabatic and dynamical algorithms for quantum hardware
Physical, algebraic and geometric underpinnings of topological quantum computation
Noise Analysis and Mitigation for Scalable Quantum Computation

Original classification

Research Grant

Plain English summaries and category classifications on this site are generated by AI and may not perfectly reflect the original research.