A generalized quantum branching program

DOI10.4230/LIPICS.FSTTCS.2023.31MaRDI QIDQ6951702zbMATH OpenFDO

Authors Debajyoti Bera, Tharrmashastha Sapv

Publication date 28 July 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2023.31

zbMATH Keywords

quantum algorithmsquantum branching programsquantum computingquery complexity

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cites work

• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• scientific article; zbMATH DE number 2086634 (Why is no real title available?)
• On computational power of quantum branching programs
• Ordered quantum branching programs are more powerful than ordered probabilistic branching programs under a bounded-width restriction
• Quantum branching programs and space-bounded nonuniform quantum complexity

This page was built for publication: A generalized quantum branching program

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