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:1212.3839 · Physical Review A

Numerical method for finding decoherence-free subspaces and its applications

Xiaoting Wang, Mark Byrd, Kurt A. Jacobs

Published Jan 31, 2013• 19 citations
arXivHTMLPDF

Abstract

In this work, inspired by the study of semidefinite programming for block-diagonalizing matrix *-algebras, we propose an algorithm that can find the algebraic structure of decoherence-free subspaces (DFS's) for a given noisy quantum channel. We prove that this algorithm will work for all cases with probability 1, and it is more efficient than the algorithm proposed by J. A. Holbrook, D. W. Kribs, and R. Laflamme, [Quantum. Inf. Proc. 80, 381 (2003)]. In fact, our results reveal that this previous algorithm only works for special cases. As an application, we discuss how this method can be applied to increase the efficiency of an optimization procedure for finding an approximate DFS.

DOI
10.1103/physreva.87.012338

Related papers

Using a Numerical Algorithm to Search for Decoherence-Free Sub-systems

Purva Thakre

In this paper, we discuss the need for quantum error correction. We also describe some basic techniques used in quantum error correction which includes decoherence-free subspaces and subsystems. These subspaces and subsystems are described in detail. We also introduce a numerical algorithm that was used previously to search for these decoherence-free subspaces and subsystems under collective error. It is useful to search for them as they can be used to store quantum information. We use this algorithm in some specific examples involving qubits and qutrits. The results of these algorithm are then compared with the error algebra obtained using Young tableaux. We use these results to describe how the specific numerical algorithm can be used for the search of approximate decoherence-free subspaces and subsystems and minimal noise subsystems.

Theory of Computing Systems•Jan 1, 2018•0 citations

Quantum reservoir computing based on decoherence-free subspaces

Mikhail Altaisky, Natalia Kaputkina

The idea of coding the information in decoherence-free subspaces (DFS) to avoid decoherence in quantum computations has been receiving a lot of attention in circuit-based quantum computations, since first proposed by Zanardi & Rasetti [1] (Phys. Rev. Lett., 1997). Following [2] (Altaisky & Kaputkina, JISST, 2025), we study the possibility to harness DFS to quantum machine learning, where no explicit algorithm is present, but the quantum system learns to classify data. We have shown that a simple classification problem of distinguishing between 2-qubit product states and 2-qubit entangled states can be solved by 4-qubit quantum reservoir [3] (Ghosh, et al., npj Quantum Inf., 2019), the output of which we fed to decoherence-free subspaces.

Days on Diffraction•Jun 16, 2025•0 citations

Efficient preparation of decoherence-free subspace basis states

Zi-Ming Li, Yu-xi Liu

Decoherence-free subspace (DFS) provides a crucial mechanism for passive error mitigation in quantum computation by encoding information within symmetry-protected subspaces of the Hilbert space, which are immune from collective decoherence. Constructing a complete set of orthogonal basis states for the DFS is essential to realize fault-tolerant quantum computation by using the DFS codes. However, existing methods for preparing these basis states are often non-scalable, platform-specific, or yield mixed states. Here, we propose a deterministic approach to prepare pure, orthogonal and complete DFS basis states for systems of arbitrary size composed of qubits. Our method employs projective measurements and quantum circuits with single-qubit, two-qubit and Toffoli gates. We provide a rigorous resource cost analysis both mathematically and numerically. Meanwhile, we demonstrate the realizability of our method on NISQ devices by discussing how to implement our method on a superconducting chip. The proposed method offers a universal solution for preparing the DFS basis states across diverse quantum computing platforms and system sizes, which is realizable in the NISQ era.

arXiv:2509.11544•Physical Review A•Dec 9, 2025•0 citations

Semidefinite Programming for Quantum Channel Learning

Mikhail Gennadievich Belov, Victor Victorovich Dubov, Vadim Konstantinovich Ivanov +3 more

The problem of reconstructing a quantum channel from a sample of classical data is considered. When the total fidelity can be represented as a ratio of two quadratic forms (e.g., in the case of mapping a mixed state to a pure state, projective operators, unitary learning, and others), Semidefinite Programming (SDP) can be applied to solve the fidelity optimization problem with respect to the Choi matrix. A remarkable feature of SDP is that the optimization is convex, which allows the problem to be efficiently solved by a variety of numerical algorithms. We have tested several commercially available SDP solvers, all of which allowed for the reconstruction of quantum channels of different forms. A notable feature is that the Kraus rank of the obtained quantum channel typically comprises less than a few percent of its maximal possible value. This suggests that a relatively small Kraus rank quantum channel is typically sufficient to describe experimentally observed classical data. The theory was also applied to the problem of reconstructing projective operators from data. Finally, we discuss a classical computational model based on quantum channel transformation, performed and calculated on a classical computer, possibly hardware-optimized.

cs.LGCross-listedarXiv:2601.12502•Physical review. E•Jan 20, 2026•0 citations

Identification of decoherence-free subspaces without quantum process tomography

Dylan H. Mahler, Lee A. Rozema, Ardavan Darabi +1 more

Characterizing a quantum process is the critical first step towards applying such a process in a quantum information protocol. Full process characterization is known to be extremely resource-intensive, motivating the search for more efficient ways to extract salient information about the process. An example is the identification of ``decoherence-free subspaces,'' in which computation or communications may be carried out, immune to the principal sources of decoherence in the system. Here we propose and demonstrate a protocol which enables one to directly identify a decoherence-free subspace (DFS) without carrying out a full reconstruction. Our protocol offers an up-to-quadratic speedup over standard process tomography. In this paper, we experimentally identify the DFS of a two-qubit process with 32 measurements rather than the usual 256, characterize the robustness and efficiency of the protocol, and discuss its extension to higher-dimensional systems.

arXiv:1206.4510•Physical Review A•Nov 2, 2012•2 citations

Semidefinite-programming-based optimization of quantum random access codes over noisy channels

Rafael A. da Silva, Breno Marques

There are many approaches when it comes to exploring the potential of the random access code (RAC) communication protocol. Given its versatility, the RAC is particularly useful when the communication between parties is restricted. In previous works, it has been proven that ${2}^{(d)}\ensuremath{\rightarrow}1$ quantum random access codes (QRAC), in the absence of noise, outperform their classical counterpart (the ${2}^{(d)}\ensuremath{\rightarrow}1$ CRAC) for any dimension $d$. Here, building upon these works, we showed that noisy channels can significantly decrease the performance of ${2}^{(d)}\ensuremath{\rightarrow}1$ QRAC. In order to mitigate noise-driven efficiency losses, we employed the see-saw optimization algorithm with semidefinite programming (SDP) to find the best quantum encoding and decoding strategies for the QRAC given a known quantum channel.

arXiv:2204.09485•Physical Review A•Apr 28, 2023•9 citations
In this work, inspired by the study of semidefinite programming for block-diagonalizing matrix *-algebras, we propose an algorithm that can find the algebraic structure of decoherence-free subspaces (DFS's) for a given noisy quantum channel. We prove that this algorithm will work for all cases with probability 1, and it is more efficient than the algorithm proposed by J. A. Holbrook, D. W. Kribs, and R. Laflamme, [Quantum. Inf. Proc. 80, 381 (2003)]. In fact, our results reveal that this previous algorithm only works for special cases. As an application, we discuss how this method can be applied to increase the efficiency of an optimization procedure for finding an approximate DFS.
In this paper, we discuss the need for quantum error correction. We also describe some basic techniques used in quantum error correction which includes decoherence-free subspaces and subsystems. These subspaces and subsystems are described in detail. We also introduce a numerical algorithm that was used previously to search for these decoherence-free subspaces and subsystems under collective error. It is useful to search for them as they can be used to store quantum information. We use this algorithm in some specific examples involving qubits and qutrits. The results of these algorithm are then compared with the error algebra obtained using Young tableaux. We use these results to describe how the specific numerical algorithm can be used for the search of approximate decoherence-free subspaces and subsystems and minimal noise subsystems.
The idea of coding the information in decoherence-free subspaces (DFS) to avoid decoherence in quantum computations has been receiving a lot of attention in circuit-based quantum computations, since first proposed by Zanardi & Rasetti [1] (Phys. Rev. Lett., 1997). Following [2] (Altaisky & Kaputkina, JISST, 2025), we study the possibility to harness DFS to quantum machine learning, where no explicit algorithm is present, but the quantum system learns to classify data. We have shown that a simple classification problem of distinguishing between 2-qubit product states and 2-qubit entangled states can be solved by 4-qubit quantum reservoir [3] (Ghosh, et al., npj Quantum Inf., 2019), the output of which we fed to decoherence-free subspaces.
Decoherence-free subspace (DFS) provides a crucial mechanism for passive error mitigation in quantum computation by encoding information within symmetry-protected subspaces of the Hilbert space, which are immune from collective decoherence. Constructing a complete set of orthogonal basis states for the DFS is essential to realize fault-tolerant quantum computation by using the DFS codes. However, existing methods for preparing these basis states are often non-scalable, platform-specific, or yield mixed states. Here, we propose a deterministic approach to prepare pure, orthogonal and complete DFS basis states for systems of arbitrary size composed of qubits. Our method employs projective measurements and quantum circuits with single-qubit, two-qubit and Toffoli gates. We provide a rigorous resource cost analysis both mathematically and numerically. Meanwhile, we demonstrate the realizability of our method on NISQ devices by discussing how to implement our method on a superconducting chip. The proposed method offers a universal solution for preparing the DFS basis states across diverse quantum computing platforms and system sizes, which is realizable in the NISQ era.
The problem of reconstructing a quantum channel from a sample of classical data is considered. When the total fidelity can be represented as a ratio of two quadratic forms (e.g., in the case of mapping a mixed state to a pure state, projective operators, unitary learning, and others), Semidefinite Programming (SDP) can be applied to solve the fidelity optimization problem with respect to the Choi matrix. A remarkable feature of SDP is that the optimization is convex, which allows the problem to be efficiently solved by a variety of numerical algorithms. We have tested several commercially available SDP solvers, all of which allowed for the reconstruction of quantum channels of different forms. A notable feature is that the Kraus rank of the obtained quantum channel typically comprises less than a few percent of its maximal possible value. This suggests that a relatively small Kraus rank quantum channel is typically sufficient to describe experimentally observed classical data. The theory was also applied to the problem of reconstructing projective operators from data. Finally, we discuss a classical computational model based on quantum channel transformation, performed and calculated on a classical computer, possibly hardware-optimized.
Characterizing a quantum process is the critical first step towards applying such a process in a quantum information protocol. Full process characterization is known to be extremely resource-intensive, motivating the search for more efficient ways to extract salient information about the process. An example is the identification of ``decoherence-free subspaces,'' in which computation or communications may be carried out, immune to the principal sources of decoherence in the system. Here we propose and demonstrate a protocol which enables one to directly identify a decoherence-free subspace (DFS) without carrying out a full reconstruction. Our protocol offers an up-to-quadratic speedup over standard process tomography. In this paper, we experimentally identify the DFS of a two-qubit process with 32 measurements rather than the usual 256, characterize the robustness and efficiency of the protocol, and discuss its extension to higher-dimensional systems.
There are many approaches when it comes to exploring the potential of the random access code (RAC) communication protocol. Given its versatility, the RAC is particularly useful when the communication between parties is restricted. In previous works, it has been proven that ${2}^{(d)}\ensuremath{\rightarrow}1$ quantum random access codes (QRAC), in the absence of noise, outperform their classical counterpart (the ${2}^{(d)}\ensuremath{\rightarrow}1$ CRAC) for any dimension ddd. Here, building upon these works, we showed that noisy channels can significantly decrease the performance of ${2}^{(d)}\ensuremath{\rightarrow}1$ QRAC. In order to mitigate noise-driven efficiency losses, we employed the see-saw optimization algorithm with semidefinite programming (SDP) to find the best quantum encoding and decoding strategies for the QRAC given a known quantum channel.