Related papers: Scale invariance of entanglement dynamics in Grove…
We present a study of the entanglement properties of Gaussian cluster states, proposed as a universal resource for continuous-variable quantum computing. A central aim is to compare mathematically-idealized cluster states defined using…
We present a new approach to the analysis of entanglement in smooth bipartite continuous-variable states. One or both parties perform projective filterings via preliminary measurements to determine whether the system is located in some…
Detecting genuine multipartite entanglement (GME) is a state-characterization task that benchmarks coherence and experimental control in quantum systems. Existing GME tests often require joint measurements on many qubits, posing challenges…
We study the entanglement dynamics of a family of quantum collision models by analytically solving the pairwise concurrence for all qubit pairs. We introduce a diagrammatic method that offers an intuitive, frame-by-frame understanding of…
We investigate the entanglement properties of pure quantum states describing $n$ qubits. We characterize all multipartite states which can be maximally entangled to local auxiliary systems using controlled operations. A state has this…
We present a full implementation and simulation of a novel quantum reinforcement learning method. Our work is a detailed and formal proof of concept for how quantum algorithms can be used to solve reinforcement learning problems and shows…
We build a quantum algorithm which uses the Grover quantum search procedure in order to sample the exact equilibrium distribution of a wide range of classical statistical mechanics systems. The algorithm is based on recently developed exact…
In the past decades, quantum entanglement has been recognized to be the basic resource in quantum information theory. A fundamental need is then the understanding its qualification and its quantification: Is the quantum state entangled, and…
Quantum contextuality is a limitation on deterministic hidden variable models, testable in measurement scenarios where outcomes differ under quantum or classical descriptions due to a common set of constraints. When considering measurements…
We study effects of static inter-qubit interactions on the stability of the Grover quantum search algorithm. Our numerical and analytical results show existence of regular and chaotic phases depending on the imperfection strength…
Grover's quantum algorithm improves any classical search algorithm. We show how random Gaussian noise at each step of the algorithm can be modelled easily because of the exact recursion formulas available for computing the quantum amplitude…
Studies of entanglement in many-particle systems suggest that most quantum critical ground states have infinitely more entanglement than non-critical states. Standard algorithms for one-dimensional many-particle systems construct model…
The one clean qubit model of quantum computation (DQC1) efficiently implements a computational task that is not known to have a classical alternative. During the computation, there is never more than a small but finite amount of…
This work considers a generalization of Grover's search problem, viz., to find any one element in a set of acceptable choices which constitute a fraction f of the total number of choices in an unsorted data base. An infinite family of…
Entanglement is a key property in the development of quantum technologies and in the study of quantum many-body simulations. However, entanglement measurement typically requires quantum full-state tomography (FST). Here we present a neural…
Controlling dynamical fluctuations in open quantum systems is essential both for our comprehension of quantum nonequilibrium behaviour and for its possible application in near-term quantum technologies. However, understanding these…
We present a method to detect entanglement partitions of multipartite quantum systems, by exploiting their inherent symmetries. Structures like genuinely multipartite entanglement, $m$-separability and entanglement depth are detected as…
Numerous conceptually important quantum algorithms rely on a black-box device known as an oracle, which is typically difficult to construct without knowing the answer to the problem that the algorithm is intended to solve. A notable example…
Grover's algorithm provides a quadratic speedup over classical algorithms to search for marked elements in an unstructured database. The original algorithm is probabilistic, returning a marked element with bounded error. There are several…
The degree to which a pure quantum state is entangled can be characterized by the distance or angle to the nearest unentangled state. This geometric measure of entanglement is explored for bi-partite and multi-partite pure and mixed states.…