Blind quantum computing enables quantum-limited clients to securely access untrusted quantum servers. This paper proposes a three-party verifiable blind quantum computing protocol with separated input and function ownership, where Alice holds the private input, Bob holds the target function, and Charlie performs the de...
Yun-Hao Feng, Rigui Zhou, Ran Guo et al.· Physica Scripta· 0 citations
Let $X$ be an alphabet, let $t\geq 0$ and $n\geq t+1$, and let $((a_i,b_i))_{i=1}^{m}$ be an ordered family of word pairs in $X^n$ satisfying $dist(a_i,b_i)\geq t+1$ for every $i$ and $dist(a_i,b_j)\leq t$ whenever $i<j$. We prove the sharp bound $m\leq 2^{t+1}$, thereby resolving a problem posed by Alon, Jin, and Suda...
Guorong Gao, Run-Han Zhao· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.