Related papers: Multipartite entanglement and Grover's search algo…
Classifying states as entangled or separable is a highly challenging task, while it is also one of the foundations of quantum information processing theory. This task is higly nontrivial even for relatively simple cases, such as two-qutrit…
Grover's algorithm achieves a quadratic speedup over classical algorithms, but it is considered necessary to know the value of $\lambda$ exactly [Phys. Rev. Lett. 95, 150501 (2005); Phys. Rev. Lett. 113, 210501 (2014)], where $\lambda$ is…
In this work, we consider a family of sure-success quantum algorithms, which is grouped into even and odd members for solving a generalized Grover search problem. We prove the matching conditions for both groups and give the corresponding…
In standard Grover's algorithm for quantum searching, the probability of finding the marked item is not exactly 1. In this Letter we present a modified version of Grover's algorithm that searches a marked state with full successful rate.…
A proof-of-concept application of a quantum algorithm to multiloop Feynman integrals in the Loop-Tree Duality (LTD) framework is applied to a representative four-loop topology. Bootstrapping causality in the LTD formalism, is a suitable…
A general quantum search algorithm with arbitrary unitary transformations and an arbitrary initial state is considered in this work. To serach a marked state with certainty, we have derived, using an SU(2) representation: (1) the matching…
The essential operations of a quantum computer can be accomplished using solely optical elements, with different polarization or spatial modes representing the individual qubits. We present a simple all-optical implementation of Grover's…
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…
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…
We investigate the performance of Grover's quantum search algorithm on a register which is subject to loss of the particles that carry the qubit information. Under the assumption that the basic steps of the algorithm are applied correctly…
A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum…
Multipartite entanglement is an essential resource for quantum information tasks, but characterizing entanglement structures in continuous variable systems remains challenging, especially in multimode non-Gaussian scenarios. In this work,…
Grover's Search algorithm was a breakthrough at the time it was introduced, and its underlying procedure of amplitude amplification has been a building block of many other algorithms and patterns for extracting information encoded in…
Grover's database search algorithm, although discovered in the context of quantum computation, can be implemented using any physical system that allows superposition of states. A physical realization of this algorithm is described using…
We propose a deterministic scheme of generating genuine multiparty entangled states in quantum networks of arbitrary size having various geometric structures -- we refer to it as entanglement circulation. The procedure involves optimization…
Recent studies have been spurred on by the promise of advanced quantum computing technology, which has led to the development of quantum computer simulations on classical hardware. Grover's quantum search algorithm is one of the well-known…
Grover's quantum search algorithm is considered as one of the milestone in the field of quantum computing. The algorithm can search for a single match in a database with $N$ records in $O(\sqrt{N})$ assuming that the item must exist in the…
Numerous conceptually important quantum algorithms rely on a black-box device known as an oracle, which is typically difficult to construct without knowing the answer to the problem that the algorithm is intended to solve. A notable example…
The bipartite entanglement of a pure quantum state is known to be characterized by its Schmidt decomposition. In particular the state is maximally entangled when all the Schmidt coefficients are equal. We point out a convenient method which…
Quantum algorithms have demonstrated provable speedups over classical counterparts, yet establishing a comprehensive theoretical framework to understand the quantum advantage remains a core challenge. In this work, we decode the quantum…