Branch sequentialization in quantum polytime

DOI10.4230/LIPICS.FSCD.2025.22MaRDI QIDQ7296817zbMATH OpenFDO

Authors Emmanuel Hainry, Romain Péchoux, Mário J. Silva

Publication date 14 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.FSCD.2025.22

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A programming language characterizing quantum polynomial time
• A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
• Categories for Quantum Theory
• Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability
• scientific article; zbMATH DE number 6131346 (Why is no real title available?)
• scientific article; zbMATH DE number 7651038 (Why is no real title available?)
• Linear dependent type theory for quantum programming languages: extended abstract
• No-cloning in categorical quantum mechanics
• Parallel quantum computation and quantum codes
• Quantum Complexity Theory
• Quantum Computability
• Quantum implicit computational complexity
• Quantum quandaries: a category-theoretic perspective
• Realizability in the unitary sphere
• Towards a quantum programming language

This page was built for publication: Branch sequentialization in quantum polytime

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296817)