What is it about?

Quantum computing promises major advantages over classical computing, but it is still unclear what exactly gives rise to this advantage. Most explanations rely on complex numbers and continuous mathematics, which can obscure the conceptual picture. This paper develops a new, minimal foundation for quantum computing that avoids those assumptions. It presents a fully discrete, symbolic model that captures exactly what is needed for quantum computation - and nothing more.

Featured Image

Why is it important?

By removing unnecessary mathematical structure, the paper isolates the true source of quantum computational power. It shows that the qualitative difference between classical and quantum computing lies in a single capability: the ability to take well-behaved square roots of reversible operations, or operationally, to stop some computations halfway. This clarification improves our conceptual understanding of quantum computing and provides a cleaner foundation for reasoning about quantum algorithms.

Read the Original

This page is a summary of: Free quantum computing, Proceedings of the National Academy of Sciences, February 2026, Proceedings of the National Academy of Sciences,
DOI: 10.1073/pnas.2510881123.
You can read the full text:

Read

Contributors

The following have contributed to this page