No Arabic abstract
We investigate entanglement purification protocols based on hashing, where a large number of noisy entangled pairs is jointly processed to obtain a reduced number of perfect, noiseless copies. While hashing and breeding protocols are the only purification protocols that asymptotically obtain a nonzero yield, they are not applicable in a realistic scenario if local gates and measurements are imperfect. We show that such problems can be overcome by a compact measurement-based implementation, yielding entanglement purification schemes with nonzero yield that are applicable also in noisy scenarios, with tolerable noise per particle of several percent. We also generalize these findings to multiparty purification protocols for arbitrary graph states.
We investigate measurement-based entanglement purification protocols (EPP) in the presence of local noise and imperfections. We derive a universal, protocol-independent threshold for the required quality of the local resource states, where we show that local noise per particle of up to 24% is tolerable. This corresponds to an increase of the noise threshold by almost an order of magnitude, based on the joint measurement-based implementation of sequential rounds of few-particle EPP. We generalize our results to multipartite EPP, where we encounter similarly high error thresholds.
Generating entanglement between more parties is one of the central tasks and challenges in the backdrop of building quantum technologies. Here we propose a measurement-based protocol for producing multipartite entangled states which can be later fed into some network for realizing suitable quantum protocols. We consider weak entangling measurement on two parties as the basic unit of operation to create entanglement between more parties starting from an entangled state with a lesser number of parties and auxiliary systems in the form of a single-qubit or entangled state itself. We call the introduced expansion procedure, multipartite entanglement inflation. In the context of inflating bipartite entanglement to more number of parties, surprisingly, maximally entangled states as inputs turn out to be worse than that of the non-maximally entangled states, Haar uniformly generated pure states having a moderate amount of entanglement and the Werner state with a certain threshold noise. We also report that the average multipartite entanglement created from the initial Greenberger Horne Zeilinger- and the W- class states are almost same. Interestingly, we also observe that for Haar uniformly generated pure states, unentangled auxiliary systems are sometimes more advantageous than the protocol with multiple copies of the initial entangled states.
Measures of entanglement can be employed for the analysis of numerous quantum information protocols. Due to computational convenience, logarithmic negativity is often the choice in the case of continuous variable systems. In this work, we analyse a continuous variable measurement-based entanglement distillation experiment using a collection of entanglement measures. This includes: logarithmic negativity, entanglement of formation, distillable entanglement, relative entropy of entanglement, and squashed entanglement. By considering the distilled entanglement as a function of the success probability of the distillation protocol, we show that the logarithmic negativity surpasses the bound on deterministic entanglement distribution at a relatively large probability of success. This is in contrast to the other measures which would only be able to do so at much lower probabilities, hence demonstrating that logarithmic negativity alone is inadequate for assessing the performance of the distillation protocol. In addition to this result, we also observed an increase in the distillable entanglement by making use of upper and lower bounds to estimate this quantity. We thus demonstrate the utility of these theoretical tools in an experimental setting.
Microwave photons have become very important qubits in quantum communication as the first quantum satellite has been launched successfully. Therefore, it is a necessary and meaningful task for ensuring the high security and efficiency of microwave-based quantum communication in practice. Here, we present an original polarization entanglement purification protocol for nonlocal microwave photons based on the cross-Kerr effect in circuit quantum electrodynamics (QED). Our protocol can solve the problem that the purity of maximally entangled states used for constructing quantum channels will decrease due to decoherence from environment noise. This task is accomplished by means of the polarization parity-check quantum nondemolition (QND) detector, the bit-flipping operation, and the linear microwave elements. The QND detector is composed of several cross-Kerr effect systems which can be realized by coupling two superconducting transmission line resonators to a superconducting molecule with the N-type level structure. We give the applicable experimental parameters of QND measurement system in circuit QED and analyze the fidelities. Our protocol has good applications in long-distance quantum communication assisted by microwave photons in the future, such as satellite quantum communication.
We present an approach to purification and entanglement routing on complex quantum network architectures, that is, how a quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We explore how network parameters influence the performance of path-finding algorithms necessary for optimizing routing and, in particular, we explore the interplay between the bandwidth of a quantum channels and the choice of purification protocol. Finally, we demonstrate multi-path routing on various network topologies with resource constraints, in an effort to inform future design choices for quantum network configurations. Our work optimizes both the choice of path over the quantum network and the choice of purification schemes used between nodes. We consider not only pair-production rate, but optimize over the fidelity of the delivered entangled state. We introduce effective heuristics enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network, with performance comparable to that of a computationally-expensive brute-force path search.