Related papers: Scale invariance of entanglement dynamics in Grove…
In this article, we present a novel approach to investigating entanglement in the context of quantum computing. Our methodology involves analyzing reduced density matrices at different stages of a quantum algorithm's execution and…
We demonstrate that, in the case of Shor's algorithm for factoring, highly mixed states will allow efficient quantum computation, indeed factorization can be achieved efficiently with just one initial pure qubit and a supply of initally…
Searching large databases is an important problem with broad applications. The Grover search algorithm provides a powerful method for quantum computers to perform searches with a quadratic speedup in the number of required database queries…
We experimentally prepare a new type of continuous variable genuine four-partite entangled states, the quantum correlation property of which is different from that of the four-mode GHZ and cluster states, and which has not any qubit…
The Grover search algorithm is a pivotal advancement in quantum computing, promising a remarkable speedup over classical algorithms in searching unstructured large databases. Here, we report results for the implementation and…
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…
The ability to generate bipartite entanglement in quantum computing technologies is widely regarded as pivotal. However, the role of genuinely multipartite entanglement is much less understood than bipartite entanglement, particularly in…
The success probability of a search of $M$ targets from a database of size $N$, using Grover's search algorithm depends critically on the number of iterations of the composite operation of the oracle followed by Grover's diffusion…
Detecting entanglement in multipartite quantum states is an inherently probabilistic process, typically with a few measured samples. The level of confidence in entanglement detection quantifies the scheme's validity via the probability that…
Grover's algorithm is a quantum search algorithm that proceeds by repeated applications of the Grover operator and the Oracle until the state evolves to one of the target states. In the standard version of the algorithm, the Grover operator…
Entanglement is a defining feature of many-body quantum systems and is an essential requirement for quantum computing. It is therefore useful to study physical processes which generate entanglement within a large system, as they maybe…
Multipartite entanglement is a crucial resource for a wide range of quantum information processing tasks, including quantum metrology, quantum computing, and quantum communication. The verification of multipartite entanglement, along with…
Genuine multipartite entanglement is crucial for quantum information and related technologies but quantifying it has been a long-standing challenge. Most proposed measures do not meet the ``genuine'' requirement, making them unsuitable for…
Multi-qubit graph states generated by the action of controlled phase shift operators on a separable quantum state of a system, in which all the qubits are in arbitrary identical states, are examined. The geometric measure of entanglement of…
With Hubbard model, the entanglement scaling behavior in a two-dimensional itinerant system is investigated. It has been found that, on the two sides of the critical point denoting an inherent quantum phase transition (QPT), the…
We derive a set of genuine multi-mode entanglement criteria for second moments of the quadrature operators. The criteria have a common form of the uncertainty relation between sums of variances of position and momentum quadrature…
Calibrating the role of entanglement in quantum algorithms is a crucial task in the development of quantum computing. Most existing studies have primarily focused on how the static properties of entanglement-such as its magnitude and…
This paper presented two general quantum search algorithms. We derived the iterated formulas and the simpler approximate formulas and the precise formula for the amplitude in the desired state. A mathematical proof of Grover's algorithm…
In a recent paper it has been shown how to create a quantum state related to the prime number sequence using Grover's algorithm. Moreover, its multiqubit entanglement was analyzed. In the present work, we compare the multiqubit entanglement…
Despite intensive research, the physical origin of the speed-up offered by quantum algorithms remains mysterious. No general physical quantity, like, for instance, entanglement, can be singled out as the essential useful resource. Here we…