Related papers: The quadratic speedup in Grover's search algorithm…
This paper demonstrates the use of entanglement resources in quantum speedup by presenting an algorithm which is the generalization of an algorithm proposed by Goswami and Panigrahi [arXiv:1706.09489 (2017)]. We generalize the algorithm and…
We provide a tight analysis of Grover's recent algorithm for quantum database searching. We give a simple closed-form formula for the probability of success after any given number of iterations of the algorithm. This allows us to determine…
Quantum search is among the most important algorithms in quantum computing. At its core is quantum amplitude amplification, a technique that achieves a quadratic speedup over classical search by combining two global reflections: the oracle,…
Grover's database search algorithm is the optimal algorithm for finding a desired object from an unsorted collection of items. Although it was discovered in the context of quantum computation, it is simple and versatile enough to be…
The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an…
We analytically obtain the maximum probability of converting a finite number of copies of an arbitrary two-qubit pure state to a single copy of a maximally entangled two-qubit pure state via entanglement assisted local operations and…
The description of gene interactions that constantly occur in the cellular environment is an extremely challenging task due to an immense number of degrees of freedom and incomplete knowledge about microscopic details. Hence, a…
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,…
Entanglement has been termed a critical resource for quantum information processing and is thought to be the reason that certain quantum algorithms, such as Shor's factoring algorithm, can achieve exponentially better performance than their…
Targeting entailment model checking, a recent study has pioneered an idea of Eigenmarking search, an improvement over Grover search using extra qubits. The extra qubits condition the quantum state evolution such that the answer states (if…
In a quantum computation with pure states, the generation of large amounts of entanglement is known to be necessary for a speedup with respect to classical computations. However, examples of quantum computations with mixed states are known,…
A quantum state's entanglement across a bipartite cut can be quantified with entanglement entropy or, more generally, Schmidt norms. Using only Schmidt decompositions, we present a simple iterative algorithm to maximize Schmidt norms.…
Since Grover's seminal work, quantum search has been studied in great detail. In the usual search problem, we have a collection of n items and we would like to find a marked item. We consider a new variant of this problem in which…
How entangled is a randomly chosen bipartite stabilizer state? We show that if the number of qubits each party holds is large the state will be close to maximally entangled with probability exponentially close to one. We provide a similar…
Time evolution of initially prepared entangled state in the system of coupled quantum dots has been analyzed by means of two different theoretical approaches: equations of motion for the all orders localized electron correlation functions,…
In typical discrete-time quantum walk algorithms, one measures the position of the walker while ignoring its internal spin/coin state. Rather than neglecting the information in this internal state, we show that additionally measuring it…
For the unsorted database quantum search with the unknown fraction $\lambda$ of target items, there are mainly two kinds of methods, i.e., fixed-point or trail-and-error. (i) In terms of the fixed-point method, Yoder et al. [Phys. Rev.…
Quantum search algorithms, such as Grover's algorithm, are anticipated to efficiently solve constrained combinatorial optimization problems. However, applying these algorithms to the traveling salesman problem (TSP) on a quantum circuit…
In this work we study the entanglement of pure fourpartite of qubit states. The analysis is realized through the comparison between two different entanglement measures: the Groverian entanglement measure and the residual entanglement…
Considerable progress has been made in understanding how dissipation drives the state of a single qubit from a quantum-mechanical superposition to a classical mixed state. This paper uses a Bloch-Redfield approach to study how, in a system…