Related papers: An efficient algorithm to compute entanglement in …
We investigate the Hamming networks that their nodes are considered as quantum harmonic oscillators. The entanglement of the ground state can be used to quantify the amount of information each part of a network shares with the rest of the…
Entanglement of any pure state of an N times N bi-partite quantum system may be characterized by the vector of coefficients arising by its Schmidt decomposition. We analyze various measures of entanglement derived from the generalized…
We study entanglement in two coupled quartic oscillators. It is shown that the entanglement, as measured by the von Neumann entropy, increases with the classical chaos parameter for generic chaotic eigenstates. We consider certain isolated…
The characterization of high-dimensional entanglement plays a crucial role in the field of quantum information science. Conventional entanglement criteria measuring coherent superpositions of multiple basis states face experimental…
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…
Bipartite entanglement in the ground state of a chain of $N$ quantum spins can be quantified either by computing pairwise concurrence or by dividing the chain into two complementary subsystems. In the latter case the smaller subsystem is…
Quantum entanglement is an essential resource for quantum science and technology. However, entanglement detection and quantification, via typical entanglement measures such as linear entanglement entropy or negativity, can be a very…
This thesis explores the use of entangled states in quantum computation and quantum information science. Entanglement, a quantum phenomenon with no classical counterpart, has been identified as an important and quantifiable resource in many…
Recent developments in classical simulation of quantum circuits make use of clever decompositions of chunks of magic states into sums of efficiently simulable stabiliser states. We show here how, by considering certain non-stabiliser…
The unambiguous detection and quantification of entanglement is a hot topic of scientific research, though it is limited to low dimensions or specific classes of states. Here we identify an additional class of quantum states, for which…
We investigate the entanglement features of the quantum states employed in quantum algorithms. In particular, we analyse the multipartite entanglement properties in the Deutsch-Jozsa, Grover and Simon algorithms. Our results show that for…
Entanglement measures quantify the amount of quantum entanglement that is contained in quantum states. Typically, different entanglement measures do not have to be partially ordered. The presence of a definite partial order between two…
We show how a straightforward Bayesian updating procedure allows one to detect and quantify entanglement from any finite set of measurement results. The measurements do not have to be tomographically complete, and may consist of POVMs…
The Shannon entropy of a collection of random variables is subject to a number of constraints, the best-known examples being monotonicity and strong subadditivity. It remains an open question to decide which of these "laws of information…
Coherence and entanglement are fundamental properties of quantum systems, promising to power the near future quantum computers, sensors and simulators. Yet, their experimental detection is challenging, usually requiring full reconstruction…
Measuring entanglement entropy in interacting, multipartite systems remains a significant experimental challenge. We address this challenge by developing a protocol to measure von Neumann entropy (VNE) and mutual information in quantum…
Graph states represent a significant class of multi-partite entangled quantum states with applications in quantum error correction, quantum communication, and quantum computation. In this work, we introduce a novel formalism called the…
We show that any pseudoentangled state ensemble with a gap of $t$ bits of entropy requires $\Omega(t)$ non-Clifford gates to prepare. This bound is tight up to polylogarithmic factors if linear-time quantum-secure pseudorandom functions…
Entanglement, and quantum correlation, are precious resources for quantum technologies implementation based on quantum information science, such as, for instance, quantum communication, quantum computing, and quantum interferometry.…
Entanglement is a unique feature of quantum mechanics. In coupled systems of light and matter, entanglement manifests itself in the linear superposition of multipartite quantum states (e.g., parametrized by the multiple spatial, spectral,…