We exhibit a general procedure to purify any given ensemble by identifying an appropriate interaction between the physical system S of the ensemble and the reference system K. We show that the interaction can be chosen in such a way to lead to a spatial separation of the pair S-K. As a consequence, one can use it to prepare at a distance different equivalent ensembles. The argument associates a physically precise procedure to the purely formal and fictitious process usually considered in the literature. We conclude with an illuminating example taken from quantum computational theory.
We exhibit a general procedure to purify any given ensemble by identifying an appropriate interaction between the physical system S of the ensemble and the reference system K. We show that the interaction can be chosen in such a way to lead to a spatial separation of the pair S-K. As a consequence, one can use it to prepare at a distance different equivalent ensembles. The argument associates a physically precise procedure to the purely formal and fictitious process usually considered in the literature. We conclude with an illuminating example taken from quantum computational theory.
We present a novel procedure to purify quantum states, i.e., purification through Zeno-like measurements. By simply repeating one and the same measurement on a quantum system, one can purify another system in interaction with the former. The conditions for the (efficient) purification are specified on a rather general setting, and the framework of the method possesses wide applicability. It is explicitly demonstrated on a specific setup that the purification becomes very efficient by tuning relevant parameters.
The future of quantum repeater networking will require interoperability between various error-correcting codes. A few specific code conversions and even a generalized method are known, however, no detailed analysis of these techniques in the context of quantum networking has been performed. In this paper we analyze a generalized procedure to create Bell pairs encoded heterogeneously between two separate codes used often in error-corrected quantum repeater network designs. We begin with a physical Bell pair and then encode each qubit in a different error-correcting code, using entanglement purification to increase the fidelity. We investigate three separate protocols for preparing the purified encoded Bell pair. We calculate the error probability of those schemes between the Steane [[7,1,3]] code, a distance-3 surface code, and single physical qubits by Monte Carlo simulation under a standard Pauli error model and estimate the resource efficiency of the procedures. A local gate error rate of ${10}^{\ensuremath{-}3}$ allows us to create high-fidelity logical Bell pairs between any of our chosen codes. We find that a postselected model, where any detected parity flips in code stabilizers result in a restart of the protocol, performs the best.
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 realization of every physical process, that is, to the fact that every physical process can be regarded as arising from a reversible interaction of the system with an environment, which is eventually discarded. From the purification principle we also construct an isomorphism between transformations and bipartite states that possesses all structural properties of the Choi-Jamio\l{}kowski isomorphism in quantum theory. Such an isomorphism allows one to prove most of the basic features of quantum theory, like, e.g., existence of pure bipartite states giving perfect correlations in independent experiments, no information without disturbance, no joint discrimination of all pure states, no cloning, teleportation, no programming, no bit commitment, complementarity between correctable channels and deletion channels, characterization of entanglement-breaking channels as measure-and-prepare channels, and others, without resorting to the mathematical framework of Hilbert spaces.
The problem of Hamiltonian purification introduced by Burgarth et al. [Nat. Commun. 5, 5173 (2014)] is formalized and discussed. Specifically, given a set of non-commuting Hamiltonians {h1, …, hm} operating on a d-dimensional quantum system ℋd, the problem consists in identifying a set of commuting Hamiltonians {H1, …, Hm} operating on a larger dE-dimensional system ℋdE which embeds ℋd as a proper subspace, such that hj = PHjP with P being the projection which allows one to recover ℋd from ℋdE. The notions of spanning-set purification and generator purification of an algebra are also introduced and optimal solutions for 𝔲(d) are provided.
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 realization of every physical process, namely that every physical process can be regarded as arising from a reversible interaction of the system with an environment, which is eventually discarded. From the purification principle we also construct an isomorphism between transformations and bipartite states that possesses all structural properties of the Choi-Jamiolkowski isomorphism in quantum mechanics. Such an isomorphism allows one to prove most of the basic features of quantum mechanics, like e.g. existence of pure bipartite states giving perfect correlations in independent experiments, no information without disturbance, no joint discrimination of all pure states, no cloning, teleportation, no programming, no bit commitment, complementarity between correctable channels and deletion channels, characterization of entanglement-breaking channels as measure-and-prepare channels, and others, without resorting to the mathematical framework of Hilbert spaces.