相关论文: On the role of entanglement in quantum computation…

Quantum entanglement is a foundational resource in quantum information science, underpinning applications across physics. However, detecting and quantifying entanglement remains a significant challenge. In this article, we introduce a…

Quantifying entanglement is vital to understand entanglement as a resource in quantum information processing, and many entanglement measures have been suggested for this purpose. When mathematically defining an entanglement measure, we…

Quantifying entanglement is an important task by which the resourcefulness of a quantum state can be measured. Here, we develop a quantum algorithm that tests for and quantifies the separability of a general bipartite state by using the…

A new approach to the classical limit of Grover's algorithm is discussed by assuming a very rapid dephasing of a system between consecutive Grover's unitary operations, which drives pure quantum states to decohered mixed states. One can…

Local Operations enhancing the entanglement of bipartite quantum states are of great interest in quantum information processing. Subject of this paper are local selective operations acting on single copies of states. Such operations can…

Though quantum algorithm acts as an important role in quantum computation science, not only for providing a great vision for solving classically unsolvable problems, but also due to the fact that it gives a potential way of understanding…

We study the advantage of pure-state quantum computation without entanglement over classical computation. For the Deutsch-Jozsa algorithm we present the maximal subproblem that can be solved without entanglement, and show that the algorithm…

This note shows how quantum entanglement may be simulated in classical computing. The simulated entanglement protocol is implemented using oblivious transfer in the simplest case and other many-to-one mappings in more general cases. For the…

Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. It has recently been shown that this problem is NP-hard. There is a highly inefficient `basic algorithm'…

We show that combining randomized measurement protocols with importance sampling allows for characterizing entanglement in significantly larger quantum systems and in a more efficient way than in previous work. A drastic reduction of…

Quantum entanglement of pure states of a bipartite system is defined as the amount of local or marginal ({\em i.e.}referring to the subsystems) entropy. For mixed states this identification vanishes, since the global loss of information…

While it seems possible that quantum computers may allow for algorithms offering a computational speed-up over classical algorithms for some problems, the issue is poorly understood. We explore this computational speed-up by investigating…

Resource identification and quantification is an essential element of both classical and quantum information theory. Entanglement is one of these resources, arising when quantum communication and nonlocal operations are expensive to…

We give a review on entanglement purification for bipartite and multipartite quantum states, with the main focus on theoretical work carried out by our group in the last couple of years. We discuss entanglement purification in the context…

Entanglement plays a central role in the field of quantum information science. It is well known that the degree of entanglement cannot be increased under local operations. Here, we show that the concurrence of a bipartite entangled state…

Entanglement shared among multiple parties presents complex challenges for the characterisation of different types of entanglement. One of the most fundamental insights is the fact that some mixed states can feature entanglement across…

We study a quantum switch that distributes maximally entangled multipartite states to sets of users. The entanglement switching process requires two steps: first, each user attempts to generate bipartite entanglement between itself and the…

The role of entanglement and quantum correlations in complex physical systems and quantum information processing devices has become a topic of intense study in the past two decades. In this work we present new tools for learning about…

Efficient generation of large-scale multipartite entangled states is a critical but challenging task in quantum information processing. Although generation of multipartite entanglement within a small set of individual qubits has been…

We propose an algorithm which proves a given bipartite quantum state to be separable in a finite number of steps. Our approach is based on the search for a decomposition via a countable subset of product states, which is dense within all…