scientific article; zbMATH DE number 1839432
From MaRDI portal
Publication:4782697
zbMath0999.68071arXivquant-ph/0302022MaRDI QIDQ4782697
Aida Gainutdinova, Marek Karpinski, Farid M. Ablayev
Publication date: 2 December 2002
Full work available at URL: https://arxiv.org/abs/quant-ph/0302022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Very narrow quantum OBDDs and width hierarchies for classical OBDDs ⋮ Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations ⋮ Binary quantum hashing ⋮ Nondeterministic unitary OBDDs ⋮ Reordering method and hierarchies for quantum and classical ordered binary decision diagrams ⋮ Computing Boolean Functions via Quantum Hashing ⋮ Deterministic construction of QFAs based on the quantum fingerprinting technique ⋮ Classical and Quantum Computations with Restricted Memory ⋮ Comparative complexity of quantum and classical OBDDs for total and partial functions ⋮ Quantum branching programs and space-bounded nonuniform quantum complexity ⋮ On the computational power of probabilistic and quantum branching program
