On computational power of quantum branching programs

DOI10.1007/3-540-44669-9_8MaRDI QIDQ4782697zbMATH OpenFDO

Authors Aida Gainutdinova, F. Ablayev, Marek Karpinski

Publication date 2 December 2002

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

Full work available at URL https://arxiv.org/abs/quant-ph/0302022, http://link.springer.de/link/service/series/0558/bibs/2138/21380059

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• On the computational power of probabilistic and quantum branching program
• scientific article; zbMATH DE number 2095528
• Ordered quantum branching programs are more powerful than ordered probabilistic branching programs under a bounded-width restriction
• Quantum and classical simulation of quantum branching programs
• Quantum branching programs and space-bounded nonuniform quantum complexity

Cited in

(22)

• Quantum branching programs and space-bounded nonuniform quantum complexity
• Very narrow quantum OBDDs and width hierarchies for classical OBDDs
• Nondeterministic unitary OBDDs
• Reordering method and hierarchies for quantum and classical ordered binary decision diagrams
• 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
• Computing Boolean functions via quantum hashing
• On complexity of classical simulation of quantum branching programs
• Quantum and classical simulation of quantum branching programs
• scientific article; zbMATH DE number 6004860 (Why is no real title available?)
• Binary quantum hashing
• scientific article; zbMATH DE number 2086634 (Why is no real title available?)
• scientific article; zbMATH DE number 2095528 (Why is no real title available?)
• Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations
• Algorithms for quantum branching programs based on fingerprinting
• ON THE POWER QUANTUM COMPUTATION OVER REAL HILBERT SPACES
• Deterministic construction of QFAs based on the quantum fingerprinting technique
• Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability
• Classical and Quantum Computations with Restricted Memory
• A generalized quantum branching program
• On the complexity of computing the shuffled inequality function in classical and quantum NOBDDs
• Comparative complexity of quantum and classical OBDDs for total and partial functions

This page was built for publication: On computational power of quantum branching programs

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