Материалов:
1 005 012

Репозиториев:
30

Авторов:
761 409

По вашему запросу найдено документов: 22317

Страница 3 из 2232

Lower bounds and hierarchies for quantum memoryless communication protocols and quantum ordered binary decision diagrams with repeated test
. As an application of communication complexity results, we consider Quantum Ordered Read-k-times Branching Programs
The complexity of classical and quantum branching programs: A communication complexity approach
Ablayev F.
technique for classical (deterministic, nondeterministic and randomized) and quantum models of branching
On simulating the quantum and classical branching programs
Gainutdinova A.
these relations, we developed a method of "linear simulation" of a quantum branching program and a method
Quantum Transparency of Barriers and Reflection from Wells for Clusters of Identical Particles
Chuluunbaatar O., Vinitsky S.I., Gusev A.A., Derbov V.L., Krassovitskiy P.M.
A method for solving the problem of quantum transmission through potential barriers or potential
Reordering method and hierarchies for quantum and classical ordered binary decision diagrams
Khadiev K., Khadieva A.
version of read-once Quantum Branching Programs, with respect to “width” complexity. It is known
Quantum and stochastic branching programs of bounded width
Ablayev F., Moore C., Pollett C.
We prove upper and lower bounds on the power of quantum and stochastic branching programs
On the quantum and classical complexity of solving subtraction games
Kravchenko D., Khadiev K., Serov D.
are sometimes referred as one-heap Nim games. We describe a quantum algorithm which is applicable to any game
Model of a programmable quantum processing unit based on a quantum transistor effect
), which we use as a basis for the Quantum Programming Framework. This framework makes it possible
Analysis of Properties of Quantum Hashing
Vasiliev A., Vasilov A., Latypov M.
of binary quantum hashing that allows one to represent binary sets as quantum states. We show
Comparative power of quantum and classical computation models
Ablayev F.
In the talk we present results on comparitve power of classical and quantum computational models

Страница 3 из 2232

Фасеты

Новости проекта

Новости

Партнеры

КФУ
ТГУ
Elpub
СФУ
Webpublishers

Индексация

BASE
WorldCat
OpenAIRE
EDS
core