REVIEW 1 cited by
Numerical method for finding decoherence-free subspaces and its applications
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original 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 one, and it is more efficient than the algorithm proposed by Holbrook, Kribs, and Laflamme [Quant. 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.
Forward citations
Cited by 1 Pith paper
-
Quantum Wall States for Noise Mitigation and Eternal Purity Bounds
A controlled wall subsystem can act as a barrier that suppresses decoherence of a logical quantum register, with a purity bound that can be held near one for all times under strong driving and Hamiltonian-only dynamics.
Discussion (0). Continue with ORCID to comment.