Reordering method and hierarchies for quantum and classical ordered binary decision diagrams© Springer International Publishing AG 2017.We consider
Quantum OBDD model. It is restricted
The complexity of classical and quantum branching programs: A communication complexity approach technique for classical (deterministic, nondeterministic and randomized) and
quantum models of branching
Model of a programmable quantum processing unit based on a quantum transistor effect-qubit gates forming a universal set. We analyze the possible operation of this
quantum computer scheme
On the Probability of Finding Marked Connected Components Using Quantum Walks using
quantum walks. Recent results show that for two or more adjacent marked vertices search by
quantum A model of quantum communication device for quantum hashingIn this paper we consider a model of
quantum communications between classical
computers aided
States with Minimum Dispersion of Observables in Kuryshkin-Wodkiewicz Quantum Mechanics results for
quantum communication channels (including their throughputs), it is necessary to introduce a
Comparative complexity of quantum and classical OBDDs for total and partial functions© 2015, Allerton Press, Inc. We consider a model of
computation for discrete functions
Computing boolean functions via quantum hashing of the
quantum hashing technique. In particular we apply it for
computing Boolean functions in the model of read