Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2507.15506

Symmetry and Liouville Space Formulation of Decoherence-Free Subsystems

So, Mi-Jung, Mahn‐Soo Choi

Published Jul 21, 2025• 0 citations
arXivHTMLPDF

Abstract

We propose a generic and systematic decoherence-free scheme to encode quantum information into an open quantum system based focusing on symmetry. Under a given symmetry, the Liouville space is decomposed into invariant subspaces characterized by a tensor-product structure. A decoherence-free subsystem is then identified as a factor of the tensor product. Unlike decoherence-free subspaces, which typically require strong symmetries, decoherence-free systems are permitted under less restrictive weak symmetries. Specifically, we primarily concern the permutation symmetry in conjunction with the unitary symmetry and utilize the Schur-Weyl duality, which facilitates numerous efficient and systematic calculations based on the well-established group representation theory. Employing the isomorphism between the Liouville space and the fictitious Hilbert space, we construct a super-Schur basis, which block-diagonalizes the super-operators that describe the noisy quantum channels, both in the Kraus representation and in terms of the quantum master equation. Each block reveals the tensor-product structure and facilitates the identification of physically relevant decoherence-free subsystems under the specified weak symmetry.

Related papers

Permutation symmetry and entanglement in quantum states of heterogeneous systems

Gururaj Kadiri, S. Sivakumar

Permutation symmetries of multipartite quantum states are defined only when the constituent subsystems are of equal dimensions. In this work we extend this notion of permutation symmetry to heterogeneous systems, that is, systems composed of subsystems having unequal dimensions. Given a tensor product space of $k$ subsystems (of arbitrary dimensions) and a permutation operation $σ$ over $k$ symbols, these states are such that they have identical decompositions (up to an overall phase) in the given tensor product space and the tensor product space obtained by the permuting the subsystems by $σ$. Towards this, we construct a matrix whose action is to simultaneously permute the subsystem label and subsystem dimension of a given state according to permutation $σ$. Eigenvectors of this matrix have the required symmetry. We then examine entanglement of states in the igenspaces of these matrices. It is found that all nonsymmetric eigenspaces of such matrices are completely entangled subspaces, with states being equally entangled in both the given tensor product space and the permuted tensor product space.

arXiv:1702.04948•Feb 16, 2017•0 citations

Permutation symmetry and entanglement in multipartite quantum states of unequal subsystem dimensions

Gururaj Kadiri, S. Sivakumar

Permutation symmetries of multipartite quantum states are defined only when the constituent subsystems are of equal dimensions. In this work we extend this notion of permutation symmetry to heterogeneous systems, that is, systems composed of subsystems having unequal dimensions. Given a tensor product space of $k$ subsystems (of arbitrary dimensions) and a permutation operation $\sigma$ over $k$ symbols, these states are such that they have identical decompositions (up to an overall phase) in the given tensor product space and the tensor product space obtained by the permuting the subsystems by $\sigma$. Towards this, we construct a matrix whose action is to simultaneously permute the subsystem label and subsystem dimension of a given state according to permutation $\sigma$. Eigenvectors of this matrix have the required symmetry. We then examine entanglement of states in the igenspaces of these matrices. It is found that all nonsymmetric eigenspaces of such matrices are completely entangled subspaces, with states being equally entangled in both the given tensor product space and the permuted tensor product space.

•Feb 16, 2017•0 citations

Efficient classical algorithms for simulating symmetric quantum systems

Eric R. Anschuetz, Andreas Bauer, Bobak T. Kiani +1 more

In light of recently proposed quantum algorithms that incorporate symmetries in the hope of quantum advantage, we show that with symmetries that are restrictive enough, classical algorithms can efficiently emulate their quantum counterparts given certain classical descriptions of the input. Specifically, we give classical algorithms that calculate ground states and time-evolved expectation values for permutation-invariant Hamiltonians specified in the symmetrized Pauli basis with runtimes polynomial in the system size. We use tensor-network methods to transform symmetry-equivariant operators to the block-diagonal Schur basis that is of polynomial size, and then perform exact matrix multiplication or diagonalization in this basis. These methods are adaptable to a wide range of input and output states including those prescribed in the Schur basis, as matrix product states, or as arbitrary quantum states when given the power to apply low depth circuits and single qubit measurements.

Quantum•Nov 28, 2023•27 citations

Liouvillian Non-Invertible Symmetry

Ying-Cheng Yang, Jhen-Dong Lin, Yueh-Nan Chen

Non-invertible symmetries extend conventional symmetries beyond group-like transformations and play an important role in quantum field theory and many-body physics. However, a general framework of non-invertible symmetries in open quantum systems is still lacking. Here, we formulate a general Liouville-space duality framework that extends Hilbert-space non-invertible dualities to open quantum systems. The resulting defect relates Liouvillians with dual Hamiltonian and dissipative parameters and becomes an exact symmetry at self-duality. We apply this framework to the periodic transverse-field Ising chain with two collective Lindblad channels exchanged by Kramers--Wannier (KW) duality. A strong $\mathbb{Z}_2$ symmetry divides Liouville space into four parity sectors, while the defect acts nontrivially only in the even-even sector. At self-duality, the KW defect imposes a momentum-resolved selection rule on Liouvillian Jordan blocks. Modes with different Liouville momenta or KW-defect eigenvalues cannot form a common exceptional Jordan block. For a three-site chain, a global Rényi-2 KW asymmetry dynamically identifies the self-dual conditions. At the same time, the spectral structure exhibits both a semisimple degeneracy and a self-dual exceptional point with a perturbation-selective response. These results extend non-invertible dualities to Markovian quantum dynamics and establish a symmetry-based selection rule for Liouvillian Jordan structures.

quant-pharXiv:2610.23111•Oct 19, 2026•0 citations

Efficient classical algorithms for simulating symmetric quantum systems

Eric R. Anschuetz, Bauer, Andreas, Bobak T. Kiani +1 more

In light of recently proposed quantum algorithms that incorporate symmetries in the hope of quantum advantage, we show that with symmetries that are restrictive enough, classical algorithms can efficiently emulate their quantum counterparts given certain classical descriptions of the input. Specifically, we give classical algorithms that calculate ground states and time-evolved expectation values for permutation-invariant Hamiltonians specified in the symmetrized Pauli basis with runtimes polynomial in the system size. We use tensor-network methods to transform symmetry-equivariant operators to the block-diagonal Schur basis that is of polynomial size, and then perform exact matrix multiplication or diagonalization in this basis. These methods are adaptable to a wide range of input and output states including those prescribed in the Schur basis, as matrix product states, or as arbitrary quantum states when given the power to apply low depth circuits and single qubit measurements.

arXiv:2211.16998•Nov 30, 2022•1 citation

The Structure of Decoherence-free Subsystems

Ji Guan, Yuan Feng, Mingsheng Ying

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.

arXiv:1802.04904•Feb 14, 2018•6 citations
We propose a generic and systematic decoherence-free scheme to encode quantum information into an open quantum system based focusing on symmetry. Under a given symmetry, the Liouville space is decomposed into invariant subspaces characterized by a tensor-product structure. A decoherence-free subsystem is then identified as a factor of the tensor product. Unlike decoherence-free subspaces, which typically require strong symmetries, decoherence-free systems are permitted under less restrictive weak symmetries. Specifically, we primarily concern the permutation symmetry in conjunction with the unitary symmetry and utilize the Schur-Weyl duality, which facilitates numerous efficient and systematic calculations based on the well-established group representation theory. Employing the isomorphism between the Liouville space and the fictitious Hilbert space, we construct a super-Schur basis, which block-diagonalizes the super-operators that describe the noisy quantum channels, both in the Kraus representation and in terms of the quantum master equation. Each block reveals the tensor-product structure and facilitates the identification of physically relevant decoherence-free subsystems under the specified weak symmetry.
Permutation symmetries of multipartite quantum states are defined only when the constituent subsystems are of equal dimensions. In this work we extend this notion of permutation symmetry to heterogeneous systems, that is, systems composed of subsystems having unequal dimensions. Given a tensor product space of kkk subsystems (of arbitrary dimensions) and a permutation operation σσσ over kkk symbols, these states are such that they have identical decompositions (up to an overall phase) in the given tensor product space and the tensor product space obtained by the permuting the subsystems by σσσ. Towards this, we construct a matrix whose action is to simultaneously permute the subsystem label and subsystem dimension of a given state according to permutation σσσ. Eigenvectors of this matrix have the required symmetry. We then examine entanglement of states in the igenspaces of these matrices. It is found that all nonsymmetric eigenspaces of such matrices are completely entangled subspaces, with states being equally entangled in both the given tensor product space and the permuted tensor product space.
Permutation symmetries of multipartite quantum states are defined only when the constituent subsystems are of equal dimensions. In this work we extend this notion of permutation symmetry to heterogeneous systems, that is, systems composed of subsystems having unequal dimensions. Given a tensor product space of kkk subsystems (of arbitrary dimensions) and a permutation operation σ\sigmaσ over kkk symbols, these states are such that they have identical decompositions (up to an overall phase) in the given tensor product space and the tensor product space obtained by the permuting the subsystems by σ\sigmaσ. Towards this, we construct a matrix whose action is to simultaneously permute the subsystem label and subsystem dimension of a given state according to permutation σ\sigmaσ. Eigenvectors of this matrix have the required symmetry. We then examine entanglement of states in the igenspaces of these matrices. It is found that all nonsymmetric eigenspaces of such matrices are completely entangled subspaces, with states being equally entangled in both the given tensor product space and the permuted tensor product space.
In light of recently proposed quantum algorithms that incorporate symmetries in the hope of quantum advantage, we show that with symmetries that are restrictive enough, classical algorithms can efficiently emulate their quantum counterparts given certain classical descriptions of the input. Specifically, we give classical algorithms that calculate ground states and time-evolved expectation values for permutation-invariant Hamiltonians specified in the symmetrized Pauli basis with runtimes polynomial in the system size. We use tensor-network methods to transform symmetry-equivariant operators to the block-diagonal Schur basis that is of polynomial size, and then perform exact matrix multiplication or diagonalization in this basis. These methods are adaptable to a wide range of input and output states including those prescribed in the Schur basis, as matrix product states, or as arbitrary quantum states when given the power to apply low depth circuits and single qubit measurements.
Non-invertible symmetries extend conventional symmetries beyond group-like transformations and play an important role in quantum field theory and many-body physics. However, a general framework of non-invertible symmetries in open quantum systems is still lacking. Here, we formulate a general Liouville-space duality framework that extends Hilbert-space non-invertible dualities to open quantum systems. The resulting defect relates Liouvillians with dual Hamiltonian and dissipative parameters and becomes an exact symmetry at self-duality. We apply this framework to the periodic transverse-field Ising chain with two collective Lindblad channels exchanged by Kramers--Wannier (KW) duality. A strong Z2\mathbb{Z}_2Z2​ symmetry divides Liouville space into four parity sectors, while the defect acts nontrivially only in the even-even sector. At self-duality, the KW defect imposes a momentum-resolved selection rule on Liouvillian Jordan blocks. Modes with different Liouville momenta or KW-defect eigenvalues cannot form a common exceptional Jordan block. For a three-site chain, a global Rényi-2 KW asymmetry dynamically identifies the self-dual conditions. At the same time, the spectral structure exhibits both a semisimple degeneracy and a self-dual exceptional point with a perturbation-selective response. These results extend non-invertible dualities to Markovian quantum dynamics and establish a symmetry-based selection rule for Liouvillian Jordan structures.
In light of recently proposed quantum algorithms that incorporate symmetries in the hope of quantum advantage, we show that with symmetries that are restrictive enough, classical algorithms can efficiently emulate their quantum counterparts given certain classical descriptions of the input. Specifically, we give classical algorithms that calculate ground states and time-evolved expectation values for permutation-invariant Hamiltonians specified in the symmetrized Pauli basis with runtimes polynomial in the system size. We use tensor-network methods to transform symmetry-equivariant operators to the block-diagonal Schur basis that is of polynomial size, and then perform exact matrix multiplication or diagonalization in this basis. These methods are adaptable to a wide range of input and output states including those prescribed in the Schur basis, as matrix product states, or as arbitrary quantum states when given the power to apply low depth circuits and single qubit measurements.
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.