Related papers: Grover's search with local and total depolarizing …
We derive critical noise levels for Gallager codes on asymmetric channels as a function of the input bias and the temperature. Using a statistical mechanics approach we study the space of codewords and the entropy in the various decoding…
When applying Grover's algorithm to an unordered database, the probability of obtaining correct results usually decreases as the quantity of target increases. To amend the limitation, numbers of improved schemes are proposed. In this paper,…
We investigate the distributed dense coding (DC) protocol, involving multiple senders and a single or two receivers under the influence of non-Markovian noise, acting on the encoded qubits transmitted from senders to the receiver(s). We…
It is by now well established that noise itself can be useful for performing quantum information processing tasks. We present results which show how one can effectively reduce the error rate associated with a noisy quantum channel, by…
We consider the problem of private distributed multi-party multiplication. It is well-established that Shamir secret-sharing coding strategies can enable perfect information-theoretic privacy in distributed computation via the celebrated…
We invoke an efficient search algorithms as a key challenge in multi-qubit quantum systems. An original algorithm called dynamical quantum search algorithm from which Grover algorithm is obtained at a specified time is presented. This…
In this work, we propose a fully differentiable graph neural network (GNN)-based architecture for channel decoding and showcase a competitive decoding performance for various coding schemes, such as low-density parity-check (LDPC) and BCH…
Nonlinear boolean equation systems play an important role in a wide range of applications. Grover's algorithm is one of the best-known quantum search algorithms in solving the nonlinear boolean equation system on quantum computers. In this…
Decentralized nonconvex optimization has received increasing attention in recent years in machine learning due to its advantages in system robustness, data privacy, and implementation simplicity. However, three fundamental challenges in…
We compare the performance of short-length linear binary codes on the binary erasure channel and the binary-input Gaussian channel. We use a universal decoder that can decode any linear binary block code: Gaussian-elimination based…
We study effects of static inter-qubit interactions on the stability of the Grover quantum search algorithm. Our numerical and analytical results show existence of regular and chaotic phases depending on the imperfection strength…
To decide whether a quantum channel is degradable is relatively easy: one has to find at least one example of a degrading quantum channel. But in general, no conclusive criterion exists to show the opposite. Using elementary methods we…
We estimate optimal thresholds for surface code in the presence of loss via an analytical method developed in statistical physics. The optimal threshold for the surface code is closely related to a special critical point in a…
Quantum multi-programming is a method utilizing contemporary noisy intermediate-scale quantum computers by executing multiple quantum circuits concurrently. Despite early research on it, the research remains on quantum gates or small-size…
We establish a lower bound concerning the computational complexity of Grover's algorithms on fractal networks. This bound provides general predictions for the quantum advantage gained for searching unstructured lists. It yields a…
We investigate robustness of probabilistic storage and retrieval device optimized for phase gates to noise. We use noisy input composed of convex combination of unitary channel with either depolarizing or dephasing channel. We find out that…
We derive exact analytical expressions for the quantum capacity of a broad subclasses of generalized dephasing channels of the form $\Lambda(\rho)=(1-x)\rho + x D(\rho)$, where $D(\rho)$ represents a structured decoherence process. These…
Grover's database search algorithm, although discovered in the context of quantum computation, can be implemented using any system that allows superposition of states. A physical realization of this algorithm is described using coupled…
Grover's algorithm provides a quadratic speedup over classical algorithms to search for marked elements in an unstructured database. The original algorithm is probabilistic, returning a marked element with bounded error. There are several…
In this work we address two questions concerning Grover's algorithm. In the first we give an answer to the question how to employ Grover's algorithm for actual search over database. We introduce a quantum model of an unordered phone book…