Related papers: An efficient algorithm to compute entanglement in …
The quantification and classification of quantum entanglement is a very important and still open question of quantum information theory. In this paper, we describe an entanglement measure for multipartite pure states (the minimum of…
Detection of entanglement is an indispensable step to practical quantum computation and communication. Compared with the conventional entanglement witness method based on fidelity, we propose a flexible, machine learning assisted…
We present a method to measure the von Neumann entanglement entropy of ground states of quantum many-body systems which does not require access to the system wave function. The technique is based on a direct thermodynamic study of…
Quantum entropy is an important measure for describing the uncertainty of a quantum state, more uncertainty in subsystems implies stronger quantum entanglement between subsystems. Our goal in this work is to quantify bipartite entanglement…
The entanglement entropy (von Neumann entropy) has been used to characterize the complexity of many-body ground states in strongly correlated systems. In this paper, we try to establish a connection between the lower bound of the von…
Non-stabilizerness - also colloquially referred to as magic - is the a resource for advantage in quantum computing and lies in the access to non-Clifford operations. Developing a comprehensive understanding of how non-stabilizerness can be…
With the advance of quantum information technology, the question of how to most efficiently test quantum circuits is becoming of increasing relevance. Here we introduce the statistics of lengths of measurement sequences that allows one to…
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…
We explore and develop the mathematics of the theory of entanglement measures. After a careful review and analysis of definitions, of preliminary results, and of connections between conditions on entanglement measures, we prove a sharpened…
We develop a graph-based method to study the entanglement entropy of Calderbank-Shor-Steane quantum codes. This method offers a straightforward interpretation for the entanglement entropy of quantum error correcting codes through…
The von Neumann entanglement entropy is a useful measure to characterize a quantum phase transition. We investigate the non-analyticity of this entropy at disorder-dominated quantum phase transitions in non-interacting electronic systems.…
We develop classical simulation algorithms for adaptive quantum circuits that produce states with low levels of ``magic'' (i.e., non-stabilizerness). These algorithms are particularly well-suited to circuits with high rates of Pauli…
Notions of nonstabilizerness, or "magic", quantify how non-classical quantum states are in a precise sense: states exhibiting low nonstabilizerness preclude quantum advantage. We introduce 'pseudomagic' ensembles of quantum states that,…
Quantum entanglement of pure states is usually quantified via the entanglement entropy, the von Neumann entropy of the reduced state. Entanglement entropy is closely related to entanglement distillation, a process for converting quantum…
Quantum entanglement plays a crucial role in quantum information, quantum teleportation and quantum computation. The information about the entanglement content between subsystems of the composite system is encoded in the Schmidt…
We study the behavior of bipartite entanglement at fixed von Neumann entropy. We look at the distribution of the entanglement spectrum, that is the eigenvalues of the reduced density matrix of a quantum system in a pure state. We report the…
We introduce an experimental procedure for the detection of quantum entanglement of an unknown quantum state with as few measurements as possible. The method requires neither a priori knowledge of the state nor a shared reference frame…
It is known that if the quantum gates in a proposed quantum computer are so noisy that they are incapable of generating entanglement, then the device can be efficiently simulated classically. If the measurements and single particle…
Quantum algorithms could efficiently solve certain classically intractable problems by exploiting quantum parallelism. To date, whether the quantum entanglement is useful or not for quantum computing is still a question of debate. Here, we…
Quantifying entanglement is a work in progress which is important for the active field of quantum information and computation. A measure of bipartite pure state entanglement is proposed here, named entanglement coherence, which is…