The Structure of Decoherence-free Subsystems

Ji Guan, Yuan Feng, Mingsheng YingarXiv 2018 · DOI · arXiv

Abstract

Decoherence-free subsystems have been successfully developed as a tool to preserve fragile quantum information against noises. In this letter, we develop a structure theory for decoherence-free subsystems. Based on it, we present an effective algorithm to construct a set of maximal decoherence-free subsystems in the sense that any other such subsystem is a subspace of one of them. As an application of these techniques in quantum many body systems, we propose a simple and numerically robust method to determine if two irreducible tensors are repeated, a key step in deciding if they are equivalent in generating matrix product states.

Introduction

Quantum computers are notoriously fragile. Interaction with the environment causes "decoherence," where quantum information leaks out and turns into classical noise. To fight this, researchers use decoherence-free (DF) subsystems. These are specific "pockets" of a quantum system where the noise doesn't destroy information but instead acts as a simple unitary transformation (like a rotation), which is easily reversible.

While "noiseless" subsystems (where noise does absolutely nothing) were well-understood, a general theory for DF subsystems was missing. Specifically, there was no systematic way to look at a noisy quantum process (a "super-operator") and calculate the largest possible DF subsystems it contains. Without this, researchers couldn't be sure they were using the most efficient blocks for storing quantum data.

Methods

The authors bridge the gap between noiseless and decoherence-free subsystems by focusing on the mathematical structure of the noise itself.

  1. Continuous Coherences: They introduce the concept of "continuous coherences"—off-diagonal blocks in the system's density matrix that evolve by picking up a phase ($e^{i\theta}$) rather than decaying.
  2. Equivalence Relations: They prove that the existence of these continuous coherences forms an equivalence relation. This allows them to group "minimal subspaces" of the Hilbert space into larger, maximal blocks.
  3. The Algorithm: The paper outlines a method to transform these "continuous" (phase-shifting) coherences into "stationary" (unchanging) ones. By doing this, they can leverage existing, well-known algorithms designed for noiseless subsystems to solve the more complex DF subsystem problem.

Results

The core insight of this work is that a DF subsystem is essentially a noiseless subsystem "in disguise." If you can find the right unitary transformation to "rotate" the noise away, you can treat a DF subsystem exactly like a noiseless one. The theory doesn't just find any DF subsystem; it identifies the maximal ones.

The unique orthogonal decomposition of the Hilbert space into maximal blocks.

As formalized in Theorem 2 (The Structure Theorem), the Hilbert space can be uniquely decomposed into blocks $\mathcal{X}_l$ which are further partitioned into subsystems $\mathcal{B}_{l,p}$. This ensures that any other DF subsystem is just a smaller part of the ones found by their algorithm. In a worked example involving a 1-qubit system, the authors demonstrate that this DF approach can double the capacity for storing quantum information compared to traditional noiseless methods by accounting for unitary noise evolution.

Furthermore, the authors apply these techniques to Matrix Product States (MPS). They provide a simple condition to determine if two irreducible tensors are equivalent: they are repeated if and only if a specific super-operator constructed from them has an eigenvalue with a magnitude of exactly one. This method is numerically robust, relying on eigenvalue calculations rather than the unstable Jordan decomposition.

Conclusion

This paper provides a complete "map" for finding the best ways to hide quantum information from noise. While the current theory is built for discrete-time quantum operations (CPTP maps), generalizing these results to continuous-time systems (governed by Lindblad master equations) remains a key area for future work. This would provide a linear-algebraic toolkit for finding DF subsystems in real-time physical simulations of many-body systems.

Summary updated

Abstract

Decoherence-free subsystems have been successfully developed as a tool to preserve fragile quantum information against noises. In this letter, we develop a structure theory for decoherence-free subsystems. Based on it, we present an effective algorithm to construct a set of maximal decoherence-free subsystems in the sense that any other such subsystem is a subspace of one of them. As an application of these techniques in quantum many body systems, we propose a simple and numerically robust method to determine if two irreducible tensors are repeated, a key step in deciding if they are equivalent in generating matrix product states.
BibTeX
@misc{guan2018structure,
  author = {Ji Guan and Yuan Feng and Mingsheng Ying},
  title = {{The Structure of Decoherence-free Subsystems}},
  year = {2018},
  eprint = {1802.04904},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/1802.04904},
}
Figure