We study sequences (both cyclic and randomized) of idempotent completely positive trace-preserving quantum maps, and show how they asymptotically converge to the intersection of their fixed point sets via alternating projection methods, highlighting the robustness features of the protocol against randomization. The general results are then specialized to stabilizing entangled states in finite-dimensional multipartite quantum systems subject to locality constraints, a problem of key interest for quantum information applications.
We study sequences (both cyclic and randomized) of idempotent completely positive trace-preserving quantum maps, and show how they asymptotically converge to the intersection of their fixed point sets via alternating projection methods, highlighting the robustness features of the protocol against randomization. The general results are then specialized to stabilizing entangled states in finite-dimensional multipartite quantum systems subject to locality constraints, a problem of key interest for quantum information applications.
Open quantum systems evolving according to discrete-time dynamics are capable, unlike continuous-time counterparts, to converge to a stable equilibrium in finite time with zero error. We consider dissipative quantum circuits consisting of sequences of quantum channels subject to specified quasi-locality constraints, and determine conditions under which stabilization of a pure multipartite entangled state of interest may be exactly achieved in finite time. Special emphasis is devoted to characterizing scenarios where finite-time stabilization may be achieved robustly with respect to the order of the applied quantum maps, as suitable for unsupervised control architectures. We show that if a decomposition of the physical Hilbert space into virtual subsystems is found, which is compatible with the locality constraint and relative to which the target state factorizes, then robust stabilization may be achieved by independently cooling each component. We further show that if the same condition holds for a scalable class of pure states, a continuous-time quasi-local Markov semigroup ensuring rapid mixing can be obtained. Somewhat surprisingly, we find that the commutativity of the canonical parent Hamiltonian one may associate to the target state does not directly relate to its finite-time stabilizability properties, although in all cases where we can guarantee robust stabilization, a (possibly noncanonical) commuting parent Hamiltonian may be found. Aside from graph states, quantum states amenable to finite-time robust stabilization include a class of universal resource states displaying two-dimensional symmetry-protected topological order, along with tensor network states obtained by generalizing a construction due to Bravyi and Vyalyi [Quantum Inf. Comput. 5, 187 (2005)]. Extensions to representative classes of mixed graph-product and thermal states are also discussed.
We consider the problem of constructing quantum operations or channels, if they exist, that transform a given set of quantum states {ρ1,…,ρk} to another such set {ρ^1,…,ρ^k}. In other words, we must find a {\em completely positive linear map}, if it exists, that maps a given set of density matrices to another given set of density matrices. This problem, in turn, is an instance of a positive semi-definite feasibility problem, but with highly structured constraints. The nature of the constraints makes projection based algorithms very appealing when the number of variables is huge and standard interior point-methods for semi-definite programming are not applicable. We provide emperical evidence to this effect. We moreover present heuristics for finding both high rank and low rank solutions. Our experiments are based on the \emph{method of alternating projections} and the \emph{Douglas-Rachford} reflection method.
The randomization of quantum states in Quantum Information Theory is an important issue and has many applications on information processing. Such a method for randomizing quantum states is given by a completely positive and trace-preserving map known as an epsilon-randomizing map or a random unitary channel.\nIn this thesis, we represent a general formula for the\nepsilon-randomizing maps with respect to the p-norm of\nd dimensional quantum states and introduce some applications. Recently, the epsilon-randomizing channel together with its complementary channel gives a key technique for the proof of the additivity conjecture, that is, the additivity violation for the classical\ncapacity of quantum channel, which is the motivation of our work.\n\nThere are plenty of applications of the epsilon-randomizing channels in the view of reducing communication resources as well as the approximate encryption and decryption of quantum states. We explicitly investigate several applications such as\napproximate quantum state sharing, approximate state merging, and quantum sequential transmission protocol.
The set of Entanglement Saving (ES) quantum channels is introduced and characterized. These are completely positive, trace preserving transformations which when acting locally on a bipartite quantum system initially prepared into a maximally entangled configuration, preserve its entanglement even when applied an arbitrary number of times. In other words, a quantum channel ψ is said to be ES if its powers ψn are not entanglement-breaking for all integers n. We also characterize the properties of the Asymptotic Entanglement Saving (AES) maps. These form a proper subset of the ES channels that is constituted by those maps that not only preserve entanglement for all finite n but which also sustain an explicitly not null level of entanglement in the asymptotic limit n → ∞. Structure theorems are provided for ES and for AES maps which yield an almost complete characterization of the former and a full characterization of the latter.
We prove a generalized quantum Stein lemma for parallel discrimination of an arbitrary finite-dimensional channel against families of alternative channels. The alternatives are compact and convex, closed under tensor products, and contain a faithful replacer. At every fixed type-I error tolerance, the optimal type-II error exponent equals the regularized Umegaki channel relative entropy minimized over the alternatives, and both defining limits exist. Inputs may be entangled across channel uses and with a reference system. The main technical result constructs exactly trace-preserving approximations with exponentially small diamond error, dominated in completely positive order by free channels at every rate above the common exponent. The proof combines uniform auxiliary map approximation, iterative reduction of the domination rate, and tensor amplification. It yields asymptotic equipartition with trace-preserving smoothing at every subexponentially vanishing error, an exponential strong converse, and stability under vanishing diamond-norm perturbations. Under additional permutation invariance and closure under insertion of a fixed faithful input state and discarding of its output, we also prove an explicit finite-block completion bound. This quantitative construction uses weighted discarding, local operator corrections, and comparison with auxiliary extensions. Applications include state-preserving, coherence-restricted, covariant, entanglement-breaking, and positive-partial-transpose channels. For isometric targets against entanglement-breaking or positive-partial-transpose alternatives, we obtain exact finite-block testing and smoothing formulas.
The infinite projected entangled pair states (iPEPS) algorithm [J. Jordan et al., Phys. Rev. Lett. 101, 250602 (2008)] has become a useful tool in the calculation of ground-state properties of two-dimensional quantum lattice systems in the thermodynamic limit. Despite its many successful implementations, the method has some limitations in its present formulation which hinder its application to some highly entangled systems. The purpose of this paper is to unravel some of these issues, in turn enhancing the stability and efficiency of iPEPS methods. For this, we first introduce the fast full update scheme, where effective environment and iPEPS tensors are both simultaneously updated (or evolved) throughout time. As we shall show, this implies two crucial advantages: (i) dramatic computational savings and (ii) improved overall stability. In addition, we extend the application of the local gauge fixing, successfully implemented for finite-size PEPS [M. Lubasch et al., Phys. Rev. B 90, 064425 (2014)], to the iPEPS algorithm. We see that the gauge fixing not only further improves the stability of the method but also accelerates the convergence of the alternating least-squares sweeping in the (either ``full'' or ``fast full'') tensor update scheme. The improvement in terms of computational cost and stability of the resulting ``improved'' iPEPS algorithm is benchmarked by studying the ground-state properties of the quantum Heisenberg and transverse-field Ising models on an infinite square lattice.