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:quant-ph/0011021

Duality and Decoherence Free Subspaces

David Day Song, Richard J. Szabo

Published Nov 6, 2000• 1 citation
arXivHTMLPDF

Abstract

Quantum error avoiding codes are constructed by exploiting a geometric interpretation of the algebra of measurements of an open quantum system. The notion of a generalized Dirac operator is introduced and used to naturally construct families of decoherence free subspaces for the encoding of quantum information. The members of the family are connected to each other by the discrete Morita equivalences of the algebra of observables, which render possible several choices of noiseless code in which to perform quantum computation. The construction is applied to various examples of discrete and continuous quantum systems.

DOI
10.48550/arxiv.quant-ph/0011021

Related papers

Recursive encoding and decoding of the noiseless subsystem and decoherence-free subspace

Chi-Kwong Li, Mikio Nakahara, Yiu‐Tung Poon +2 more

When an environmental disturbance to a quantum system has a wavelength much larger than the system size, all qubits in the system are under the action of the same error operator. The noiseless subsystem and decoherence-free subspace are immune to such collective noise. We construct simple quantum circuits that implement these error-avoiding codes for a small number $n$ of physical qubits. A single logical qubit is encoded with $n=3$ and 4, while two and three logical qubits are encoded with $n=5$ and 7, respectively. Recursive relations among subspaces employed in these codes play essential roles in our implementation.

arXiv:1106.5210•Physical Review A•Oct 5, 2011•15 citations

Clifford Code Constructions of Operator Quantum Error-Correcting Codes

Andreas Klappenecker, Pradeep Kiran Sarvepalli

Recently, operator quantum error-correcting codes have been proposed to unify and generalize decoherence free subspaces, noiseless subsystems, and quantum error-correcting codes. This correspondence introduces a natural construction of such codes in terms of Clifford codes, an elegant generalization of stabilizer codes due to Knill. Character-theoretic methods are used to derive a simple method to construct operator quantum error-correcting codes from any classical additive code over a finite field, which obviates the need for self-orthogonal codes.

arXiv:quant-ph/0604161•IEEE Transactions on Information Theory•Dec 1, 2008•41 citations

New construction of quantum error-avoiding codes via group representation of quantum stabilizer codes

Hailin Xiao, Zhongshan Zhang, Anthony Theodore Chronopoulos

In quantum computing, nice error bases as generalization of the Pauli basis were introduced by Knill. These bases are known to be projective representations of finite groups. In this paper, we propose a group representation approach to the study of quantum stabilizer codes. We utilize this approach to define decoherence-free subspaces (DFSs). Unlike previous studies of DFSs, this type of DFSs does not involve any spatial symmetry assumptions on the system-environment interaction. Thus, it can be used to construct quantum error-avoiding codes (QEACs) that are fault tolerant automatically. We also propose a new simple construction of QEACs and subsequently develop several classes of QEACs. Finally, we present numerical simulation results encoding the logical error rate over physical error rate on the fidelity performance of these QEACs. Our study demonstrates that DFSs-based QEACs are capable of providing a generalized and unified framework for error-avoiding methods.

The European Physical Journal C•Oct 1, 2017•5 citations

Error Avoiding Quantum Codes

Paolo Zanardi, Mario Rasetti

The existence is proved of a class of open quantum systems that admits a linear subspace [Formula: see text] of the space of states such that the restriction of the dynamical semigroup to the states built over [Formula: see text] is unitary. Such subspace allows for error-avoiding (noiseless) encoding of quantum information.

arXiv:quant-ph/9710041•Modern Physics Letters B•Oct 30, 1997•162 citations

Measurement incompatibility and noiseless quantum codes

Yu-Xuan Zhang, Jing-Ling Chen

We construct a rank-one minimal informationally complete measurement (MIC) with an invertible dual operator and prove that, for arbitrary finite input and output dimensions, a channel universally preserves measurement incompatibility if and only if its input space contains a noiseless code subspace of the full output dimension. Preserving the compatibility threshold of a finite family of binary measurements already guarantees such a code. Furthermore, for every $d\ge2$, there exists a family of binary measurements that is incompatible on the full space but compatible after compression to any proper subspace. These results resolve the conjecture of Chitambar and Zhang and the existence question posed by Uola and coauthors. We also give an explicit construction of exact encodings and show that, for a sufficiently small shift in the compatibility threshold, the transmission error of an approximate encoding is bounded by a constant times the square of the shift. These results establish a connection between measurement compatibility, quantum steering, and quantum error correction.

quant-pharXiv:2610.37347•Oct 28, 2026•0 citations

Combined error correction techniques for quantum computing architectures

Mark Byrd, Daniel A. Lidar

Proposals for quantum computing devices are many and varied. They each have unique noise processes that make none of them fully reliable at this time. There are several error correction/avoidance techniques which are valuable for reducing or eliminating errors, but not one, alone, will serve as a panacea. One must therefore take advantage of the strength of each of these techniques so that we may extend the coherence times of the quantum systems and create more reliable computing devices. To this end we give a general strategy for using dynamical decoupling operations on encoded subspaces. These encodings may be of any form; of particular importance are decoherence-free subspaces and quantum error correction codes. We then give means for empirically determining an appropriate set of dynamical decoupling operations for a given experiment. Using these techniques, we then propose a comprehensive encoding solution to many of the problems of quantum computing proposals which use exchange-type interactions. This uses a decoherence-free subspace and an efficient set of dynamical decoupling operations. It also addresses the problem of controllability in solid-state quantum dot devices.

arXiv:quant-ph/0210072•Journal of Modern Optics•Jan 1, 2003•20 citations
Quantum error avoiding codes are constructed by exploiting a geometric interpretation of the algebra of measurements of an open quantum system. The notion of a generalized Dirac operator is introduced and used to naturally construct families of decoherence free subspaces for the encoding of quantum information. The members of the family are connected to each other by the discrete Morita equivalences of the algebra of observables, which render possible several choices of noiseless code in which to perform quantum computation. The construction is applied to various examples of discrete and continuous quantum systems.
When an environmental disturbance to a quantum system has a wavelength much larger than the system size, all qubits in the system are under the action of the same error operator. The noiseless subsystem and decoherence-free subspace are immune to such collective noise. We construct simple quantum circuits that implement these error-avoiding codes for a small number nnn of physical qubits. A single logical qubit is encoded with n=3n=3n=3 and 4, while two and three logical qubits are encoded with n=5n=5n=5 and 7, respectively. Recursive relations among subspaces employed in these codes play essential roles in our implementation.
Recently, operator quantum error-correcting codes have been proposed to unify and generalize decoherence free subspaces, noiseless subsystems, and quantum error-correcting codes. This correspondence introduces a natural construction of such codes in terms of Clifford codes, an elegant generalization of stabilizer codes due to Knill. Character-theoretic methods are used to derive a simple method to construct operator quantum error-correcting codes from any classical additive code over a finite field, which obviates the need for self-orthogonal codes.
In quantum computing, nice error bases as generalization of the Pauli basis were introduced by Knill. These bases are known to be projective representations of finite groups. In this paper, we propose a group representation approach to the study of quantum stabilizer codes. We utilize this approach to define decoherence-free subspaces (DFSs). Unlike previous studies of DFSs, this type of DFSs does not involve any spatial symmetry assumptions on the system-environment interaction. Thus, it can be used to construct quantum error-avoiding codes (QEACs) that are fault tolerant automatically. We also propose a new simple construction of QEACs and subsequently develop several classes of QEACs. Finally, we present numerical simulation results encoding the logical error rate over physical error rate on the fidelity performance of these QEACs. Our study demonstrates that DFSs-based QEACs are capable of providing a generalized and unified framework for error-avoiding methods.
We construct a rank-one minimal informationally complete measurement (MIC) with an invertible dual operator and prove that, for arbitrary finite input and output dimensions, a channel universally preserves measurement incompatibility if and only if its input space contains a noiseless code subspace of the full output dimension. Preserving the compatibility threshold of a finite family of binary measurements already guarantees such a code. Furthermore, for every d≥2d\ge2d≥2, there exists a family of binary measurements that is incompatible on the full space but compatible after compression to any proper subspace. These results resolve the conjecture of Chitambar and Zhang and the existence question posed by Uola and coauthors. We also give an explicit construction of exact encodings and show that, for a sufficiently small shift in the compatibility threshold, the transmission error of an approximate encoding is bounded by a constant times the square of the shift. These results establish a connection between measurement compatibility, quantum steering, and quantum error correction.
Proposals for quantum computing devices are many and varied. They each have unique noise processes that make none of them fully reliable at this time. There are several error correction/avoidance techniques which are valuable for reducing or eliminating errors, but not one, alone, will serve as a panacea. One must therefore take advantage of the strength of each of these techniques so that we may extend the coherence times of the quantum systems and create more reliable computing devices. To this end we give a general strategy for using dynamical decoupling operations on encoded subspaces. These encodings may be of any form; of particular importance are decoherence-free subspaces and quantum error correction codes. We then give means for empirically determining an appropriate set of dynamical decoupling operations for a given experiment. Using these techniques, we then propose a comprehensive encoding solution to many of the problems of quantum computing proposals which use exchange-type interactions. This uses a decoherence-free subspace and an efficient set of dynamical decoupling operations. It also addresses the problem of controllability in solid-state quantum dot devices.