相关论文: Improved algorithm for quantum separability and en…
Entanglement is at the heart of most quantum information tasks, and therefore considerable effort has been made to find methods of deciding the entanglement content of a given bipartite quantum state. Here, we prove a fundamental limitation…
It is generally believed that entanglement is essential for quantum computing. We present here a few simple examples in which quantum computing without entanglement is better than anything classically achievable, in terms of the reliability…
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…
An outstanding problem in quantum computing is the calculation of entanglement, for which no closed-form algorithm exists. Here we solve that problem, and demonstrate the utility of a quantum neural computer, by showing, in simulation, that…
This thesis focuses on the experimental creation and detection of a variety of quantum correlations using nuclear magnetic resonance hardware. Quantum entanglement, being most common and counter-intuitive, is one of the main type considered…
Separability problem is a long-standing tough issue in quantum information theory. In this paper, we propose a general method to detect entanglement via arbitrary measurement $\boldsymbol{X}$, by which several novel criteria are…
In quantum information and computation, the generation of entanglement through unitary gates remains a significant and active area of research. However, there are states termed as absolutely separable, from which entanglement cannot be…
There has been a surge of progress in recent years in developing algorithms for testing and learning quantum states that achieve optimal copy complexity. Unfortunately, they require the use of entangled measurements across many copies of…
We introduce a sequence of numerical tests that can determine the entanglement or separability of a state even when there is not enough information to completely determine its density matrix. Given partial information about the state in the…
The separability detecting problem of mixed states is one of the fundamental problems in quantum information theory. In the last 20 years, almost all methods are based on the sufficient or necessary conditions for entanglement. However, in…
Multipartite entanglement detection is crucial for the develop of quantum information science and quantum computation, communication, simulation and metrology tasks. In contrast to experiments, where several handreds of qubits have been…
Entanglement detection is essential in quantum information science and quantum many-body physics. It has been proved that entanglement exists almost surely for a random quantum state, while the realizations of effective entanglement…
We propose in this work a practical approach to address the longstanding and challenging problem of quantum separability, leveraging the correlation matrices of generic observables. General separability conditions are obtained by dint of…
In recent years considerable progress has been made towards developing a general theory of quantum entanglement. In particular, criteria to decide whether a given quantum state is entangled are of high theoretical and practical interest.…
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…
We shed new light on entanglement measures in multipartite quantum systems by taking a computational-complexity approach toward quantifying quantum entanglement with two familiar notions--approximability and distinguishability. Built upon…
The detection of multipartite entanglement in arbitrary dimensional systems is investigated. We derive useful $k$-separability criteria of mixed $n$-partite ($n\geq 3$) quantum states to detect $k$-nonseparable $n$-partite quantum states.…
It is pointed out that separability problem for arbitrary multi-partite states can be fully solved by a finite size, elementary recursive algorithm. In the worse case scenario, the underlying numerical procedure, may grow doubly…
Classifying states as entangled or separable is a highly challenging task, while it is also one of the foundations of quantum information processing theory. This task is higly nontrivial even for relatively simple cases, such as two-qutrit…
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…