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

Open Systems & Information Dynamics

Reducibility Criteria and a Construction Method for the Analysis of Open Quantum Systems

Takeo Kamizawa

Published Jun 1, 2019• 1 citation
Publisher

Abstract

The analysis of an open quantum system can be by far difficult if the dimension of the system Hilbert space is large or infinite. However, in some cases the dynamics on a finite-dimensional Hilbert space can be decomposed into a block-diagonal form, which simplifies the system structure. In this presentation, we will study several criteria for the complete reducibility and, in addition, a computational method for a basis of each simplified component to apply for the analysis of open quantum systems. An important point of these tools is that they are “effective” methods (one can complete the task in a finite number of steps).

DOI
10.1142/s1230161219500100

Related papers

Codebase release 1.0 for DanceQ

Robin Schäfer, David J. Luitz

The complexity of quantum many-body problems scales exponentially with the size of the system, rendering any finite-size scaling analysis a formidable challenge. This is particularly true for methods based on the full representation of the wave function, where one simply accepts the enormous Hilbert space dimensions and performs linear algebra operations, e.g., for finding the ground state of the Hamiltonian. If the system satisfies an underlying symmetry where an operator with a degenerate spectrum commutes with the Hamiltonian, it can be block-diagonalized, thus reducing the complexity at the expense of additional bookkeeping. At the most basic level required for Krylov space techniques (like the Lanczos algorithm), it is necessary to implement a matrix-vector product of a block of the Hamiltonian with arbitrary block-wavefunctions, potentially without holding the Hamiltonian block in memory. An efficient implementation of this operation requires the calculation of the position of an arbitrary basis vector in the canonical ordering of the basis of the block. We present here an elegant and powerful, multi-dimensional approach to this problem for the U(1) U ( 1 ) symmetry appearing in problems with particle number conservation. Our divide-and-conquer algorithm uses multiple subsystems and hence generalizes previous approaches to make them scalable. In addition to the theoretical presentation of our algorithm, we provide DanceQ, a flexible and modern – header only – C++20 implementation to manipulate, enumerate, and map to its index any basis state in a given particle number sector as open source software under https://DanceQ.gitlab.io/danceq.

arXiv:2407.14591•SciPost Physics Codebases•Feb 5, 2025•3 citations

COMPUTATIONAL REDUCIBILITY OF FINITE UNITARY QUANTUM SYSTEMS (technical note)

Materov

COMPUTATIONAL REDUCIBILITY OF FINITE UNITARY QUANTUM SYSTEMS (technical note). A Theory-Independent Result.

•Aug 10, 2026•2 citations

ELEMENTARY MATHEMATICAL FRAMEWORK FOR OPEN QUANTUM d-LEVEL SYSTEMS: DECOHERENCE OVERVIEW

Gen Kimura

This lecture note provides an easy introduction of the theory of open quantum systems in a physically and mathematically closed manner. After a compact review of quantum mechanics, we explain how to treat open quantum systems which turns out to explain the decoherence process. In order to be logically closed, we restrict to the finite quantum systems, but almost all the mathematical techniques are explained in detail so that the students can follow the equations and master the techniques which are usually assumed from the beginning. In particular, there are almost 90 exercises which supplement the contents to understand, and all the solutions will be uploaded in my web page .

•Nov 1, 2009•4 citations

Learning the eigenstructure of quantum dynamics using classical shadows

Atithi Acharya, Siddhartha Saha, Shagesh Sridharan +2 more

Learning dynamics from repeated observation of the time evolution of an open quantum system, namely, the problem of quantum process tomography is an important task. This task is difficult in general, but, with some additional constraints could be tractable. This motivates us to look at the problem of Lindblad operator discovery from observations. We point out that for moderate size Hilbert spaces, low Kraus rank of the channel, and short time steps, the eigenvalues of the Choi matrix corresponding to the channel have a special structure. We use the least-square method for the estimation of a channel where, for fixed inputs, we estimate the outputs by classical shadows. The resultant noisy estimate of the channel can then be denoised by diagonalizing the nominal Choi matrix, truncating some eigenvalues, and altering it to a genuine Choi matrix. This processed Choi matrix is then compared to the original one. We see that as the number of samples increases, our reconstruction becomes more accurate. We also use tools from random matrix theory to understand the effect of estimation noise in the eigenspectrum of the estimated Choi matrix.

arXiv:2309.12631•Sep 22, 2023•3 citations

On Some Algebraic Procedure for Block-Diagonal Decompositions of Open Dynamical Systems

Takeo Kamizawa

In this paper we study an application of a tool called the “discriminant of algebra”, which gives us an effective method to determine the complete reducibility of algebras. This tool can be applied to the analysis of open quantum systems and we study some examples of it.

Open Systems & Information Dynamics•Mar 1, 2017•2 citations

A construction of interacting Fock spaces derived from quantum decomposition and its applications (Infinite Dimensional Analysis and Quantum Probability Theory)

Yukihiro Hashimoto

数理解析研究所講究録•Aug 1, 2001•0 citations
The analysis of an open quantum system can be by far difficult if the dimension of the system Hilbert space is large or infinite. However, in some cases the dynamics on a finite-dimensional Hilbert space can be decomposed into a block-diagonal form, which simplifies the system structure. In this presentation, we will study several criteria for the complete reducibility and, in addition, a computational method for a basis of each simplified component to apply for the analysis of open quantum systems. An important point of these tools is that they are “effective” methods (one can complete the task in a finite number of steps).
The complexity of quantum many-body problems scales exponentially with the size of the system, rendering any finite-size scaling analysis a formidable challenge. This is particularly true for methods based on the full representation of the wave function, where one simply accepts the enormous Hilbert space dimensions and performs linear algebra operations, e.g., for finding the ground state of the Hamiltonian. If the system satisfies an underlying symmetry where an operator with a degenerate spectrum commutes with the Hamiltonian, it can be block-diagonalized, thus reducing the complexity at the expense of additional bookkeeping. At the most basic level required for Krylov space techniques (like the Lanczos algorithm), it is necessary to implement a matrix-vector product of a block of the Hamiltonian with arbitrary block-wavefunctions, potentially without holding the Hamiltonian block in memory. An efficient implementation of this operation requires the calculation of the position of an arbitrary basis vector in the canonical ordering of the basis of the block. We present here an elegant and powerful, multi-dimensional approach to this problem for the U(1) U ( 1 ) symmetry appearing in problems with particle number conservation. Our divide-and-conquer algorithm uses multiple subsystems and hence generalizes previous approaches to make them scalable. In addition to the theoretical presentation of our algorithm, we provide DanceQ, a flexible and modern – header only – C++20 implementation to manipulate, enumerate, and map to its index any basis state in a given particle number sector as open source software under https://DanceQ.gitlab.io/danceq.
This lecture note provides an easy introduction of the theory of open quantum systems in a physically and mathematically closed manner. After a compact review of quantum mechanics, we explain how to treat open quantum systems which turns out to explain the decoherence process. In order to be logically closed, we restrict to the finite quantum systems, but almost all the mathematical techniques are explained in detail so that the students can follow the equations and master the techniques which are usually assumed from the beginning. In particular, there are almost 90 exercises which supplement the contents to understand, and all the solutions will be uploaded in my web page .
Learning dynamics from repeated observation of the time evolution of an open quantum system, namely, the problem of quantum process tomography is an important task. This task is difficult in general, but, with some additional constraints could be tractable. This motivates us to look at the problem of Lindblad operator discovery from observations. We point out that for moderate size Hilbert spaces, low Kraus rank of the channel, and short time steps, the eigenvalues of the Choi matrix corresponding to the channel have a special structure. We use the least-square method for the estimation of a channel where, for fixed inputs, we estimate the outputs by classical shadows. The resultant noisy estimate of the channel can then be denoised by diagonalizing the nominal Choi matrix, truncating some eigenvalues, and altering it to a genuine Choi matrix. This processed Choi matrix is then compared to the original one. We see that as the number of samples increases, our reconstruction becomes more accurate. We also use tools from random matrix theory to understand the effect of estimation noise in the eigenspectrum of the estimated Choi matrix.