Related papers: Scale invariance of entanglement dynamics in Grove…
Entanglement is a key ingredient for quantum technologies and a fundamental signature of quantumness in a broad range of phenomena encompassing many-body physics, thermodynamics, cosmology, and life sciences. For arbitrary multiparticle…
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,…
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…
It is suggested that the individual outcomes of a measurement process can be understood within standard quantum mechanics in terms of the measuring apparatus, treated as a quantum computer, executing Grover's search algorithm.
The desired interference required for quantum computing may be modified by the wave function oscillations for the implementation of quantum algorithms[Phys.Rev.Lett.84(2000)1615]. To diminish such detrimental effect, we propose a scheme…
Current noise levels in physical realizations of qubits and quantum operations limit the applicability of conventional methods to characterize entanglement. In this adverse scenario, we follow a quantum variational approach to estimate the…
On thinking of a Grover-type quantum search algorithm for an ordered tuple of multi-qubit states, a gradient system associated with the negative von-Neumann entropy is studied on the space of regular relative-configurations of multi-qubit…
One of the significant breakthroughs in quantum computation is Grover's algorithm for unsorted database search. Recently, the applications of Grover's algorithm to solve global optimization problems have been demonstrated, where unknown…
Quantum gravity between masses can produce entangled states in thought experiments. We extend the experiments to tripartite case and construct states equivalent to Greenberger- Horne-Zeilinger states and W states under stochastic local…
Quantum algorithms use the principles of quantum mechanics, as for example quantum superposition, in order to solve particular problems outperforming standard computation. They are developed for cryptography, searching, optimisation,…
Grover's algorithm is one of the pioneering demonstrations of the advantages of quantum computing over its classical counterpart, providing - at most - a quadratic speed-up over the classical solution for unstructured database search. The…
Quantum information theory and quantum computing are theoritical basis of quantum computers. Thanks to entanglement, quantum mechanical systems are provisioned to realize many information processing problems faster than classical…
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…
We demonstrate the existence of general constraints on distributed quantum correlations, which impose a trade-off on bipartite and multipartite entanglement at once. For all N-mode Gaussian states under permutation invariance, we establish…
Genuine multipartite entanglement is a valuable resource in quantum information science, as it exhibits stronger non-locality compared to bipartite entanglement. This non-locality can be exploited in various quantum information protocols,…
We develop a method for visualizing the internal structure of multipartite entanglement in pure stabilizer states. Our algorithm graphically organizes the many-body correlations in a hierarchical structure. This provides a rich taxonomy…
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…
Detection of entanglement in quantum states is one of the most important problems in quantum information processing. However, it is one of the most challenging tasks to find a universal scheme which is also desired to be optimal to detect…
First, we show how the quantum circuits for generating and measuring multi-party entanglement of qubits can be translated to continuous quantum variables. We derive sufficient inseparability criteria for $N$-party continuous-variable states…
We analyze the modification of entanglement dynamics in the Grover algorithm when the qubits are subjected to single-qubit amplitude-damping or phase-flip noise. We compare quantum trajectories with full density-matrix simulations,…