Related papers: Scale invariance of entanglement dynamics in Grove…
Quantum walks, both discrete (coined) and continuous time, form the basis of several recent quantum algorithms. Here we use numerical simulations to study the properties of discrete, coined quantum walks. We investigate the variation in the…
We present a continuous time quantum search algorithm analogous to Grover's. In particular, the optimal search time for this algorithm is proportional to $\sqrt{N}$, where $N$ is the database size. This search algorithm can be implemented…
We provide a method to construct entanglement criteria for arbitrary multipartite systems of discrete or continuous variables and hybrid combinations of both. While any set of local operators generates a sufficient condition for…
Entangled systems in experiments may be lost or offline in distributed quantum information processing. This inspires a general problem to characterize quantum operations which result in breaking of entanglement or not. Our goal in this work…
The Grover algorithm is a crucial solution for addressing unstructured search problems and has emerged as an essential quantum subroutine in various complex algorithms. By using a different approach with previous studies, this research…
We investigate the dynamics of entanglement and nonlocality for multipartite quantum systems under collective dephasing. Using an exact and computable measure for genuine entanglement, we demonstrate the possibility of a non trivial…
Entanglement is the hallmark of quantum physics, yet its characterization in interacting many-body systems at thermal equilibrium remains one of the most important challenges in quantum statistical physics. We prove that the Gibbs state of…
We derive a general framework to identify genuinely multipartite entangled mixed quantum states in arbitrary-dimensional systems and show in exemplary cases that the constructed criteria are stronger than those previously known. Our…
Entanglement in high-dimensional many-body systems plays an increasingly vital role in the foundations and applications of quantum physics. In the present paper, we introduce a theoretical concept which allows to categorize multipartite…
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…
The search problem is to find a state satisfying certain properties out of a given set. Grover's algorithm drives a quantum computer from a prepared initial state to the target state and solves the problem quadratically faster than a…
Entanglement is a distinguishing feature of quantum many-body systems, and uncovering the entanglement structure for large particle numbers in quantum simulation experiments is a fundamental challenge in quantum information science. Here we…
Conditions on sure-success decidability of weights of Boolean functions are presented for a given number of generalized Grover iterations. It is shown that the decidability problem reduces to a system of algebraic equations of a single…
Recently, it was shown that if two distant test masses, each in a spatially superposed quantum state, become entangled due to their mutual gravitational interaction, then this entanglement could serve as evidence of the quantum nature of…
Multipartite entanglement is a natural generalization of bipartite entanglement, but is relatively poorly understood. In this paper, we develop tools to calculate a class of multipartite entanglement measures - known as multi-invariants -…
The optimal runtime of a quantum computer searching a database is typically cited as the square root of the number of items in the database, which is famously achieved by Grover's algorithm. With parallel oracles, however, it is possible to…
We employ a genuine multipartite entanglement measure, the generalized geometric measure, for investigating the quantum phase transition in an infinite quantum spin-1/2 chain with two-spin as well as three-spin interactions. We show that in…
We study the growth of genuine multipartite entanglement in random quantum circuit models, which include random unitary circuit models and the random Clifford circuit. We find that for the random Clifford circuit, the growth of multipartite…
Quantum counting is a key quantum algorithm that aims to determine the number of marked elements in a database. This algorithm is based on the quantum phase estimation algorithm and uses the evolution operator of Grover's algorithm because…
Grover's algorithm is a quantum query algorithm solving the unstructured search problem of size $N$ using $O(\sqrt{N})$ queries. It provides a significant speed-up over any classical algorithm \cite{Gro96}. The running time of the…