ﻻ يوجد ملخص باللغة العربية
Simons problem is an essential example demonstrating the faster speed of quantum computers than classical computers for solving some problems. The optimal separation between exact quantum and classical query complexities for Simons problem has been proved by Cai $&$ Qiu. Generalized Simons problem can be described as follows. Given a function $f:{{0, 1}}^n to {{0, 1}}^m$, with the property that there is some unknown hidden subgroup $S$ such that $f(x)=f(y)$ iff $x oplus yin S$, for any $x, yin {{0, 1}}^n$, where $|S|=2^k$ for some $0leq kleq n$. The goal is to find $S$. For the case of $k=1$, it is Simons problem. In this paper, we propose an exact quantum algorithm with $O(n-k)$ queries and an non-adaptive deterministic classical algorithm with $O(ksqrt{2^{n-k}})$ queries for solving the generalized Simons problem. Also, we prove that their lower bounds are $Omega(n-k)$ and $Omega(sqrt{k2^{n-k}})$, respectively. Therefore, we obtain a tight exact quantum query complexity $Theta(n-k)$ and an almost tight non-adaptive classical deterministic query complexities $Omega(sqrt{k2^{n-k}}) sim O(ksqrt{2^{n-k}})$ for this problem.
Simons problem is one of the most important problems demonstrating the power of quantum computers, which achieves a large separation between quantum and classical query complexities. However, Simons discussion on his problem was limited to bounded-er
The query model offers a concrete setting where quantum algorithms are provably superior to randomized algorithms. Beautiful results by Bernstein-Vazirani, Simon, Aaronson, and others presented partial Boolean functions that can be computed by quantu
We introduce a minimal set of physically motivated postulates that the Hamiltonian H of a continuous-time quantum walk should satisfy in order to properly represent the quantum counterpart of the classical random walk on a given graph. We found that
Let $f: X times Y rightarrow {0,1,bot }$ be a partial function and $mu$ be a distribution with support contained in $f^{-1}(0) cup f^{-1}(1)$. Let $mathsf{D}^{1,mu}_epsilon(f)$ be the classical one-way communication complexity of $f$ with average err
We provide lower and upper bounds on the information transmission capacity of one single use of a classical-quantum channel. The lower bound is expressed in terms of the Hoeffding capacity, that we define similarly to the Holevo capacity, but replaci