Related papers: Multipartite entanglement and Grover's search algo…
Ever since entanglement was identified as a computational and cryptographic resource, effort has been made to find an efficient way to tell whether a given density matrix represents an unentangled, or separable, state. Essentially, this is…
We study the entanglement properties of a class of $N$ qubit quantum states that are generated in arrays of qubits with an Ising-type interaction. These states contain a large amount of entanglement as given by their Schmidt measure. They…
Given two sets A and B and two oracles O(A) and O(B) that can identify the elements of these sets respectively, the goal is to find an element common to both sets using minimum number of oracle queries. Each application of either O(A) or…
Besides the superior efficiency compared to their classical counterparts, quantum algorithms known so far are basically task-dependent, and scarcely any common features are shared between them. In this work, however, we show that the…
We introduce an iterative method to search for time-optimal Hamiltonians that drive a quantum system between two arbitrary, and in general mixed, quantum states. The method is based on the idea of progressively improving the efficiency of…
An analysis on the damped quantum search by exploring the rate at which the target state is obtained. The results were compared with that of the classical search since the standard Grover's algorithm does not give a convergent result if the…
Quantum Entanglement is one of the key manifestations of quantum mechanics that separate the quantum realm from the classical one. Characterization of entanglement as a physical resource for quantum technology became of uppermost…
We question whether the measurement based quantum computing algorithm is in fact Grover's algorithm or simply a similar oracular search method. The two algorithms share several qualitative features especially in the case of the trivial 4…
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…
Local Operations enhancing the entanglement of bipartite quantum states are of great interest in quantum information processing. Subject of this paper are local selective operations acting on single copies of states. Such operations can…
Entanglement is a fundamental aspect of quantum physics, both conceptually and for its many applications. Classifying an arbitrary multipartite state as entangled or separable -- a task referred to as the separability problem -- poses a…
We recast Grover's generalised search algorithm in a geometric language even when the states are not approximately orthogonal. We provide a possible search algorithm based on an arbitrary unitary transformation which can speed up the steps…
We present a construction of genuinely entangled multipartite quantum states based on the group theory. Analyzed states resemble the Dicke states, whereas the interactions occur only between specific subsystems related by the action of the…
Here we suggest a modification of Grover's algorithm, based on a multiphase oracle which marks each solution with a different phase when there is more than one solution. Such a modification can be used to maintain a high probability of…
The discovery of derivatives and integrals was a tremendous leap in scientific knowledge and completely revolutionized many fields, including mathematics, physics, and engineering. The existence of higher-order derivatives means better…
We discuss two qualities of quantum systems: various correlations existing between their subsystems and the distingushability of different quantum states. This is then applied to analysing quantum information processing. While quantum…
Via a multidimensional complementarity relation we derive a novel operational entanglement measure for any discrete quantum system, i.e. for any multidimensional and multipartite system. This new measure admits a separation into different…
The hardness to solve an unstructured quantum search problem by a standard quantum search algorithm mainly originates from the low efficiency to amplify the amplitude of the marked state by the oracle unitary operation associated with other…
The distribution of entanglement in a multiparty system can be described through the principles of monogamy or polygamy. Monogamy is a fundamental characteristic of entanglement that restricts its distribution among several number of…
We present a novel benchmark application of a quantum algorithm to Feynman loop integrals. The two on-shell states of a Feynman propagator are identified with the two states of a qubit and a quantum algorithm is used to unfold the causal…