Zobrazeno 1 - 10
of 208
pro vyhledávání: '"Gruska, Jozef"'
Publikováno v:
Fundamenta Informaticae, Volume 182, Issue 4 (November 18, 2021) fi:8500
The goal in the area of functions property testing is to determine whether a given black-box Boolean function has a particular given property or is $\varepsilon$-far from having that property. We investigate here several types of properties testing f
Externí odkaz:
http://arxiv.org/abs/2109.06763
Publikováno v:
In Journal of Computer and System Sciences May 2024 141
Publikováno v:
Theoretical Computer Science 807 (2020): 330-340
New quantum private database (with N elements) query protocols are presented and analyzed. Protocols preserve O(logN) communication complexity of known protocols for the same task, but achieve several significant improvements in security, especially
Externí odkaz:
http://arxiv.org/abs/2005.13382
We propose a multiple pulses phase-matching quantum key distribution protocol (MPPM-QKD) to exceed the linear key rate bound and to achieve higher error tolerance. In our protocol, Alice and Bob generate at first their own train pulses (each train sh
Externí odkaz:
http://arxiv.org/abs/1905.10545
A topic about synthesis of quantum images is proposed, and a specific phase rotation transform constructed is adopted to theoretically realise the synthesis of two quantum images. The synthesis strategy of quantum images comprises three steps, which
Externí odkaz:
http://arxiv.org/abs/1811.05170
We explore bounds of {\em time-space tradeoffs} in language recognition on {\em two-way finite automata} for some special languages. We prove: (1) a time-space tradeoff upper bound for recognition of the languages $L_{EQ}(n)$ on {\em two-way probabil
Externí odkaz:
http://arxiv.org/abs/1507.01346
The concept of promise problems was introduced and started to be systematically explored by Even, Selman, Yacobi, Goldreich, and other scholars. It has been argued that promise problems should be seen as partial decision problems and as such that the
Externí odkaz:
http://arxiv.org/abs/1411.3870
The potential of the exact quantum information processing is an interesting, important and intriguing issue. For examples, it has been believed that quantum tools can provide significant, that is larger than polynomial, advantages in the case of exac
Externí odkaz:
http://arxiv.org/abs/1404.1689
It has been proved that almost all $n$-bit Boolean functions have exact classical query complexity $n$. However, the situation seemed to be very different when we deal with exact quantum query complexity. In this paper, we prove that almost all $n$-b
Externí odkaz:
http://arxiv.org/abs/1404.1684
In the {\em distributed Deutsch-Jozsa promise problem}, two parties are to determine whether their respective strings $x,y\in\{0,1\}^n$ are at the {\em Hamming distance} $H(x,y)=0$ or $H(x,y)=\frac{n}{2}$. Buhrman et al. (STOC' 98) proved that the ex
Externí odkaz:
http://arxiv.org/abs/1402.7254