Paper
Free Quantum Computing
Authors
Jacques Carette, Chris Heunen, Robin Kaarsgaard, Neil J. Ross, Amr Sabry
Abstract
Quantum computing improves substantially on known classical algorithms for various important problems, but the nature of the relationship between quantum and classical computing is not yet fully understood. This relationship can be clarified by free models, that add to classical computing just enough physical principles to represent quantum computing and no more. Here we develop an axiomatisation of quantum computing that replaces the standard continuous postulates with a small number of discrete equations, as well as a free model that replaces the standard linear-algebraic model with a category-theoretical one. The axioms and model are based on reversible classical computing, isolate quantum advantage in the ability to take certain well-behaved square roots, and link to various quantum computing hardware platforms. This approach allows combinatorial optimisation, including brute force computer search, to optimise quantum computations. The free model may be interpreted as a programming language for quantum computers, that has the same expressivity and computational universality as the standard model, but additionally allows automated verification and reasoning.
Metadata
Related papers
Fractal universe and quantum gravity made simple
Fabio Briscese, Gianluca Calcagni • 2026-03-25
POLY-SIM: Polyglot Speaker Identification with Missing Modality Grand Challenge 2026 Evaluation Plan
Marta Moscati, Muhammad Saad Saeed, Marina Zanoni, Mubashir Noman, Rohan Kuma... • 2026-03-25
LensWalk: Agentic Video Understanding by Planning How You See in Videos
Keliang Li, Yansong Li, Hongze Shen, Mengdi Liu, Hong Chang, Shiguang Shan • 2026-03-25
Orientation Reconstruction of Proteins using Coulomb Explosions
Tomas André, Alfredo Bellisario, Nicusor Timneanu, Carl Caleman • 2026-03-25
The role of spatial context and multitask learning in the detection of organic and conventional farming systems based on Sentinel-2 time series
Jan Hemmerling, Marcel Schwieder, Philippe Rufin, Leon-Friedrich Thomas, Mire... • 2026-03-25
Raw Data (Debug)
{
"raw_xml": "<entry>\n <id>http://arxiv.org/abs/2602.16927v1</id>\n <title>Free Quantum Computing</title>\n <updated>2026-02-18T22:39:58Z</updated>\n <link href='https://arxiv.org/abs/2602.16927v1' rel='alternate' type='text/html'/>\n <link href='https://arxiv.org/pdf/2602.16927v1' rel='related' title='pdf' type='application/pdf'/>\n <summary>Quantum computing improves substantially on known classical algorithms for various important problems, but the nature of the relationship between quantum and classical computing is not yet fully understood. This relationship can be clarified by free models, that add to classical computing just enough physical principles to represent quantum computing and no more. Here we develop an axiomatisation of quantum computing that replaces the standard continuous postulates with a small number of discrete equations, as well as a free model that replaces the standard linear-algebraic model with a category-theoretical one. The axioms and model are based on reversible classical computing, isolate quantum advantage in the ability to take certain well-behaved square roots, and link to various quantum computing hardware platforms. This approach allows combinatorial optimisation, including brute force computer search, to optimise quantum computations. The free model may be interpreted as a programming language for quantum computers, that has the same expressivity and computational universality as the standard model, but additionally allows automated verification and reasoning.</summary>\n <category scheme='http://arxiv.org/schemas/atom' term='quant-ph'/>\n <category scheme='http://arxiv.org/schemas/atom' term='math.CT'/>\n <published>2026-02-18T22:39:58Z</published>\n <arxiv:comment>32 pages</arxiv:comment>\n <arxiv:primary_category term='quant-ph'/>\n <arxiv:journal_ref>Proceedings of the National Academy of Sciences 123(8):e2510881123, 2026</arxiv:journal_ref>\n <author>\n <name>Jacques Carette</name>\n </author>\n <author>\n <name>Chris Heunen</name>\n </author>\n <author>\n <name>Robin Kaarsgaard</name>\n </author>\n <author>\n <name>Neil J. Ross</name>\n </author>\n <author>\n <name>Amr Sabry</name>\n </author>\n <arxiv:doi>10.1073/pnas.2510881123</arxiv:doi>\n <link href='https://doi.org/10.1073/pnas.2510881123' rel='related' title='doi'/>\n </entry>"
}