Quantum programming in polylogarithmic time

DOI10.4230/LIPICS.MFCS.2025.47MaRDI QIDQ7310218zbMATH OpenFDO

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

Publication date 5 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2025.47

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A fast quantum circuit for addition with few qubits
• A programming language characterizing quantum polynomial time
• A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
• Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions
• Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability
• Fast parallel circuits for the quantum Fourier transform
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• Parallel quantum computation and quantum codes
• Quantum advantage with shallow circuits
• Quantum Computability
• Quantum first-order logics that capture logarithmic-time/space quantum computability
• Quantum implicit computational complexity
• Quantum lower bounds by polynomials
• Quantum random access memory
• Understanding quantum algorithms via query complexity

This page was built for publication: Quantum programming in polylogarithmic time

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