A programming language characterizing quantum polynomial time

DOI10.1007/978-3-031-30829-1_8arXiv2212.06656OpenAlexW4311590913MaRDI QIDQ6091186

No author found.

Publication date: 24 November 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2212.06656

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• A new universal and fault-tolerant quantum basis
• Quantum implicit computational complexity
• A new recursion-theoretic characterization of the polytime functions
• Quantum computational networks
• Quantum Computation and Quantum Information
• A Short Introduction to Implicit Computational Complexity
• The One Way to Quantum Computation
• Quantum Complexity Theory
• Towards a quantum programming language
• Categorical algebra
• A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY

This page was built for publication: A programming language characterizing quantum polynomial time