Tighter relations between sensitivity and other complexity measures
The sensitivity conjecture of Nisan and Szegedy [12] asks whether the maximum sensitivity
of a Boolean function is polynomially related to the other major complexity measures of …
of a Boolean function is polynomially related to the other major complexity measures of …
A note on a communication game
A Drucker - arxiv preprint arxiv:1706.07890, 2017 - arxiv.org
We describe a communication game, and a conjecture about this game, whose proof would
imply the well-known Sensitivity Conjecture asserting a polynomial relation between …
imply the well-known Sensitivity Conjecture asserting a polynomial relation between …
[PDF][PDF] THE JOURNEY OF QUANTUM INFORMATION TECHNOLOGY
P Nikolov, V Galabov - researchgate.net
This paper overviews the development of the quantum information technology and the
quantum computing over the years, highlighting its potential promising applications in …
quantum computing over the years, highlighting its potential promising applications in …
Optimal Success Bounds for Single Query Quantum Algorithms Computing the General SUM Problem
A Valtchev - 2015 - uwspace.uwaterloo.ca
In this thesis the problem of computing the sum of a string of arbitrary finite length drawn
from an arbitrary finite alphabet is treated. The resource considered is the number of queries …
from an arbitrary finite alphabet is treated. The resource considered is the number of queries …