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

Quantum Information and Computation

A comparison of decoherence-free subsystem/subspace for partially-broken symmetry

SiddiquiShabnam, Gea-BanaclocheJulio

Published Nov 1, 2005• 0 citations
Publisher

Abstract

We study the performance of the 3-quhit decoherence-free subsystem and the 4-quhitdecoherence-free subspace in the presence of partially correlated noise. We characterizetheir performance in terms ...
DOI
10.5555/2011656.2011661

Related papers

27pBE-8 Identification of Noiseless Subsystem and Decoherence Free Subspace for N-Qubits

Utkan Güngördü, Chi-Kwong Li, Mikio Nakahara +2 more

日本物理学会講演概要集•Mar 5, 2012•0 citations

Creation, verification, and scalability of decoherence-free subspaces and noiseless subsystems on superconducting qubits

Gregory Quiroz, Bibek Pokharel, Yifan Sun +10 more

Bulletin of the American Physical Society•Mar 15, 2021•0 citations

21aED-12 Implementation of Noiseless Subsystems and Decoherence Free Subspace

幹夫 中原, Chi-Kwong Li, Yiu‐Tung Poon +2 more

日本物理学会講演概要集•Aug 24, 2011•0 citations

A comparison of decoherence-free subsystem/subspace for partially broken symmetry

S. Siddiqui, Julio R. Gea-Banacloche

We study the performance of the 3-qubit decoherence-free subsystem and the 4-qubit decoherence-free subspace in the presence of partially correlated noise. We characterize their performance in terms of the average and worst-case fidelity, as a function of the ratio of the interqubit distance to the correlation length of the noise, and find that, in general, more symmetric arrangements (triangles or squares) lead to better performance. Overall, we find the 3-qubit code to perform better than the 4-qubit code by about a factor of 2 in the average infidelity. We observe that this is related to the greater robustness of this code against uncorrelated (independent) errors.

Quantum Information and Computation•Nov 1, 2005•0 citations

Minimal noise subsystems

Xiaoting Wang, Mark Byrd, Kurt A. Jacobs

A system subjected to noise contains a decoherence-free subspace or subsystem (DFS) only if the noise possesses an exact symmetry. Here we consider noise models in which a perturbation breaks a symmetry of the noise, so that if S is a DFS under a given noise process it is no longer so under the new perturbed noise process. We ask whether there is a subspace or subsystem that is more robust to the perturbed noise than S. To answer this question we develop a numerical method that allows us to search for subspaces or subsystems that are maximally robust to arbitrary noise processes. We apply this method to a number of examples, and find that a subsystem that is a DFS is often not the subsystem that experiences minimal noise when the symmetry of the noise is broken by a perturbation. We discuss which classes of noise have this property.

arXiv:1305.1978•Physical Review Letters•Mar 3, 2016•9 citations

Symmetry-Driven Coherence Preservation in Open Quantum Systems: From a Negative Single-Qubit Specificity Audit to a Locked Two-Qubit Decoherence-Free-Subspace Benchmark

Marcel Krüger, Don Feeney

•Jul 24, 2026•0 citations
We study the performance of the 3-qubit decoherence-free subsystem and the 4-qubit decoherence-free subspace in the presence of partially correlated noise. We characterize their performance in terms of the average and worst-case fidelity, as a function of the ratio of the interqubit distance to the correlation length of the noise, and find that, in general, more symmetric arrangements (triangles or squares) lead to better performance. Overall, we find the 3-qubit code to perform better than the 4-qubit code by about a factor of 2 in the average infidelity. We observe that this is related to the greater robustness of this code against uncorrelated (independent) errors.
A system subjected to noise contains a decoherence-free subspace or subsystem (DFS) only if the noise possesses an exact symmetry. Here we consider noise models in which a perturbation breaks a symmetry of the noise, so that if S is a DFS under a given noise process it is no longer so under the new perturbed noise process. We ask whether there is a subspace or subsystem that is more robust to the perturbed noise than S. To answer this question we develop a numerical method that allows us to search for subspaces or subsystems that are maximally robust to arbitrary noise processes. We apply this method to a number of examples, and find that a subsystem that is a DFS is often not the subsystem that experiences minimal noise when the symmetry of the noise is broken by a perturbation. We discuss which classes of noise have this property.