Related papers: Grover's algorithm based multi-qubit secret sharin…
An important and usual problem is to search all states we want from a database with a large number of states. In such, recall is vital. Grover's original quantum search algorithm has been generalized to the case of multiple solutions, but…
Replication of DNA and synthesis of proteins are studied from the view-point of quantum database search. Identification of a base-pairing with a quantum query gives a natural (and first ever) explanation of why living organisms have 4…
We introduce a protocol for quantum secret sharing based on reusable entangled states. The entangled state between the sender and the receiver acts only as a carrier to which data bits are entangled by the sender and disentangled from it by…
In this summary we discuss two new algorithms for Grover's unsorted database search problem that claimed to have reached exponential speedup over Grover's original algorithm. One is in the quantum setting with "power queries" that allow for…
We build a quantum algorithm which uses the Grover quantum search procedure in order to sample the exact equilibrium distribution of a wide range of classical statistical mechanics systems. The algorithm is based on recently developed exact…
In this note, we study some properties of the GHZ state. First, we present a quantum secret sharing scheme in which the participants require only classical channels in order to reconstruct the secret; our protocol is significantly more…
Entanglement plays a crucial role in quantum processes particularly those pertaining to quantum information and computation. An analytical expression for entanglement measure defined in terms of success rate of Grover's search algorithm has…
This article highlights some of the key operating principles of Grover algorithm. These principles were used to develop a new oracle function, that illustrates the possibility of using Grover algorithm for solving more realistic and…
Let Boolean function $f:\{0,1\}^n\longrightarrow \{0,1\}$ where $|\{x\in\{0,1\}^n| f(x)=1\}|=a\geq 1$. To search for an $x\in\{0,1\}^n$ with $f(x)=1$, by Grover's algorithm we can get the objective with query times $\lfloor…
Withdrawn by the author due to irreparable errors. We present a quantum algorithm that in the black-box model performs a search in an ordered list of N elements. Using 3/4 log N + O(1) queries, it achieves a success probability of at least…
Grover's algorithm for quantum searching of a database is generalized to deal with arbitrary initial amplitude distributions. First order linear difference equations are found for the time evolution of the amplitudes of the r marked and N-r…
We investigate the concept of quantum secret sharing. In a ((k,n)) threshold scheme, a secret quantum state is divided into n shares such that any k of those shares can be used to reconstruct the secret, but any set of k-1 or fewer shares…
Logic entailment is essential to reasoning, but entailment checking has the worst-case complexity of an exponential of the variable size. With recent development, quantum computing when mature may allow an effective approach for various…
Grover search algorithm drives a quantum system from an initial state to a desired final state by using selective phase inversions of these two states. In (1), we studied a generalization of Grover algorithm which relaxes the assumption of…
A probabilistic secret sharing scheme is a joint probability distribution of the shares and the secret together with a collection of secret recovery functions. The study of schemes using arbitrary probability spaces and unbounded number of…
Grover's algorithm has achieved great success. But quantum search algorithms still are not complete algorithms because of Grover's Oracle. We concerned on this problem and present a new quantum search algorithm in adiabatic model without…
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…
A physical implementation of the adiabatic Grover search is theoretically investigated in a system of N identical three-level atoms trapped in a single mode cavity. Some of the atoms are marked through the presence of an energy gap between…
We consider three broad classes of quantum secret sharing with and without eavesdropping and show how a graph state formalism unifies otherwise disparate quantum secret sharing models. In addition to the elegant unification provided by…
We present a quantum probabilistic encryption algorithm for a private-key encryption scheme based on conjugate coding of the qubit string. A probabilistic encryption algorithm is generally adopted in public-key encryption protocols. Here we…