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

Days on Diffraction

Quantum reservoir computing based on decoherence-free subspaces

Mikhail Altaisky, Natalia Kaputkina

Published Jun 16, 2025• 0 citations
Publisher

Abstract

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.

DOI
10.1109/dd66835.2025.11263475

Related papers

Quantum reservoir networks based on decoherence-free subspaces

V. V. Akshay, M. V. Altaisky, N. E. Kaputkina

We present numerical simulation of a six-qubit quantum reservoir network with an output implemented on a 5-dimensional decoherence-free subspace (DFS), working as a classifier between entangled and product states of the input quantum system, fed to the reservoir during a finite learning time. Since the dynamics of DFS is not affected by external fluctuations, no cooling is required, and the proposed model seems a promising candidate for future quantum artificial intelligence systems working at room temperatures and free of huge energy consumption.

quant-pharXiv:2605.27427•May 22, 2026•0 citations

Algorithm-based analysis of collective decoherence in quantum computation

Shoko Utsunomiya, Cyrus P. Master, Y. Yamamoto

In a quantum computer, qubits are often stored in identical two-level systems separated by a distance shorter than the characteristic wavelength of the reservoirs that are responsible for decoherence. In this case the collective qubit-reservoir interaction, rather than the individual qubit-reservoir interaction, may determine the decoherence properties. We study the collective decoherence behavior in between each step in certain quantum algorithms and propose a simple alternative of implementing quantum algorithms using a quantum trajectory that is close to a decoherence-free subspace that avoids unstable Dicke's superradiant states and Schrödinger's cat state.

arXiv:quant-ph/0408162•Journal of the Optical Society of America B•Jan 26, 2007•7 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

Robustness of decoherence-free subspaces for quantum computation

Dave Bacon, Daniel A. Lidar, K. Birgitta Whaley

It was shown recently [D. A. Lidar et al., Phys. Rev. Lett. 81, 2594 (1998)] that within the framework of the semigroup Markovian master equation, decoherence-free (DF) subspaces exist which are stable to first order in time to a perturbation. Here this result is extended to the non-Markovian regime and generalized. In particular, it is shown that within both the semigroup and the non-Markovian operator sum representation, DF subspaces are stable to all orders in time to a symmetry-breaking perturbation. DF subspaces are thus ideal for quantum memory applications. For quantum computation, however, the stability result does not extend beyond the first order. Thus, to perform robust quantum computation in DF subspaces, they must be supplemented with quantum error correcting codes.

arXiv:quant-ph/9902041•Physical Review A•Sep 1, 1999•148 citations

Universal Fault-Tolerant Quantum Computation on Decoherence-Free Subspaces

Dave Bacon, Julia Kempe, Daniel A. Lidar +1 more

A general scheme to perform universal, fault-tolerant quantum computation within decoherence-free subspaces (DFSs) is presented. At most two-qubit interactions are required, and the system remains within the DFS throughout the entire implementation of a quantum gate. We show explicitly how to perform universal computation on clusters of the four-qubit DFS encoding one logical qubit each under spatially symmetric (collective) decoherence. Our results have immediate relevance to quantum computer implementations in which quantum logic is implemented through exchange interactions, such as the recently proposed spin-spin coupled quantum dot arrays and donor-atom arrays.

arXiv:quant-ph/9909058•Physical Review Letters•Aug 21, 2000•388 citations

One-way quantum computing in a decoherence-free subspace

Mark Tame, Mauro Paternostro, M S Kim

We introduce a novel scheme for one-way quantum computing (QC) based on the use of information encoded qubits in an effective cluster state resource. With the correct encoding structure, we show that it is possible to protect the entangled resource from phase damping decoherence, where the effective cluster state can be described as residing in a decoherence-free subspace (DFS) of its supporting quantum system. One-way QC then requires either single or two-qubit adaptive measurements. As an example where this proposal can be realized, we describe an optical lattice set-up where the scheme provides robust quantum information processing. We also outline how one can adapt the model to provide protection from other types of decoherence.

arXiv:0708.0969•New Journal of Physics•Jun 29, 2007•17 citations
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.
We present numerical simulation of a six-qubit quantum reservoir network with an output implemented on a 5-dimensional decoherence-free subspace (DFS), working as a classifier between entangled and product states of the input quantum system, fed to the reservoir during a finite learning time. Since the dynamics of DFS is not affected by external fluctuations, no cooling is required, and the proposed model seems a promising candidate for future quantum artificial intelligence systems working at room temperatures and free of huge energy consumption.
In a quantum computer, qubits are often stored in identical two-level systems separated by a distance shorter than the characteristic wavelength of the reservoirs that are responsible for decoherence. In this case the collective qubit-reservoir interaction, rather than the individual qubit-reservoir interaction, may determine the decoherence properties. We study the collective decoherence behavior in between each step in certain quantum algorithms and propose a simple alternative of implementing quantum algorithms using a quantum trajectory that is close to a decoherence-free subspace that avoids unstable Dicke's superradiant states and Schrödinger's cat state.
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.
It was shown recently [D. A. Lidar et al., Phys. Rev. Lett. 81, 2594 (1998)] that within the framework of the semigroup Markovian master equation, decoherence-free (DF) subspaces exist which are stable to first order in time to a perturbation. Here this result is extended to the non-Markovian regime and generalized. In particular, it is shown that within both the semigroup and the non-Markovian operator sum representation, DF subspaces are stable to all orders in time to a symmetry-breaking perturbation. DF subspaces are thus ideal for quantum memory applications. For quantum computation, however, the stability result does not extend beyond the first order. Thus, to perform robust quantum computation in DF subspaces, they must be supplemented with quantum error correcting codes.
A general scheme to perform universal, fault-tolerant quantum computation within decoherence-free subspaces (DFSs) is presented. At most two-qubit interactions are required, and the system remains within the DFS throughout the entire implementation of a quantum gate. We show explicitly how to perform universal computation on clusters of the four-qubit DFS encoding one logical qubit each under spatially symmetric (collective) decoherence. Our results have immediate relevance to quantum computer implementations in which quantum logic is implemented through exchange interactions, such as the recently proposed spin-spin coupled quantum dot arrays and donor-atom arrays.
We introduce a novel scheme for one-way quantum computing (QC) based on the use of information encoded qubits in an effective cluster state resource. With the correct encoding structure, we show that it is possible to protect the entangled resource from phase damping decoherence, where the effective cluster state can be described as residing in a decoherence-free subspace (DFS) of its supporting quantum system. One-way QC then requires either single or two-qubit adaptive measurements. As an example where this proposal can be realized, we describe an optical lattice set-up where the scheme provides robust quantum information processing. We also outline how one can adapt the model to provide protection from other types of decoherence.