Symmetry-protected dissipative preparation of matrix product states
Leo Zhou, Soonwon Choi, Mikhail D. Lukin

TL;DR
This paper introduces a symmetry-protected dissipative protocol for efficiently preparing matrix product states with topological order, robust against certain errors, and scalable with system size.
Contribution
It presents a novel dissipative method leveraging symmetry for preparing complex quantum states, with improved scalability and a concrete experimental scheme.
Findings
Preparation time scales polynomially with system size
Parallel preparation reduces scaling to logarithmic squared
Protocol is robust against symmetry-respecting errors
Abstract
We propose and analyze a method for efficient dissipative preparation of matrix product states that exploits their symmetry properties. Specifically, we construct an explicit protocol that makes use of driven-dissipative dynamics to prepare a many-body quantum state that features symmetry-protected topological order and non-trivial edge excitations. The preparation protocol is protected from errors that respect the symmetry, allowing for robust experimental implementation without fine-tuned control. Numerical simulations show that the preparation time scales polynomially in system size . Furthermore, we demonstrate that this scaling can be improved to by using parallel preparation of individual segments and fusing them via quantum feedback. A concrete scheme using excitation of trapped neutral atoms into Rydberg states via electromagnetically induced…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
††thanks: These authors contributed equally to this work.††thanks: These authors contributed equally to this work.
Symmetry-protected dissipative preparation of matrix product states
Leo Zhou
Department of Physics, Harvard University, Cambridge, Massachusetts 02138, USA
Soonwon Choi
Department of Physics, Harvard University, Cambridge, Massachusetts 02138, USA
Mikhail D. Lukin
Department of Physics, Harvard University, Cambridge, Massachusetts 02138, USA
(January 20, 2023)
Abstract
We propose and analyze a method for efficient dissipative preparation of matrix product states that exploits their symmetry properties. Specifically, we construct an explicit protocol that makes use of driven-dissipative dynamics to prepare a many-body quantum state that features symmetry-protected topological order and non-trivial edge excitations. The preparation protocol is protected from errors that respect the symmetry, allowing for robust experimental implementation without fine-tuned control. Numerical simulations show that the preparation time scales polynomially in system size . Furthermore, we demonstrate that this scaling can be improved to by using parallel preparation of individual segments and fusing them via quantum feedback. A concrete scheme using excitation of trapped neutral atoms into Rydberg states via electromagnetically induced transparency is proposed, and generalizations to a broader class of matrix product states are discussed.
I Introduction
Entangled many-body states play a central role in understanding strongly correlated quantum matter and constitute the key resource for quantum information science. Matrix product states (MPSs) Perez-Garcia et al. (2007) form an important class of many-body entangled states that can describe a variety of one-dimensional quantum systems. Notably, MPSs include states featuring symmetry-protected topological (SPT) order Schuch et al. (2011); Gu and Wen (2009); Chen et al. (2011); Senthil (2015), corresponding to exotic quantum phases beyond the standard Landau paradigm of symmetry breaking. Such states can be prepared either through a sequence of unitary quantum gate operations, or by first engineering the parent Hamiltonian and subsequently preparing its ground state via adiabatic evolution or cooling Bohnet et al. (2016); Cohen et al. (2015); van Bijnen and Pohl (2015); Mazurenko et al. (2017); Cai et al. (2013); Yan et al. (2013); Barends et al. (2016). However, generating entanglement among many particles using these approaches is challenging, as it typically requires high-fidelity control of individual interactions while maintaining low entropy for intrinsically out-of-equilibrium systems. In particular, unavoidable coupling to environment limits the lifetime of these states and hinders their potential applications.
In this paper, we propose and analyze an alternative method to efficiently prepare an MPS by engineering couplings between a system and its environment such that the desired quantum state is obtained as the unique steady state of time evolution. Such approaches to prepare entangled states have been described previously Kraus et al. (2008); Verstraete et al. (2009); Ticozzi and Viola (2012); Cho et al. (2011); Albert and Jiang (2014); Iemini et al. (2016); Barreiro et al. (2010); Reiter et al. (2013); Rao and Mølmer (2014); Roghani and Weimer (2018). It has also been shown that under certain conditions, the dissipative method outperforms corresponding unitary schemes Kastoryano et al. (2011). In practice, however, the implementation of these suggested schemes in many-body systems is challenging as it requires engineering of complex interactions and decay channels with environment. Here, we show how symmetries can be used to design a simple, translation-invariant dissipative process that only requires a single decay channel and global manipulations to create a desired MPS. Remarkably, similar to symmetry-protected equilibrium phases, this dissipative dynamics is protected from imperfections that respect the symmetry, allowing for robust experimental realizations in large systems with current technologies. The symmetry protection implies that our method does not require high fidelity in controls such as global spin-rotations or interaction strength, which are otherwise essential in conventional unitary schemes.
The paper is organized as follows. In Sec. II, we describe our method for a well-known example of an MPS that exhibits SPT order. We elaborate on how to construct a driven-dissipative dynamics from given symmetry properties of the MPS and rigorously show that the engineered dynamics deterministically prepares the desired states. Using numerical simulations, we find the state-preparation time scales polynomially with system size . In Sec. III, we show that this scaling of state-preparation time can be further improved to by first preparing multiple chains in parallel and then connecting them via repeated measurements with feedback. This corresponds to an exponential improvement over previously known scaling for generic MPSs Verstraete et al. (2009). We also provide a detailed analysis of the effect of imperfections in quantum feedback. We emphasize that our example scheme utilizes the most natural, generic types of environmental couplings as a resource, and hence it can be directly implemented in cold atom systems with existing technologies. In Sec. IV, we propose a concrete scheme involving excitation of trapped neutral atoms Endres et al. (2016); Barredo et al. (2016); Bernien et al. (2017); Labuhn et al. (2016); Lester et al. (2015) into Rydberg states via electromagnetically induced transparency (EIT) Petrosyan et al. (2011), in which spontaneous emissions of photons from atomic excited states are harnessed as resources. In Sec. V, we generalize our protocol to a broader class of MPSs, including the ground states of all one-dimensional SPT phases, and derive a lower bound on the number of required decay channels that may be saturated by an explicit construction. We discuss our results and outlook in Sec. VI.
II Dissipative Preparation of AKLT states
II.1 Ground states of AKLT Hamiltonian
We illustrate our scheme by starting with an example to deterministically prepare a chain of spin-1 particles into the ground states of a gapped, frustration-free Hamiltonian
[TABLE]
where is the spin-1 vector operator acting on a particle at site . First studied by Affleck, Kennedy, Lieb, and Tasaki (AKLT), the ground states of are paradigmatic examples of MPSs and model states for the Haldane phase Affleck et al. (1987); Haldane (1983); Pollmann et al. (2010). While under periodic boundary condition, has a unique ground state; under open boundary condition, the ground states are fourfold degenerate due to two fractionalized degrees of freedom on the edges. These constitute a signature of symmetry-protected topological order, which can be experimentally verified by measuring a non-local string order parameter den Nijs and Rommelse (1989); Pérez-García et al. (2008).
The ground states of AKLT Hamiltonian have exact MPS representations Perez-Garcia et al. (2007). For a system of spin-1 particles, the unnormalized AKLT ground states can be written as
[TABLE]
where runs over three possible spin projections along the -axis for a particle at site . The quantum amplitude for each many-body basis state is obtained from the products of matrices , and the boundary conditions for the matrix products are specified by a row (column) vector () of dimension . Specifically, for AKLT ground states, can be concisely written using ( = 2) Pauli matrices , , , and :
[TABLE]
The choices of vectors distinguish the four degenerate ground states with different fractionalized edge states under open boundary conditions 111We note that our convention here for labeling the edge states is different from the convention where the AKLT state is understood as projecting pairs of virtual spin-1/2 particles in singlet bonds back into the spin-1 particles, up to a basis change by .. Under periodic boundary condition, the unique ground state is .
We note a few properties of these AKLT states. With the notation , one can conveniently rewrite the quantum state of an -particle system as a linear superposition of composite systems, each with and particles, i.e. . Moreover, the overlap between two AKLT states with different edge states can be analytically evaluated; using the transfer matrix , we obtain exponentially small overlaps between distinct states with a normalization factor :
[TABLE]
where . Finally, the AKLT ground state exhibits topological order that is protected by the symmetry groups (dihedral group corresponding to permutation of spin axes), (time-reversal symmetry), and (bond-inversion symmetry). While the presence of any of these symmetries can protect the non-trivial order reflected in the double degeneracy in the entanglement spectrum, the symmetry is necessary and sufficient to protect the string order parameter Pollmann et al. (2010). In addition to , the parent Hamiltonian respects a larger symmetry group of , corresponding to global rotation of spins.
II.2 Constructing driven-dissipative dynamics
Our key idea is to use symmetry of the parent Hamiltonian for preparation of an exact AKLT ground state. By converting energy penalties imposed by into dissipative penalties in the form of decay channels, we can engineer a process that effectively cools to the ground states. More specifically, we start with a dissipative dynamics that eliminates one type of excitation in . Then, all other types of excitations can be eliminated using global spin-rotations in . Since spin-rotations are symmetries of , their implementations are robust against imperfections in control parameters such as durations, phases, or strengths of electromagnetic driving.
We consider a Markovian driven-dissipative dynamics described by a quantum master equation:
[TABLE]
where is the density operator of a system, is a Hamiltonian governing coherent dynamics, and characterizes incoherent dynamics by jump operators (i.e., decay channel) at rate . We can interpret the dynamics of as the system evolving with a non-Hermitian Hamiltonian = , while stochastically undergoing quantum jumps at rates for each jump operator Gardiner and Zoller (2004).
In order to construct a simplest possible that prepares an AKLT ground state, we exploit the symmetry that conserves total angular momentum. In particular, each term in can be written as , where is the projection operator onto the subspace of total angular momentum = 2 for the pair of particles . Hence, a state minimizes the energy if it has no population in the = 2 manifold, i.e. = [math] for every nearest-neighboring pair. Under open boundary condition, there are four such states , labelled by two spin-1/2 edge degrees of freedom . Under periodic boundary condition, only a unique state satisfies the constraints. Below, we use to denote the ground state(s) when boundary conditions are not specified.
To prepare , we use jump operators to depopulate = 2 manifold of every neighboring pair. For example, we can set = 0 and use five types of jump operators, = , where = = : = is an orthonormal basis spanning the manifold for the pair of spins , and is any other quantum state with nonzero population in = manifolds ( 1). With these jump operators, quantum jumps occur at rate = = , which vanishes only for the ground state . This implies that is a steady state of , and any other quantum state will undergo a series of quantum jumps.
Using symmetry, this construction can be effectively realized with only one type of jump operator via global coherent manipulations . More specifically, let us consider a dynamics with only one jump operator, = == = , written in the basis . After time evolution over duration , we apply a fast global pulse , rotating the entire spin ensemble by an angle about the -axis. In a rotating frame, this operation implements the jump operator . Repeated multiple times, we obtain five distinct jump operators for after the -th (modulo 5) pulses. For a sufficiently short , the effective Liouvillian of the five-pulse cycle can be well approximated using leading-order Magnus expansion by
[TABLE]
Note that the purpose of global rotations is to use a single jump operator for depopulating different states; different choices of angles and axes are equally effective as long as states rotated from span the entire = 2 manifold. We may also employ a time-independent Hamiltonian = to continuously rotate the ensemble, leading to an effective Liouvillian
[TABLE]
In both cases, the corresponding quantum jump rates vanish if and only if the system is in .
II.3 Proving uniqueness of steady states
While our construction of and ensures that is a steady state, one can imagine an undesired mixed steady state that forms in dynamical equilibrium from the combination of coherent evolution and incoherent quantum jumps (Fig. 1). Such mixed steady states may arise only if there exists a subspace orthogonal to and closed under jump operators, Kraus et al. (2008). Physically, this means that states in cannot reach even with arbitrarily many applications of jump operators , allowing an equilibrium to form by their mixtures. In our scheme, we prove the following lemma that guarantees that the desired state is the unique steady state:
Lemma**.**
For any finite system with size under open boundary condition, all states can reach with some application of jump operators in or , implying is the unique steady state.
We now sketch the proof of this Lemma for open boundary condition, where the four states are unique steady states; more details on the proof can be found in Appendix C. The proof uses induction on system size . Note that under an open boundary condition, the four states are the desired steady states. Let us define as the subspace of AKLT ground states of spins. For = and 3, the uniqueness of steady states can be checked by exact diagonalization. Our induction hypothesis is that any -spin input state can reach with some applications of jump operators, via some polynomial function (which may depend on the input state). For the sake of contradiction, let us assume that a state cannot reach with any sequence of jump operators in . (The same argument holds for .) We will then construct a sequence of jump operators, involving some on the first spins followed by some acting on spin and , so that reaches , leading to a contradiction.
To begin, we know that by our induction hypothesis, there exists so that has nonzero population in . Since the AKLT Hamiltonian is frustration-free, must also have nonzero population in , i.e. the AKLT ground states on the first spins. We then do a general decomposition of , where
[TABLE]
Here runs through the 5 states in the manifold on the last two spins. The remaining parts of the wavefunction are
[TABLE]
where runs through all the excited eigenstates of the on the first spins, and runs through all 9 possible 2-spin states. We now consider two cases:
Case (i): Suppose . Then . From our inductive hypothesis, must have nonzero population in and ; this can only come from the part, and thus there must be nonzero coefficients . On the other hand, since we have assumed that cannot reach , we must have , which is only possible if has the state of spins at and -th sites in the = manifold. However, that would then imply that has zero population in , contradicting our inductive hypothesis.
Case (ii): Now suppose for some . Note that for any jump operator acting on spins and , we have for , since and . Then our assumption that cannot reach gives the following set of linear equations for :
[TABLE]
Since and have explicit MPS formulas, one can analytically compute these expressions and find that only the trivial solution = [math] are allowed for . This yields a contradiction and implies that all states can reach at least one of the states in with some application of jump operators.
II.4 Numerical simulations and scaling
We numerically study the efficiency of our protocol via stochastic wavefunction method for systems of up to particles. We use both exact diagonalization (for ) and time-evolving block decimation (TEBD) algorithm Vidal (2003); *Vidal2 in MPS representations (for ); more details are discussed in Appendix D. We initialize the system in a random product state (representing a maximally mixed state), and evolve under with open boundary condition. We then monitor the energy density with respect to , as well as the fidelity of state preparation , where is the projector onto the ground states. The results in Figs. 2(a) and (b) demonstrate that both observables exponentially converge to their corresponding values for AKLT states in all system sizes. We extract the state-preparation time by first fitting to an exponential in the long-time regime and extrapolating . We find that generally increases with system size . Plotted as a function of [Fig. 2(c)], we find a polynomial scaling . This scaling is consistent with the more complicated protocol in Ref. Verstraete et al. (2009) that requires up to time, up to system sizes simulated in this work.
III Improving Scaling via Parallelization and Quantum Feedback
While the time our protocol needs to prepare AKLT states is already shown to have an efficient polynomial scaling from our numerical simulations, we now provide a method to exponentially improve this scaling to . Similar to approaches used in quantum repeaters Briegel et al. (1998), this exponential speedup is possible by preparing multiple chains in parallel, which are subsequently connected into a single long chain [Fig. 3(a)]. The key ingredient is the ability to efficiently connect or fuse two AKLT chains into a single entangled state [Fig. 3(b)], which we now describe.
III.1 Connecting two AKLT chains
Suppose we have independently prepared two chains of spins in AKLT states. As they are initially unentangled, their state can be written as , where characterizes the edge states at the interface, and is some normalization constant. The edge states represented by the indices and are unimportant for the connection. To connect the two chains into one, we can turn on the jump operators acting on spins and at the interface, and evolve for some time . Then, we monitor quantum jump events to determine if we have succeeded in creating an AKLT state with doubled length ( is some normalization constant).
A successful connection is heralded by the absence of quantum jumps, in which case evolution under the non-Hermitian Hamiltonian guides the system into an AKLT state of the combined chain. For sufficiently long , the success probability is given by the overlap between initial and desired states (see Appx. B). This can be computed using Eq. (II.1) to be
[TABLE]
Note that if the edge states and are random vectors in , we have on average . When the edge states are aligned, i.e. , we obtain the maximum success probability of . The resultant state has an exponentially small error .
The failure of the connection is signaled by detection of a quantum jump , after which the state of the system changes according to . In this case, one can discard the pair of spins and then attempt the connection procedure again with two chains of length . However, it turns out that quantum jumps affect the success probability of subsequent connection attempts, which in fact vanishes for this protocol without additional intervention, a phenomenon that we will explain in the following paragraph. Nevertheless, we can restore the success probability to by applying a global spin rotations = to one of the chains. This quantum feedback makes the procedure very efficient, since multiple repeated failures are exponentially unlikely and only one success is sufficient to fuse two chains. The number of attempts necessary follows the geometric distribution, and on average we need attempts with the loss of particles per connection. By performing these connection procedures in parallel, we can quickly prepare an AKLT state of spins in time, as we show in Sec. III.2.
We now explain why a single failed connection attempt will cause subsequent attempts to fail, unless appropriate quantum feedback is applied. It turns out that this problem occurs whenever the matrix product state we want to prepare respects bond-inversion symmetry, but here we first focus on the example of AKLT states which has an intuitive explanation (see Sec. V.2 for the general case). Note that we can interpret the dynamics under as a continuous measurement of whether the pair of spins has total angular momentum , where . To be more specific, consider four spin-1 particles , and imagine that we are performing a connection between spins 2 and 3 by continuously measuring . Suppose we decompose each spin-1 into two virtual spin- particles: . It is known Affleck et al. (1987) that an AKLT state can be constructed by starting with singlet bonds of virtual spin- particles where for all , and then projecting back into the triplet subspace of the original pairs of virtual spin- particles where . The detection of a quantum jump in a failed connection attempt implies that , which is only possible if . Due to the singlet bond conditions, this automatically implies that . Subsequently, when we retry the connection with spins 1 and 4 (after discarding 2 and 3), the two virtual spin- particles at the interface are in the state , which has no overlap with the desired singlet bond state . Hence the overlap with the AKLT state is zero, and the connection is certain to fail. Now, applying = to the first chain flips so that the resultant state is . This has an overlap of 1/2 with the singlet state, restoring our success probability to roughly 1/2.
III.2 Scaling of preparation time of the parallelized protocol
We are now ready to describe and analyze the full parallelized protocol to prepare AKLT states on large system sizes in time. To prepare a length- chain, we first prepare AKLT chains of length , and then apply the above connection procedure in parallel for adjacent chains, as illustrated in Fig. 3(a). Since on average we lose particles per connection, we should choose , and prepare such chains. We can imagine attempting the connection simultaneously for all junctions between chains, and we will typically have some successes and some failures. By noting the locations of the failures and applying the quantum feedback to every other segment, we can then re-attempt connections on the junctions that have failed, which will then succeed with as shown above. This process is repeated for multiple rounds until all junctions become connected, and the system becomes one connected chain. The successful connection of each junction occurs independently and probabilistically; hence their order may be arbitrary. The probability of completing all connections after rounds is
[TABLE]
To achieve a completion probability of , we need = rounds. Hence, the time required to successfully complete all connection with constant probability and obtain a length- AKLT chain is
[TABLE]
where is the preparation time of the length- chains, is the time for each connection attempt, and is the time required for feedback after each failed attempt. Recall that each successful connection induces an error of in the quantum state. Thus, a total of connections yield a final error of , which means we should choose to achieve a final error of . Assuming arbitrarily fast classical communication and control, the quantum feedback of applying homogeneous spin-rotation to a subset of the chains can be done in a system-size independent time . Thus, the average time necessary to prepare an AKLT state of length with bounded error in this parallelized protocol is
[TABLE]
The required number of spins that we need initially is , indicating that an (i.e., constant factor) spatial overhead is sufficient.
While so far we have assumed that we can detect the occurrence of quantum jumps perfectly, this parallelized protocol remains very efficient even when the detection is imperfect. We describe two possible methods to address detection inefficiency. The first method is to use jump operators of the form for connection, which will cause an indefinite number of quantum jumps to occur once the first quantum jump occurs, enhancing the quantum jump signal. Alternatively, we can also slowly turn on additional jump operators near the interface if we do not detect any quantum jump initially; this serves to confirm that the two original chains have been successfully connected, as any failed connection attempt that evaded detection would cause more quantum jumps. In both cases, the scaling of our parallelized protocol is not significantly altered compared to the ideal case, and can be largely accounted for by modifying the effective success probability . We provide a more detailed analysis of these two methods in Appendix E.
IV Experimental realization
The key task in implementing our protocol is to engineer the nearest-neighbor jump operators. Such engineering has been previously demonstrated in systems of trapped ions Barreiro et al. (2010). Here, we provide an explicit method to realize our scheme in systems of trapped atoms Endres et al. (2016); Barredo et al. (2016); Bernien et al. (2017); Labuhn et al. (2016); Lester et al. (2015) based on the Rydberg-EIT mechanism Petrosyan et al. (2011). We consider a five-level system consisting of a metastable Rydberg state , a short-lived excited state , and three long-lived hyperfine ground states , and as shown in Fig. LABEL:fig:(a). Using lasers, we coherently couple the ground state to the excited state with a time-dependent Rabi frequency . The excited state is further coupled to the Rydberg state with Rabi frequency . Owing to large dipole moments, simultaneous excitations of two Rydberg states within distance are suppressed by an interaction energy shift that decays as Lukin et al. (2001).
In the absence of interactions, our coherent driving ensures that every atom supports three stable states , and for arbitrary choices of and . We use these three states to encode the spin-1 degree of freedom. When slowly increases starting from zero, = = adiabatically follows without populating any excited states. In the presence of strong interactions, however, population in the Rydberg state of one atom prevents another Rydberg excitation in its vicinity. Thus, as one gradually turns on , any neighboring atoms initially in necessarily populate the excited states, followed by their decay into one of the three ground states. When [math] , this dissipative dynamics produces effective jump operators of the form = with a total rate
[TABLE]
where , and is one of 9 different combinations of two-particle ground states (see Ref. Reiter and Sørensen (2012) and Appendix F). To engineer the full Liouvillian, we can apply microwave pulses to the three ground states and globally rotate the spin-1 particles by [Fig. 4(b)]. When dissipative interactions and global rotations are alternated, this protocol effectively realizes a dynamics similar to and deterministically prepares AKLT states. The experimental platform with a rearrangeable atom array in Refs. Endres et al. (2016); Barredo et al. (2016); Bernien et al. (2017); Labuhn et al. (2016); Lester et al. (2015) is particularly well-suited to parallelize the implementation and exponentially shorten preparation times for large systems.
In practice, unwanted dissipations or interactions can affect the fidelity of our protocol by perturbing the steady state of dissipative dynamics. There are two main imperfections in our proposed implementation: i) atomic states have finite dephasing time , and ii) long-range Rydberg interaction can lead to dissipative coupling with particles beyond nearest neighbors. For the latter, we find that pairs of particles separated by distance with interaction acquire decay rates . We study the effects of these imperfections by numerical simulations of long-range effective Hamiltonians and stochastic quantum jumps that now include dephasing operators for . We introduce an effective temperature defined by , where is the steady-state fidelity and = is the Gibbs ensemble with = Deutsch (1991); Eisert et al. (2015). When the steady state is near the gapped ground state, characterizes the quality of prepared state in the thermodynamic limit. The results in Fig. 4(c) show that the temperature decreases with increasing dephasing time and eventually saturates due to long-range interactions. While also depends on system size , we find that it stays below the gap of for all studied in the present work (up to ). We note that the effect of long-range interaction is mitigated in our parallelized protocol, where jump operators are turned on only for a few spin pairs well separated by the length of connected chains. Also, throughout the parallelized protocol, the effective temperature does not increase, since our connection procedure ensures that scales linearly in system sizes while the density of excited states grows at least as fast (see Appendix G).
V Generalization to MPS with symmetry
Our symmetry-based approach can be generalized to efficiently prepare a broader class of matrix product states. In general, any translation-invariant MPS of spins can be written as
[TABLE]
where runs over the physical spin basis for the -th particle, and indicate the “boundary conditions” in the virtual bond space. For the case of AKLT states, we have and . Under periodic boundary condition, the unique MPS is given by . We say that such an MPS respects an internal symmetry group if for every and some unitary representation we have
[TABLE]
Our protocol can be generalized to prepare any such translation-invariant MPS with internal symmetry, which is a class of states that includes ground states of all one-dimensional SPT phases Sanz et al. (2009); Schuch et al. (2011).
V.1 Generalized protocol with a minimal set of decay channels
We now show how to generalize our protocol to any translation-invariant MPS with internal symmetry . Specifically, we design a dissipative dynamics that deterministically prepares the ground state(s) of the MPS parent Hamiltonian. This protocol uses a set of global coherent manipulations corresponding to symmetry operations on the MPS, as well as a minimal number of decay channels acting on pairs of neighboring particles. We are able to derive a lower bound for based on irreducible representations of the symmetry group , and provide an explicit construction of a minimal set of jump operators saturating the bound. Given such a set , the uniqueness of steady states can be efficiently verified via the same inductive proof technique in Sec. II.3. For the purpose of preparing ground states of SPT phases, we note that the symmetry of a parent Hamiltonian of the MPS may be larger than the minimal symmetry that protects the topological order. For example, while in the case of AKLT states Pollmann et al. (2010).
We now describe our results on the minimum complexity on the decay channels (i.e. jump operators) necessary to prepare a general translation-invariant MPS with symmetry. Without loss of generality, we may assume that the desired states are ground states of a gapped, frustration-free parent Hamiltonian , where is a translation-invariant, nearest-neighbor projector that respects the internal symmetry Perez-Garcia et al. (2007); Sanz et al. (2009). Each term can be written in a block diagonal form, corresponding to different irreducible representations of . We refer to the two-particle subspace that projects onto as “bright manifold” , where is the internal dimension of each particle. The ground states are uniquely characterized by vanishing populations in for every neighboring pair of particles. In the example, corresponds to the = manifold of two neighboring spins. Similar to our protocol for AKLT states, we can depopulate by employing jump operators where . The number of jump operators can be reduced by utilizing and averaging over all symmetry rotations through , where is the global unitary rotation by a group element . In order to fully depopulate the bright manifold and nothing else, the set of jump operators must satisfy the necessary condition
[TABLE]
As we show below, the minimum number of distinct jump-operators will depends on the structure of the group representation of .
For simplicity of discussion, let us restrict the decay channels to the rank-1 form of . The minimum number of jump operators required can be calculated from the number of different irreducible representations (irrep) of the symmetry group within the bright manifold . In the case of AKLT states, consists of a single 5-dimensional irrep of the group . In more general cases, the representation of on may contain multiple copies of isomorphic (i.e., equivalent up to a basis change) irreps. The capability of global symmetry operations allows one decay channel to depopulate subspaces corresponding to one copy of each irrep in parallel. Hence, as we have shown earlier, one decay channel is sufficient for preparing the AKLT state. For the more general cases, however, it may be necessary to employ multiple decay channels when more than one copy of an irrep is present. Using Schur’s lemma Artin (2010), we prove that the minimum number of rank-1 decay channels is
[TABLE]
We can also construct decay channels that satisfy the necessary condition of Eq. (19) by choosing a set of that is supported in all irreps, with destructive interference between isomorphic irreps. The details of the proof and the construction are described in Appendix H.3.
Once we have such a minimal set of decay channels , it remains to ascertain the uniqueness of steady states. This can be efficiently verified using our inductive proof techniques, which show that the steady states are unique as long as there are only trivial solutions to a linear equation like (11). More specifically, to prove uniqueness under open boundary condition, one simply needs to compute a matrix whose matrix elements are
[TABLE]
where is the transfer matrix for the MPS, are indices for -dimensional virtual bond space, and enumerates the possible states in the bright manifold . Here, is related to the maximum dimension of the irreps of the symmetry group on tthe bright manifold . By verifying (through exact calculations or numerics) that the steady state is unique for some small system size , one can then prove uniqueness for all by showing that . We emphasize that these proofs can be done efficiently for any given and decay channels , since the calculations only involve matrices of constant dimensions, independent of system size .
Our Rydberg-EIT implementation proposal can be naturally adapted for these general cases. The Rydberg-EIT scheme allows us to engineer two-body jump operators of the form , where are single-spin states. Unlike the case of AKLT states, the preparation of a generic symmetric MPS may require more than one () rank-1 jump operator. The implementation of multiple decay channels can be achieved, for example, by introducing extra lasers that couple (additional) hyperfine ground states to the short-lived excited state(s). By adjusting the relative strength of laser driving to each hyperfine ground state, one can engineer different EIT-dark states that acquire a dissipative interaction. This allows us to generate a set of jump operators with independent . When particles are individually addressable, one can engineer a jump operator with a more complicated right-singular vector , i.e. for any . For example, if we can engineer a unitary where and , then applying stroboscopically each time before turning on dissipative interaction [see Fig. 4(b)] would allow engineering of .
V.2 Generalizing the parallelized protocol
We can also extend our strategy of parallelized connection and quantum feedback to the class of translation-invariant MPSs with internal symmetry. Recall that the idea is to prepare many segments of the desired MPS with open boundary conditions, and then connecting adjacent pairs of segments in parallel. The analysis is much simpler when the MPS is injective, which means that largest-magnitude eigenvalue of the transfer matrix is non-degenerate. When the desired MPS is injective, which is true for generic cases Perez-Garcia et al. (2007) (and also for AKLT states), we can show that the success probability of connection is typically at least . This system-size-independent success probability implies that the scaling of preparation time of the parallelized protocol is , which exponentially outperforms existing dissipative protocols that do not involve parallelization and feedback Verstraete et al. (2009). The case of non-injective MPSs is more subtle, since the associated parent Hamiltonian of the MPS has degenerate ground states. These states can be shown to be the only steady states of our protocol, but typically a mixture of them will be prepared. Nevertheless, if we place some (often reasonable) restrictions on the initial state, a pure non-injective MPS can be prepared, as we illustrate with the example of a Greenberger-Horne-Zeilinger (GHZ) state.
Injective case— We first analyze the protocol for the case of injective MPSs. Consider an arbitrary initial state of two adjacent length- chains of MPSs, which can be written as , where is some coefficient matrix that characterizes the edge states at the interface of the chains, and is a normalization constant. If the two chains are unentangled, then for some . By turning on the jump operators acting at the interface, we can cool this state into the desired final state , for some normalization constant . Since the MPS is assumed to be injective, the success probability of connection can be shown to be
[TABLE]
where is the second largest eigenvalue of (see Appendix H for more details). For random states , we have on average . The maximum success probability of is obtained when , i.e., when the two edge states are identical.
When our desired MPS exhibits bond-inversion symmetry , as the AKLT states do, we have the same issue of vanishing success probability after a quantum jump that also respects . To see this, consider what happens in the event of a quantum jump due to a jump operator of the form . The state after discarding the two particles at the interface is , where
[TABLE]
If respects bond-inversion symmetry, i.e. , where is the swap operator, then
[TABLE]
We find that this quantity is zero regardless of the initial , entangled or unentangled, due to our requirement that be orthogonal to the desired MPS . In fact, is related to the success probability of the next connection attempt, p^{\prime}=\big{|}\braket{\psi_{f}^{2m-2}}{\psi_{1}}\big{|}^{2}\propto|\operatorname{tr}(\tilde{C})|^{2}+\mathcal{O}(\epsilon_{2}^{m})=\mathcal{O}(\epsilon_{2}^{m}), which is exponentially small for a large system size .
Similar to the AKLT case, we can also try to restore the success probability by applying a global symmetry operation for some to one of the chains. In our AKLT protocol, there is a symmetry operation whose action on the virtual bond level yields \big{|}\operatorname{tr}(u_{g}^{\dagger}\tilde{C})\big{|}^{2}=\operatorname{tr}(\tilde{C}^{\dagger}\tilde{C}), allowing us to recover the maximum success probability of regardless of the initial state or which quantum jump occurred. While the existence of such an operation is not known for the general case, we can at least restore the success probability to for many injective MPSs by applying a randomly chosen symmetry operation. This is because injectivity is typically associated with the irreducibility of the representation on the virtual bond level Sanz et al. (2009), which allows us to show that . If we write in its singular value decomposition form, then
[TABLE]
If is irreducible, then by Schur’s lemma Artin (2010) we have
[TABLE]
Hence, this yields a subsequent success probability of . A sufficient condition for the irreducibility of is that be irreducible and spans the whole space of matrices (see Proposition 17 in Ref. Sanz et al. (2009)).
Non-injective case— For a non-injective MPS, the analysis is complicated by the presence of degenerate ground states of its parent Hamiltonian. Here we consider an illustrative example to prepare GHZ states: . These states have an MPS representation with given by the following matrices:
[TABLE]
In this representation, , and , where and are possible edge configurations. This MPS has an internal symmetry group of , which is represented by acting on the system. Its parent Hamiltonian is , whose ground states are doubly degenerate due to non-injectivity. The corresponding two-particle bright manifold is , where . The two states support two distinct irreducible representations of , which are the trivial and the sign representation, respectively. Hence, we can use just one jump operator of the form e.g. , with so that both irreps are supported (a necessary condition as shown in Appendix H.3). Then along with the global symmetry operation , we can depopulate the bright manifold and obtain as the subspace of steady states.
Now let us consider preparing in a parallelized protocol with connections and feedback. We note that unlike in the injective case, different choices of jump operator here can lead to qualitatively different outcomes. Specifically, we consider two choices of jump operators that may result in different degrees of entanglement of the final state. First, consider an example choice of jump operator (i.e. ). While this along with the symmetry operation produces a dissipative dynamics that has as the steady states, the parallelized protocol can only produce an unentangled final state of either or once any quantum jump occurs, regardless of states of the initial chains. Alternatively, we may choose the jump operator (i.e., ). In this case, suppose we start with on the initial chains of length , then we can produce a maximally entangled final state of even after quantum jumps, for some that we can determine from recording quantum jump history. In both cases, for an arbitrary (unentangled) initial state of two chains, the success probability of connecting them is on average for random . This system-size-independent success probability means that the parallelized protocol for this non-injective MPS also has an efficient scaling of for the preparation time.
VI Summary and Outlook
In this work, we have shown that using only one type of nearest-neighbor decay channel and global control, an AKLT state in a large system can be efficiently prepared as the provably unique steady state of the driven-dissipative dynamics. Since the symmetry group of AKLT states is continuous, the decay channels and pulses need not be fine-tuned, and the implementation is robust against imperfections in experimental parameters. The scaling of preparation time was numerically shown to be polynomial, and can be improved exponentially using parallelization and quantum feedback. This proposal is feasible for a wide range of controlled quantum systems, and in particular optimal for a rearrangeable array of trapped neutral atoms using a Rydberg-EIT scheme. In addition, we analyzed the generalization to other translation-invariant MPSs with symmetry, and derived a bound on the minimum number of necessary decay channels that may be saturated by a construction. We also showed that the parallelized protocol can work in the general case, and provided some sufficient conditions for success, such as the injectivity of the MPS and the irreducibility of the symmetry group representation on the virtual bond level.
Finally, we note that it may be possible to generalize our symmetry-based dissipative preparation scheme to higher dimensional many-body entangled states. Many such states are described by projected entangled pair states (PEPS), a natural generalization of MPSs for arbitrary lattices, which also allow construction of frustration-free parent Hamiltonians Perez-Garcia et al. (2008) to be converted into jump operators Verstraete et al. (2009); Kraus et al. (2008); Ticozzi and Viola (2012). However, our inductive proof of uniqueness of steady states does not extend straightforwardly, since exact computation of expectation values of a generic PEPS is intractable Schuch et al. (2007). Further investigations are thus necessary to extend our strategy to higher dimensions, which can support even more interesting, long-range entangled states with symmetry-enriched topological order Mesaros and Ran (2013).
Acknowledgements.
We thank H. Pichler and F. Reiter for useful discussion. We thank Haoyang Gao for bringing to our attention a technical problem in a previous version of the manuscript. This work was supported through NSF, CUA, Vannevar Bush Faculty Fellowship, AFOSR Muri, and Moore Foundation. L.Z. was supported by NSF Graduate Research Fellowship under Grant No. DGE1144152. S.C. was supported by Kwanjeong Educational Foundation.
Appendix A Effective Liouvillian
Our proposal for preparing AKLT states uses only one type of jump operator, e.g. . The dissipative dynamics due to this jump operator is , where enumerates the pair of neighboring sites . Our key idea is to use coherent global manipulations, corresponding to operations in the symmetry group, so as to effectively realize additional jump operators. This can be achieved either by periodically applying pulsed global spin rotations (symmetry operations), or by continuously rotating the spins.
In the first, multi-pulse sequence approach, we apply pulses , each separated by an interval of . Then in the rotating frame, we have the time-dependent Liouvillian:
[TABLE]
Suppose we choose for some integer , then this dynamics is periodic with period , since . In the limit of fast pulses , we can use the first-order Magnus expansion to derive a simpler, effective time-independent Liouvillian that approximate the dynamics:
[TABLE]
where .
Alternatively, we may employ a continuous wave approach by introducing a time-independent Hamiltonian . Then in the rotating frame, we have , and
[TABLE]
In this frame, the dynamics is periodic with period . Again, we compute the effective time-independent Liouvillian
[TABLE]
obtained by time-averaging (first-order Magnus expansion) as an approximation. The effective jump operator in the standard form of a Liouvillian can be obtained by diagonalizing the superoperator acting on the space of density operators. More explicitly, we diagonalize a Hermitian matrix , whose entries are given by
[TABLE]
We can read off , and . For our example choice of , we obtain independent jump operator after evaluating the integral and diagonalizing, each with rate , 3/16, 3/16, 1/8, 1/8, 1/16, 1/16, 1/64, and 1/64, respectively.
Appendix B Quantum evolution conditioned on no quantum jump
To understand how our quantum state evolves conditioned on detecting no quantum jumps, we use the stochastic wavefunction formalism for open system dynamics. Namely, we define an effective non-Hermitian Hamiltonian , where is the Hamiltonian of the system and are quantum jump operators. A system evolves under until it undergoes a quantum jump at a rate . In our protocol to prepare AKLT states, since we work in the rotating frame. Hence, is anti-Hermitian and thus diagonalizable with eigenvalues . It is assumed that our desired states are “dark states”, which are eigenvectors of with a zero imaginary part of the eigenvalue. For simplicity and illustrative purposes, let us also assume there is just one dark state with eigenvalue , and the rest of the eigenvalues are sorted by . Let us decompose the initial state in the eigenbasis . The evolution under yields the unnormalized state
[TABLE]
The probability of undergoing no quantum jump over a time duration is
[TABLE]
Conditioned on such an event, the fidelity of the quantum state preparation is
[TABLE]
where we find that the fidelity exponentially approaches unity. This allows for effective “cooling” of the system into the desired state when there is no quantum jump for , which occurs with probability . It is also easy to see that when there are multiple dark states, given by some projector , the system is cooled into , conditioned on no quantum jumps which occurs with probability .
Appendix C Proof of uniqueness of steady states for the AKLT example
In this appendix, we provide a detailed proof of our lemma that and have AKLT states as unique steady states, for under the open boundary condition. Although the proof has already been sketched in the main text, here we provide a more detailed analysis. Let us define as the Liouvillian acting only on sites and , and . Let be the projector onto the manifold on spin and . We also define
[TABLE]
as the AKLT Hamiltonian acting on spins under the open boundary condition. We also let be the space of AKLT states on spins, and let be its corresponding projector. We prove by induction on .
We start with our inductive hypothesis, which is that only has the AKLT states as steady states. This means that any -particle wavefunction can reach via some sequence of jump operators . More formally, this means that for any -particle wavefunction , there exists a polynomial function of jump operators such that
[TABLE]
We only need to show that any -particle wavefunction can reach via jump operators, which would yield the proof of our lemma.
From this inductive hypothesis, we first argue that there exists a polynomial of jump operators acting on the first spins such that
[TABLE]
This can be done by simply looking at the the reduced density matrix of on the first spins, and picking with respect to one of the non-trivial eigenvectors of . We note that the AKLT Hamiltonian is frustration free, so any (ground) state minimizing the energy of must also minimize the energy of , or . Hence (38) implies also contains nonzero population in the AKLT ground states among the first spins, i.e., .
Let us then perform a general decomposition
[TABLE]
where
[TABLE]
Here runs through the 5 states in the manifold on the last two spins. The remaining parts of the wavefunction are
[TABLE]
where runs through all the excited eigenstate of the , and runs through all 9 possible 2-spin states.
We assume for the sake of contradiction that is a state that cannot reach via jump operators. We now consider two cases:
Case 1: = 0 for all . — Then . From our inductive hypothesis, must have nonzero population in and , and this can only come from the part, and thus cannot be all vanishing. On the other hand, since we have assumed cannot reach , we must have . That means for some . Since for all , this means that we must have . Then we have , since and . This gives a contradiction with (38).
Case 2: Some [math]. — Consider any jump operator acting on the spins and . Note that
[TABLE]
because are ground states of and thus orthogonal to . We also have since . Then our assumption that cannot reach gives the condition
[TABLE]
where is a -dimensional vector, and is a 20 dimensional matrix. The matrix elements of are given by
[TABLE]
and can be calculated analytically, since the first factor comes from diagonalizing the transfer matrix, and the second factor is computed in a small, 9-dimensional Hilbert space of two spins. Now if , then the matrix has full rank, indicating that we only have the trivial solution . This would contradict this case’s assumption, and hence any must be able to reach via jump operators, and the AKLT states are the unique steady states of .
Therefore, it only remains to compute and show that it is nonzero for in our proposals. Let us first consider , with corresponding to rotation pulses with . For this, we explicitly find
[TABLE]
where . It’s easy to see that this is only zero for , so our inductive proof holds for . The base case of can easily be checked numerically or by exact calculations.
For , which has , we find
[TABLE]
where again we have defined . This is also only nonzero when . Since the base cases of can be checked exactly, this proves that the steady states of and are uniquely given by for .
Our proof method here naturally suggests a method to prepare an AKLT state with specified edge states instead of a mixture of the four under open boundary condition. For instance, can be deterministically prepared by adding two jump operators: = on the left edge and = on the right. In this case, it is easy to see that any linear combination of four ground states can further decay into , which becomes the unique steady state.
Appendix D Details of our numerical simulation
We simulate the dissipative dynamics using the stochastic wavefunction method Gardiner and Zoller (2004). In this approach, the wavefunction continuously evolves under the effective non-Hermitian Hamiltonian and stochastically undergoes quantum jumps at a rate . Physical observables are extracted from an ensemble of wavefunction trajectories obtained from independent simulations. Compared to direct numerical integrations of quantum master equations, this method allows simulation of systems with a larger number of particles. In order to simulate a maximally mixed initial state (or equivalently an infinite temperature ensemble), we sample a random product state in the -basis as the initial state for the -th simulation. For each small time step , the state evolves stochastically according to either
- •
with probability , or
- •
with probability .
We choose so that . Since this process is stochastic, we average over a sufficiently large number of trajectories to estimate the values of observables:
[TABLE]
For the numerical data presented in the main text, we average over up to trajectories, and statistical uncertainties are estimated using the bootstrapping technique Efron (1981). For relatively large system sizes , numerical computations of exact many-body wavefunctions are impractical. Instead, we store the wavefunction in an MPS representation, and simulate the evolution using the time-evolving block decimation algorithm Vidal (2003); *Vidal2. Since we are dissipatively preparing AKLT states that have bond dimension , we find that restricting the maximum bond dimension of our MPS wavefunction to is sufficient, as truncation errors are found to be in all simulations. This algorithm allows us to simulate systems with up to spins.
During our simulated evolution, we monitor two observables: (1) energy density , and (2) fidelity of state preparation where is the projector onto AKLT ground states. Note that since our simulation in the main text is for the open boundary condition, there are four degenerate ground states that are all accepted as output; we define our fidelity to be the sum of overlap with each accepted state. Another widely used measure on quantum states, trace distance Gilchrist et al. (2005), cannot be applied in this context, because it measures how close a state is to another (target) state, not to a subspace of such states. Even in a situation where the target state is a single pure state, e.g. under periodic boundary condition, the trace distance is bounded by our fidelity through . In our numerics where the system size goes up to , the computational cost of calculating the density matrix and trace distance would also be prohibitively expensive. Finally, this fidelity coincides with the success probability of state preparation, which is a physically meaningful metric.
Appendix E Effect of imperfect quantum jump detection
In realistic experiments, the detection of quantum jumps often entails imperfections. The presence of such imperfections affects our protocol by (i) not heralding the failure of connection of two chains (false-positive), and (ii) incorrectly heralding failure when the connection has been successful (false-negative). The former may arise due to imperfect detection efficiency, and the latter due to the dark counts in the detector. As mentioned in the main text, our parallelized protocol can still have an efficient scaling even when such imperfect quantum jump detection is accounted for. In the false-negative scenario, we can still discard affected particle pairs and continue the procedure, but we have to adopt an ideal case success probability lower than (discussed below). To minimize the occurrence of false-positives, we propose two methods that address detector inefficiency. In the following analysis, let us denote the detector efficiency by , the dark count rate by , and the ideal case success probability by .
Success probability after false-negatives— We showed previously in Sec. III.1 that the maximum success probability of connection of can be recovered for the subsequent attempt after a failed connection (via detection of quantum jumps), if we discard the affected particles and apply a global -rotation to one of the remaining chains. However, this is not the case if the quantum jump detector has only received a dark count, i.e. the failure is a false-negative, and the connection has in fact succeeded. After a dark count is registered, the experimenter will unwittingly discard the particles at the original interface, apply , and retry the connection anyways. If we consider the density matrix of the remaining pair of chains, we can see that their edge states at the interface are essentially randomized in a maximally mixed state, which would intuitively yield a success probability in the attempt to connect them. More precisely, if particles were discarded in each original chain of length starting from interface (i.e. particles in the middle of the connected chain of length ), the success probability of connecting the two chains of length can be computed to be
[TABLE]
where . In particular, when , .
Method 1 to mitigate false-positives— The first method to address false-positives from detector inefficiency is to only use jump operators of the form for the connection. Once a quantum jump occurs, the state will continue to undergo quantum jumps indefinitely, creating a much larger signal and effectively larger detection efficiency. Consequently, the detector inefficiency can be exponentially suppressed by the time of having the jump operators turned on. Let be the time-scale in which a single quantum jump would occur. In this case, the probability of diagnosing a successful connection and keeping the result is given by the probability of not detecting any quantum jumps over time ,
[TABLE]
where we defined and . The fidelity is the conditional probability that the diagnosed success was a truly successful connection
[TABLE]
Note that we can only achieve a fidelity arbitrarily close to 1 if , i.e. when the detector efficiency is larger than the dark count probability . In order to achieve a final error of for a system size of from initial chains of length , where connections are necessary, we need , and consequently . This is consistent with the scaling necessary in the ideal protocol. Nonetheless, our new success probability now decreases with system size as if dark counts are non-negligible, where . Consider now the average time to prepare a chain of length :
[TABLE]
where , is the time to prepare initial length- chains, and is some constant time necessary to reset the edge states in the event of failure. At first sight, this indicates that our preparation time would ultimately scale polynomially instead of polylogarithmically in the infinite limit. However, in the regime of , this polynomial dependence has a very small power, and its effect can be neglected if . Hence, in practice, our protocol has an efficient, polylogarithmic scaling up to , beyond which it switches to a polynomial scaling. For instance, even if the single-photon detection efficiency is , then assuming a dark count rate of Hz Hadfield (2009) and a quantum jump scattering rate of MHz, it takes an astronomically long chain of to reach the polynomial scaling. An example scaling under these conditions is shown in Fig. 5.
Method 2 to mitigate false-positives— The second method for addressing detector inefficiency is to slowly turn on jump operators in the vicinity of the interface. In this way, the absence of quantum jumps further confirms that the two chains have indeed been successfully connected; since only a successful connection does not lead to any subsequent quantum jumps, any false-positive diagnosis of successful connection can be corrected. More concretely, consider a -step scheme where we turn on jump operators to include neighbors on each side of the original interface, one pair of neighbors at a time. At step , we have jump operators on for particles centered at the interface, turned on for time . If a quantum jump occurred and evaded detection at any step , we assume is long enough so that the particles would have formed a connected chain of length . At the subsequent step , the length- chain in the middle can be connected to the two length- chains on both sides if we succeed by having no quantum jump, producing a fully connected chain of length . Note that the success probability for steps is roughly . From the system size scaling found in our numerical simulations presented in the main text, we expect to need . Additionally, we expect the number of quantum jumps during of step to roughly scale as for some constant . Observe that this scheme allows us to obtain a fully connected chain even in the event of initial failure(s), as long as we do not have any quantum jumps at the last step. Thus, the probability of succeeding and deciding to keep the result (due to not detecting any quantum jump) is
[TABLE]
where for some constant . The probability of failing at the last step but still keeping the result is
[TABLE]
The fidelity is the conditional probability of true success given that we have kept the result:
[TABLE]
where we defined and . To achieve arbitrarily good fidelity, we require , i.e. the dark count rate needs to be sufficiently small. At the same time, the apparent “success” probability of keeping the result is . We can carry out the same analysis as in the previous method, and a similar behavior emerges: when the dark count rate is nonzero, the efficient polylogarithmic scaling applies until a maximum chain length of , beyond which a polynomial scaling of with applies.
Appendix F Analysis of Rydberg-EIT implementation proposal
In this appendix, we derive the effective dissipative interaction between two nearby particles for our Rydberg-EIT implementation scheme introduced in the main text. Consider two particles interacting via the Rydberg shift . Their effective (non-Hermitian) Hamiltonian under the Rydberg-EIT scheme proposed in the main text is
[TABLE]
where , is the EIT-dark state, and is a state orthogonal to that we call EIT-bright state. Now consider a general two-particle wavefunction , where we have restricted ourselves to working in the symmetric subspace. Then the equations of motion for the coefficients are
[TABLE]
In the limit of , or , and assuming we start initially with , we can adiabatically eliminate the fast dynamics involving coefficients other than . This procedure can be effectively achieved by setting for , allowing us to obtain
[TABLE]
Here, is the interaction-induced energy shift, and is the two-body effective decay rate.
A more general version of adiabatic elimination for open system can be found in Ref. Reiter and Sørensen (2012), which allows us to obtain effective jump operators. Consider original jump operators of the form , corresponding to the spontaneous decay from excited state to one of the three hyperfine ground state for in atom . Note that in practice, the excited state can also decay into other hyperfine ground states, which can then be repumped to the excited state using additional lasers. We denote the decay rate corresponding to by , where . Then we can compute the effective jump operators:
[TABLE]
with rate , and . Note that will further decay through the original jump operator . Assuming we are in the regime so that is a short-lived intermediate state, we can approximate the overall effective dynamics with jump operators of the form for . While we only need a jump operator such as to ensure AKLT states are unique steady states of the engineered dissipative dynamics, the additional effective jump operators do not affect the steady states and can in fact help to more quickly depopulate the undesired states.
Appendix G Scaling of imperfection in Rydberg-EIT implementation
Our protocol prepares AKLT states with finite fidelity when experimental imperfections are taken into account. Here, we analyze how the fidelity scales as multiple chains are connected. In particular, the long-range nature of interaction in the proposed Rydberg-EIT implementation limits fidelity even in the absence of dephasing. Nevertheless, we show that by adopting the parallelized protocol, the long-range interactions only affect the initial preparation of length- chains, and such imperfection does not substantially grow in the later connection procedures. This is because the connections involve turning on the dissipative interaction on particle pairs that are spatially separated by at least particles. Since the effective decay rate scales as for the proposed implementation, the perturbative effect of long-range interaction is characterized by the very small number of , which becomes even smaller in later rounds of connections. Hence, we neglect the effect of long-range interaction on the connections, and only consider how the induced errors on the states of initial chains propagate through the protocol. Let us assume that we initially start with individual chains of length , each with bounded error . At the -th level of connections, we on average double the length , where is the expected number of particles discarded in each connection. The number of initial chains necessary to reach a final chain length of is , and connection procedures need to be performed. Hence, the final error is bounded by
[TABLE]
where we neglect the second term which can be made small compared to the first if we choose . As we can see, the predominant source of error is due to the imperfect initial chains, whose errors add linearly.
This linear scaling of error is indeed very favorable for a many-body state preparation protocol. To put this in perspective, let us estimate how the effective temperature scales in our connection procedure. We define the effective temperature through the relation
[TABLE]
where is the density of states at energy , and we assume that is sufficiently small. Now we consider connecting two length- chains at effective temperature (with errors ). After connection, we have a chain of length , with bounded error . The corresponding effective temperature of the connected chain can be estimated from
[TABLE]
which implies
[TABLE]
where and denote the density of states for chains of length and , respectively. In a generic many-body interacting system, the density of states grows exponentially in system sizes. Here, we are most interested in the density of states of low-lying excitations, e.g. the first excited band, where the scaling of can be much weaker. Ref. Arovas et al. (1988) used a Bijl-Feynman single-mode approximation to deduce that there is a band of low-lying excited states with dispersion relation , corresponding to magnon excitations. Therefore, we expect the number of states in the low-lying excited bands to scale at least linearly with system size, and thus . Applying this to the earlier inequality, we have
[TABLE]
Hence, the effective temperature should not increase (and can potentially decrease) after each connection procedure.
Appendix H Generalization to symmetric MPSs
In this appendix, we provide additional details on how to generalize our protocol for a broader class of translation-invariant MPSs with internal symmetry. We first introduce notation and elaborate on a few useful properties (including injectivity) of translation-invariant MPSs in Sec. H.1. More detailed descriptions and proofs of these properties can be found in Ref. Perez-Garcia et al. (2007). We then discuss the meaning of internal symmetry of MPSs in Sec. H.2. Finally, we describe and analyze the generalization of our protocol in Sec. H.3, and prove the lower bound for the minimum complexity of decay channels.
H.1 Notations and relevant properties of matrix product states
Any (unnormalized) translation-invariant MPS with physical dimension (i.e. spin- particles) and bond dimension can be written as:
[TABLE]
where runs over the physical spin basis for the -th particle, and indicate the “boundary conditions”. We denote by the translation-invariant MPS of particles with open boundary condition specified by and , and by the MPS of an -particle system with periodic boundary condition, i.e. . Under open boundary condition, there could be at most distinct states with different possible boundary conditions, e.g. four-fold degeneracy of AKLT states. In general, however, these states may not be linearly independent unless the MPS is injective (defined below).
Canonical Form— An MPS is in a canonical form if the matrices have a common block diagonal structure: , where for each block . The matrices in each block must satisfy the conditions that (i) , (ii) a map defined as has as its only fixed point (unique eigenvector with unity eigenvalue), and finally (iii) for some diagonal positive and full-rank matrices . From now on, we assume any MPS under consideration is written in a canonical form.
Transfer Matrix— Consider the completely positive map , or equivalently the transfer matrix . Understanding the spectrum of this transfer matrix is useful for computing the expectation value of an observable or the overlap between two quantum states, e.g. Perez-Garcia et al. (2007). Some known eigenvectors of are , where is the dimension of the -th block, and correspond to eigenvalues . Denoting the other eigenvectors of with eigenvalues by , we have
[TABLE]
Since is the largest eigenvalue of each block , typically only the first term is relevant in the limit of large .
Parent Hamiltonian— For a sufficiently large , the set of matrix products spans the vector space of all matrices with the same block diagonal structure as the canonical form Perez-Garcia et al. (2007). We call the interaction length of the MPS. Without loss of generality, we can assume that . This is because otherwise we can group sites together to get an equivalent MPS with larger physical dimension , and a new interaction length . The parent Hamiltonian of an MPS is then defined to be , where is any positive semi-definite operator acting on nearest neighboring sites, whose kernel is
[TABLE]
In other words, imposes a condition for every pair of neighboring sites , which our MPS trivially satisfies (i.e. for all ). Hence, is a frustration-free Hamiltonian of which the MPS is a zero-energy ground state. The ground-state degeneracy depends on both the boundary condition and the number of blocks in the MPS canonical form. Ref. Perez-Garcia et al. (2007) has shown that under periodic boundary condition, this degeneracy equals the number of independent blocks in the canonical form, since the ground space consists of MPSs constructed from the sub-matrices from every block.
Injectivity— Often it is useful to assume a condition that the MPS is injective, which is satisfied in the generic case except for specific, fine-tuned MPSs Perez-Garcia et al. (2007). This injectivity condition is that the transfer matrix has only one eigenvector corresponding to its largest eigenvalue (which we normalize to 1 in the canonical form). This also implies that there is just one block in the canonical form of the MPS. In this case, Eq. (65) simplifies to
[TABLE]
where is the second largest eigenvalue of . Additionally, this implies that the parent Hamiltonian under periodic boundary condition has the MPS as its unique ground state, and that the ground state energy is gapped in the thermodynamic limit. Under open boundary condition, distinct boundary conditions give rise to linearly independent and degenerate ground states . By appropriately modifying the parent Hamiltonian terms at the boundaries, we can break the degeneracy and make one of the states the unique ground state.
H.2 Internal Symmetries of MPSs
We say a translation-invariant MPS defined on -dimensional physical spins respects an internal symmetry , if for some unitary representation , we have:
[TABLE]
That is, a global action of the symmetry operation keeps a ground state of the MPS parent Hamiltonian in the ground space under open boundary condition, or only imprints a complex phase factor under periodic boundary condition.
Assuming the symmetry group is reasonable (either a discrete or a compact connected Lie group), but without assuming injectivity, Ref. Sanz et al. (2009) showed that we can replace the action of the symmetry in the physical basis with a unitary in the virtual bond basis. More explicitly, we have
[TABLE]
Here, , with taking on the same block diagonal structure as , and each a unitary in block . is a permutation amongst the blocks. Lastly, is a phase factor for each block. If is a compact connected Lie group, Ref. Sanz et al. (2009) showed that , while and are representations of .
For AKLT states, where , the relevant representation is given by the rotations on the spin-1 vector for some real parameters . In particular, we have
[TABLE]
where , with .
H.3 Finding a minimal set of decay channels using symmetry
Our goal is to find a minimal set of decay channels acting on neighboring pairs of particles that deterministically prepare the desired MPS, assuming global symmetry operations are available. For concreteness we will first focus on decay channels of the form . We show there is a lower bound on from the structure of representation of on the physical particles, and provide a construction of the jump operators saturating the bound. The uniqueness of steady states under the constructed jump operators can be analytically confirmed using the same inductive proof strategy demonstrated for the case of AKLT states.
Without loss of generality, we assume that the desired states are ground states of a gapped, frustration-free parent Hamiltonian , where is a translation-invariant, nearest-neighbor projector that respects the internal symmetry Perez-Garcia et al. (2007); Sanz et al. (2009). We note the projector has a block diagonal form, corresponding to different irreducible representations of . We call the two-particle subspace that projects onto a “bright manifold” . The ground states are uniquely characterized by vanishing populations in for every neighboring pair of particles.
The foremost necessary condition for the jump operators is
[TABLE]
In other words, the jump operators must be capable of depopulating the entire bright manifold after averaging over all symmetry operations. While here we have assumed that the symmetry group is finite for simplicity, the following results apply to any compact group by replacing the sum over by an integral over the Haar measure of .
To find the minimum number of (and consequently ) required, it is useful to decompose into direct sums of irreducible representations (irreps) , where enumerates the irreps, each with dimension . This decomposition is possible because finite-dimensional unitary representations of any group are completely reducible Artin (2010). Let , where each is a -dimensional vector. Observe that for any matrix , we can derive the following identity using Schur’s lemma Artin (2010):
[TABLE]
where means , or is equivalent (isomorphic) to up to a unitary basis change. Note we can always choose a basis for the representation of that absorbs , so we assume without loss of generality. Using the notation to denote the matrix whose -th row, -th column block is , we can write through the above identity as
[TABLE]
where the second term characterizes the possible nonzero off-diagonal blocks, which can only exist between pairs of equivalent irreps.
Since inequivalent irreps are decoupled, we for now only consider the subspace corresponding to copies of irreps equivalent to irrep (). Let as the operator restricted to the subspace . Observe that restricted to this subspace is specified by the set of vectors . When , regardless of the choice of , there are linearly independent vectors , , such that . Then any vectors of the form are in the kernel of for any , since one can verify . Since there are linearly independent such vectors , we have . Hence, in order to fully depopulate , we need . Because must be an integer, we must have , for every irrep .
Note that this lower bound for can be saturated by construction as follows. First, we partition the equivalent irreps into groups of no more than irreps. For each group, we can assign a that is nonzero only in the subspace corresponding to the irreps in the group. Lastly, we make all off-diagonal blocks vanish for each group , by finding or fewer mutually orthogonal vectors such that for . For a single jump operator of the form , the state may have supports on more than one of subspaces . Therefore, the construction of a set of jump operators to satisfy Eq. (71) can be done in parallel for all the different corresponding to the inequivalent set of irreps, leading to the minimum number
[TABLE]
Here, enumerates inequivalent irreps of in , is the number of copies of , and is the dimension of .
We can also consider an arbitrary jump operator beyond the rank-1 form of . For any operator , we can perform singular value decomposition to write , where . Then with . Hence, the condition of Eq. (71) becomes a condition imposed on the set of right-singular vectors , where we must have . We can thus interpret the found for rank-1 jump operators as the minimum number of independent ’s.
While we can easily construct a minimal set of to satisfy the necessary condition of Eq. (71), we still need to prove the uniqueness of steady states. This can be done using our inductive proof strategy, where one simply needs to confirm that there are only trivial solutions to Eq. (44) under open boundary conditions. As discussed in Sec. V.1, this simply involves showing that a certain matrix has full rank. Nevertheless, for non-injective MPSs, this scheme cannot break the ground-state degeneracy intrinsic to the MPS parent Hamiltonian, but it can guarantee that the ground states are the only steady states.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Perez-Garcia et al. (2007) D. Perez-Garcia, F. Verstraete, M. M. Wolf, and J. I. Cirac, Quantum Inf. Comput. 7 , 401 (2007) .
- 2Schuch et al. (2011) N. Schuch, D. Pérez-García, and I. Cirac, Phys. Rev. B 84 , 165139 (2011) . · doi ↗
- 3Gu and Wen (2009) Z.-C. Gu and X.-G. Wen, Phys. Rev. B 80 , 155131 (2009) . · doi ↗
- 4Chen et al. (2011) X. Chen, Z.-C. Gu, and X.-G. Wen, Phys. Rev. B 83 , 035107 (2011) . · doi ↗
- 5Senthil (2015) T. Senthil, Annual Review of Condensed Matter Physics 6 , 299 (2015) . · doi ↗
- 6Bohnet et al. (2016) J. G. Bohnet, B. C. Sawyer, J. W. Britton, M. L. Wall, A. M. Rey, M. Foss-Feig, and J. J. Bollinger, Science 352 , 1297 (2016) . · doi ↗
- 7Cohen et al. (2015) I. Cohen, P. Richerme, Z.-X. Gong, C. Monroe, and A. Retzker, Phys. Rev. A 92 , 012334 (2015) . · doi ↗
- 8van Bijnen and Pohl (2015) R. M. W. van Bijnen and T. Pohl, Phys. Rev. Lett. 114 , 243002 (2015) . · doi ↗
