Related papers: Scale invariance of entanglement dynamics in Grove…
We present a theoretical study of entanglement in ensembles consisting of an arbitrary number of particles. Multipartite entanglement criteria in terms of observables are formulated for a fixed number of particles as well as for systems…
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…
For any quantum algorithm operating on pure states we prove that the presence of multi-partite entanglement, with a number of parties that increases unboundedly with input size, is necessary if the quantum algorithm is to offer an…
We present proper genuine multipartite entanglement (GME) measures for arbitrary multipartite and dimensional systems. By using the volume of concurrence regular polygonal pyramid we first derive the GME measure of four-partite quantum…
Entanglement does not correspond to any observable and its evaluation always corresponds to an estimation procedure where the amount of entanglement is inferred from the measurements of one or more proper observables. Here we address…
Grover's search algorithm is designed to be executed on a quantum mechanical computer. In this paper, the probabilistic wp-calculus is used to model and reason about Grover's algorithm. It is demonstrated that the calculus provides a…
While the scaling of entanglement in a quantum system can be used to distinguish many-body quantum phases, it is usually hard to quantify the amount of entanglement in mixed states of open quantum systems, while measuring entanglement…
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.…
Entanglement is a hallmark of quantum theory, yet it alone does not capture the full extent of quantum complexity: some highly entangled states can still be classically simulated. Non-classical behavior also requires magic, the non-Clifford…
Searching a database is a central task in computer science and is paradigmatic of transport and optimization problems in physics. For an unstructured search, Grover's algorithm predicts a quadratic speedup, with the search time…
Quantum entanglement is a foundational resource in quantum information science, underpinning applications across physics. However, detecting and quantifying entanglement remains a significant challenge. In this article, we introduce a…
A new approach to the classical limit of Grover's algorithm is discussed by assuming a very rapid dephasing of a system between consecutive Grover's unitary operations, which drives pure quantum states to decohered mixed states. One can…
We derive a hierarchy of continuous-variable multipartite entanglement conditions in terms of second-order moments of position and momentum operators that generalizes existing criteria. Each condition corresponds to a convex optimization…
Multipartite entanglement has been widely regarded as key resources in distributed quantum computing, for instance, multi-party cryptography, measurement based quantum computing, quantum algorithms. It also plays a fundamental role in…
A key lesson of the decoherence program is that information flowing out from an open system is stored in the quantum state of the surroundings. Simultaneously, quantum measurement theory shows that the evolution of any open system when its…
This paper concerns the Grover algorithm that permits to make amplification of quantum states previously tagged by an Oracle. Grover's algorithm allows searches in an unstructure database of n entries finding a marked element with a…
Amplitude Amplification -- a key component of Grover's Search algorithm -- uses an iterative approach to systematically increase the probability of one or multiple target states. We present novel strategies to enhance the amplification…
Quantum entanglement plays an important role in quantum computation and communication. It is necessary for many protocols and computations, but causes unexpected disturbance of computational states. Hence, static analysis of quantum…
We present a multipartite entanglement measure for $N$-qubit pure states, using the norm of the correlation tensor which occurs in the Bloch representation of the state. We compute this measure for several important classes of $N$-qubit…
Entanglement of high-dimensional quantum systems has become increasingly important for quantum communication and experimental tests of nonlocality. However, many effects of high-dimensional entanglement can be simulated by using multiple…