Quantum and stochastic branching programs of bounded width (Track A).
From MaRDI portal
Recommendations
- Complexity bounds on some fundamental computational problems for quantum branching programs.
- On the computational power of probabilistic and quantum branching program
- Quantum branching programs and space-bounded nonuniform quantum complexity
- On computational power of quantum branching programs
- scientific article; zbMATH DE number 2095528
- scientific article; zbMATH DE number 6004860
- Stochastic Algorithms: Foundations and Applications
- Ordered quantum branching programs are more powerful than ordered probabilistic branching programs under a bounded-width restriction
- On complexity of classical simulation of quantum branching programs
- Quantum and classical simulation of quantum branching programs
Cited in
(6)- Quantum branching programs and space-bounded nonuniform quantum complexity
- On the computational power of probabilistic and quantum branching program
- Ordered quantum branching programs are more powerful than ordered probabilistic branching programs under a bounded-width restriction
- scientific article; zbMATH DE number 6004860 (Why is no real title available?)
- Classical and Quantum Computations with Restricted Memory
- A generalized quantum branching program
This page was built for publication: Quantum and stochastic branching programs of bounded width (Track A).
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737169)
