On the computational power of probabilistic and quantum branching program
From MaRDI portal
Publication:2581534
Recommendations
- scientific article; zbMATH DE number 1839432
- scientific article; zbMATH DE number 2095528
- Complexity bounds on some fundamental computational problems for quantum branching programs.
- scientific article; zbMATH DE number 6004860
- On complexity of classical simulation of quantum branching programs
- Quantum branching programs and space-bounded nonuniform quantum complexity
- Quantum and classical simulation of quantum branching programs
- Stochastic Algorithms: Foundations and Applications
- scientific article; zbMATH DE number 1696662
- scientific article; zbMATH DE number 2086634
Cites work
- A course in combinatorics.
- A lower bound for integer multiplication on randomized ordered read-once branching programs.
- A Property of Finite Simple Non-Abelian Groups
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Branching Programs and Binary Decision Diagrams
- Circuits and expressions with nonassociative gates
- Computing with highly mixed states (extended abstract)
- Finite Continuous Time Markov Chains
- Finite monoids and the fine structure of NC 1
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1696662 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 2086634 (Why is no real title available?)
- scientific article; zbMATH DE number 1839432 (Why is no real title available?)
- scientific article; zbMATH DE number 2102760 (Why is no real title available?)
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- On lower bounds for read-\(k\)-times branching programs
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Probabilistic automata
- Quantum automata and quantum grammars
- Quantum branching programs and space-bounded nonuniform quantum complexity
Cited in
(20)- Two-way and one-way quantum and classical automata with advice for online minimization problems
- Quantum online streaming algorithms with logarithmic memory
- Very narrow quantum OBDDs and width hierarchies for classical OBDDs
- On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-k-times branching programs
- Nondeterministic unitary OBDDs
- Reordering method and hierarchies for quantum and classical ordered binary decision diagrams
- scientific article; zbMATH DE number 1696662 (Why is no real title available?)
- Computing Boolean functions via quantum hashing
- scientific article; zbMATH DE number 6004860 (Why is no real title available?)
- On quantum realisation of Boolean functions by the fingerprinting technique
- scientific article; zbMATH DE number 2086634 (Why is no real title available?)
- scientific article; zbMATH DE number 1839432 (Why is no real title available?)
- scientific article; zbMATH DE number 2095528 (Why is no real title available?)
- Quantum versus classical online streaming algorithms with logarithmic size of memory
- Deterministic construction of QFAs based on the quantum fingerprinting technique
- Classical and Quantum Computations with Restricted Memory
- Error-Free Affine, Unitary, and Probabilistic OBDDs
- Quantum online algorithms with respect to space and advice complexity
- Width hierarchy for \(k\)-OBDD of small width
- Comparative complexity of quantum and classical OBDDs for total and partial functions
This page was built for publication: On the computational power of probabilistic and quantum branching program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581534)
