相关论文: A Simple Algorithm for Local Conversion of Pure St…
It is shown that generic N-party pure quantum states (with equidimensional subsystems) are uniquely determined by their reduced states of just over half the parties; in other words, all the information in almost all N-party pure states is…
Unitary operations are physically implementable. We further the understanding of such operations by studying the possible forms of nonlocal unitary operators, which are bipartite or multipartite unitary operators that are not tensor product…
The correspondence between local unitary equivalence of bipartite quantum states and simultaneous orthogonal equivalence is thoroughly investigated and strengthened. It is proved that local unitary equivalence can be studied through…
Based on a proposed coherence measure, we show that the local coherence of a bipartite quantum pure state (coherence of its reduced density matrix) is exactly the same as the minimal average co- herence with all potential pure-state…
A generic unital positive operator-valued measure (POVM), which transforms a given stationary pure state to an arbitrary statistical state with perfect decoherence, is presented. This allows one to operationally realize thermalization as a…
Suppose we want to distinguish two quantum pure states. We consider the case in which no classical knowledge on the two states is given and only a pair of samples of the two states is available. This problem is called quantum pure-state…
Motivated by link transformations of lattice gauge theory, a method for generating local unitary invariants, especially for a system of qubits, has been pointed out in an earlier work [M. S. Williamson {\it et. al.}, Phys. Rev. A {\bf 83},…
Qubit-resolved operations and measurements are required for most current quantum information processing schemes. However, these operations can be experimentally costly due to the need for local addressing, demanding significant classical…
Entanglement of pure states of bipartite quantum systems has been shown to have a unique measure in terms of the von Neumann entropy of the reduced states of either of its subsystems. The measure is established under entanglement…
In many quantum information processing applications, it is important to be able to transfer a quantum state from one location to another - even within a local device. Typical approaches to implement the quantum state transfer rely on…
We present a method of optimizing recently designed protocols for implementing an arbitrary nonlocal unitary gate acting on a bipartite system. These protocols use only local operations and classical communication with the assistance of…
The initial state creation is a starting point of many quantum algorithms and usually is considered as a separate subroutine not included into the algorithm itself. There are many algorithms aimed on creation of special class of states. Our…
The ability to perform a universal set of quantum operations based solely on static resources and measurements presents us with a strikingly novel viewpoint for thinking about quantum computation and its powers. We consider the two major…
We propose a learning method for estimating unknown pure quantum states. The basic idea of our method is to learn a unitary operation $\hat{U}$ that transforms a given unknown state $|\psi_\tau\rangle$ to a known fiducial state $|f\rangle$.…
Linden, Massar and Popescu have recently given an optimization argument to show that a single two-qubit Werner state, or any other mixture of the maximally entangled Bell states, cannot be purified by local operations and classical…
We describe a protocol which can be used to generate any N-partite pure quantum state using Einstein-Podolsky-Rosen (EPR) pairs. This protocol employs only local operations and classical communication between the N parties (N-LOCC). In…
A fundamental task in quantum information science is to transfer an unknown state from particle $A$ to particle $B$ (often in remote space locations) by using a bipartite quantum operation $\mathcal{E}^{AB}$. We suggest the power of…
We describe a quantum algorithm for preparing states that encode solutions of non-homogeneous linear partial differential equations. The algorithm is a continuous-variable version of matrix inversion: it efficiently inverts differential…
The quantum permutation algorithm provides computational speed-up over classical algorithms in determining the parity of a given cyclic permutation. For its $n$-qubit implementations, the number of required quantum gates scales…
Local state transformation is the problem of transforming an arbitrary number of copies of a bipartite resource state to a bipartite target state under local operations. That is, given two bipartite states, is it possible to transform an…