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

Bulletin of the American Physical Society

Finding decoherence-free subspaces numerically

Purva Thakre, Mark Byrd

Published Mar 8, 2018• 0 citations
OpenAlex

Related papers

Criteria for dynamically stable decoherence-free subspaces

Raisa I. Karasik, Karl-Peter Marzlin, Barry C. Sanders +1 more

Bulletin of the American Physical Society•Feb 26, 2007•1 citation

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

Driving quantum systems into decoherence-free subspaces by Lyapunov control

X. X. Yi, X. L. Huang, Chunfeng Wu +1 more

We present a scheme to drive a finite-dimensional quantum system into the decoherence-free subspaces (DFS) by Lyapunov control. Control fields are established by Lyapunov function. This proposal works well for both closed and open quantum systems, with replacing the DFS by desired subspaces for closed systems. An example which consists of a four-level system with three degenerate states driven by three lasers is presented to gain further insight on the scheme. Numerical simulations for the dynamics of the system are performed and the results are good.

arXiv:0908.1048•Physical Review A•Nov 12, 2009•90 citations

Decoherence-Free Subspaces and Subsystems

Daniel A. Lidar, K. Birgitta Whaley

arXiv:quant-ph/0301032•Lecture notes in physics•Jan 1, 2003•294 citations

Theory of initialization-free decoherence-free subspaces and subsystems

Alireza Shabani, Daniel A. Lidar

We introduce a generalized theory of decoherence-free subspaces and subsystems (DFSs), which do not require accurate initialization. We derive a set of conditions for the existence of DFSs within this generalized framework. By relaxing the initialization requirement we show that a DFS can tolerate arbitrarily large preparation errors. This has potentially significant implications for experiments involving DFSs, in particular for the experimental implementation, over DFSs, of the large class of quantum algorithms which can function with arbitrary input states.

arXiv:quant-ph/0505051•Physical Review A•Oct 3, 2005•101 citations

Decoherence-free subspaces and incoherently generated coherences

Raisa I. Karasik, Karl-Peter Marzlin, Barry C. Sanders +1 more

Bulletin of the American Physical Society•Mar 13, 2008•0 citations
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.
We present a scheme to drive a finite-dimensional quantum system into the decoherence-free subspaces (DFS) by Lyapunov control. Control fields are established by Lyapunov function. This proposal works well for both closed and open quantum systems, with replacing the DFS by desired subspaces for closed systems. An example which consists of a four-level system with three degenerate states driven by three lasers is presented to gain further insight on the scheme. Numerical simulations for the dynamics of the system are performed and the results are good.
We introduce a generalized theory of decoherence-free subspaces and subsystems (DFSs), which do not require accurate initialization. We derive a set of conditions for the existence of DFSs within this generalized framework. By relaxing the initialization requirement we show that a DFS can tolerate arbitrarily large preparation errors. This has potentially significant implications for experiments involving DFSs, in particular for the experimental implementation, over DFSs, of the large class of quantum algorithms which can function with arbitrary input states.