Related papers: Efficient bipartite quantum state purification in …
The local purity of large many-body quantum systems can be studied by following a statistical mechanical approach based on a random matrix model. Restricting the analysis to the case of global pure states, this method proved to be…
It is well-known that Shor's factorization algorithm, Simon's period-finding algorithm, and Deutsch's original XOR algorithm can all be formulated as solutions to a hidden subgroup problem. Here the salient features of the…
We investigate general probabilistic theories in which every mixed state has a purification, unique up to reversible channels on the purifying system. We show that the purification principle is equivalent to the existence of a reversible…
Quantum networks, which integrate multiple quantum computers and the channels connecting them, are crucial for distributed quantum information processing but remain inherently susceptible to channel noise. Channel purification emerges as a…
We propose an entanglement purification scheme based on material qubits and ancillary coherent multiphoton states. We consider a typical QED scenario where material qubits implemented by two-level atoms fly sequentially through a cavity and…
We propose and investigate a method to optimize recurrence entanglement purification protocols. The approach is based on a numerical search in the whole set of SU(4) matrices with the aid of a quasi-Newton algorithm. Our method evaluates…
We consider universal aspects of two problems: (i) the slow purification of a large number of qubits by repeated quantum measurements, and (ii) the singular value structure of a product ${m_t m_{t-1}\ldots m_1}$ of many large random…
It is well known that the Schmidt decomposition exists for all pure states of a two-party quantum system. We demonstrate that there are two ways to obtain an analogous decomposition for arbitrary rank-1 operators acting on states of a…
Recently Horodecki et al. [Phys. Rev. Lett. 90, 100402 (2003)] introduced an important quantum information processing paradigm, in which two parties sharing many copies of the same bipartite quantum state distill local pure states, by means…
Presented here is a matrix inversion method utilizing quantum searching algorithm. In this method, huge Hilbert space as a whole spanned by myriad of eigen states is searched and evaluated efficiently by sequential reduction in dimension…
We present a new control algorithm and system design for a network of quantum repeaters, and outline the end-to-end protocol architecture. Such a network will create long-distance quantum states, supporting quantum key distribution as well…
The entanglement resource required for quantum information processing comes in a variety of forms, from Bell states to multipartite GHZ states or cluster states. Purifying these resources after their imperfect generation is an indispensable…
We propose a class of randomized quantum algorithms for the task of sampling from matrix functions, without the use of quantum block encodings or any other coherent oracle access to the matrix elements. As such, our use of qubits is purely…
A simple method is proposed to prepare conveniently the effective pure state |00...0><0...00| with any number of qubits in a quantum ensemble. The preparation is based on the temporal averaging (Knill, Chuang, and Laflamme, Phys.Rev.A 57,…
We consider entanglement purification protocols for multiple copies of qubit states. We use high-dimensional auxiliary entangled systems to learn about number and positions of errors in the noisy ensemble in an explicit and controlled way,…
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 hybrid approach to quantum computation simultaneously utilizes both discrete and continuous variables which offers the advantage of higher density encoding and processing powers for the same physical resources. Trapped ions, with…
An entanglement purification scheme for arbitrary unknown(mixed and pure non-maximally) entangled ionic states is proposed by using linear optical elements. The main advantage of the scheme is that not only two-ion maximally entangled pairs…
We provide several applications of a previously introduced isomorphism between physical operations acting on two systems and entangled states [1]. We show: (i) how to implement (weakly) non-local two qubit unitary operations with a small…
A quantum computing system is typically represented by a set of non-interacting (local) two-state systems - qubits. Many physical systems can naturally have more accessible states, both local and non-local. We show that the resulting…