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

Quantum Approximate Markov Chains and the Locality of Entanglement Spectrum

Fernando G. S. L. Brandão

Published Oct 11, 2016• 0 citations
OpenAlex

Related papers

Approximate Quantum Markov Chains

David Sutter

SpringerBriefs in mathematical physics•Jan 1, 2018•38 citations

Approximate Quantum Markov Chains

David Sutter

arXiv:1802.05477•SpringerBriefs in mathematical physics•Jan 1, 2018•29 citations

Quantum Approximate Markov Chains are Thermal

Kohtaro Kato, Fernando G. S. L. Brandão

arXiv:1609.06636•Communications in Mathematical Physics•Jun 21, 2019•79 citations

On Entangled Markov Chains (Non-Commutative Analysis and Micro-Macro Duality)

Luigi Accardi, Takashi Matsuoka, Masanori Ohya

Entangled Markov chains, which can be recognized as quantum Markov chains in the sense of $[1|$ , were $inti^{\vee}oduced$ by Accardi and Fidaleo in order to extend the notion of classical random walk to quaritum systems.In [3], using our entanglement criterion for pure states [16] which is based on the notion of the quantum mutual information, we proved that the vector states defining the EMC's on infinite tensor products of matrix algebra $||generically^{I\dagger}$ are entangled.On the other hand we showed that this entanglement condition for pure state is sufficient condition for entanglement in the case of mixtures [4].This fact was then applied to prove that EMC with unitarily im- plementable transition operator induce a mixture entangled state on any local algebra.Interestingly it was also shown that all these local states provide a new class of examples (in any dimension) of entangled states which nevertheless satisfy the PPT condition [4].In this article we report the above results.

•Jul 1, 2008•0 citations

Quantum Conditional Mutual Information and Approximate Markov Chains

Omar Fawzi, Renato Renner

A state on a tripartite quantum system $${A \otimes B \otimes C}$$ forms a Markov chain if it can be reconstructed from its marginal on $${A \otimes B}$$ by a quantum operation from B to $${B \otimes C}$$ . We show that the quantum conditional mutual information I(A : C|B) of an arbitrary state is an upper bound on its distance to the closest reconstructed state. It thus quantifies how well the Markov chain property is approximated.

arXiv:1410.0664•Communications in Mathematical Physics•Sep 9, 2015•297 citations

Decoherence in quantum Markov chains

Raqueline A. M. Santos, Renato Portugal, Marcelo Dutra Fragoso

arXiv:1204.6238•Quantum Information Processing•Nov 11, 2013•7 citations
Entangled Markov chains, which can be recognized as quantum Markov chains in the sense of [1∣[1|[1∣ , were inti∨oducedinti^{\vee}oducedinti∨oduced by Accardi and Fidaleo in order to extend the notion of classical random walk to quaritum systems.In [3], using our entanglement criterion for pure states [16] which is based on the notion of the quantum mutual information, we proved that the vector states defining the EMC's on infinite tensor products of matrix algebra ∣∣genericallyI†||generically^{I\dagger}∣∣genericallyI† are entangled.On the other hand we showed that this entanglement condition for pure state is sufficient condition for entanglement in the case of mixtures [4].This fact was then applied to prove that EMC with unitarily im- plementable transition operator induce a mixture entangled state on any local algebra.Interestingly it was also shown that all these local states provide a new class of examples (in any dimension) of entangled states which nevertheless satisfy the PPT condition [4].In this article we report the above results.
A state on a tripartite quantum system A⊗B⊗C{A \otimes B \otimes C}A⊗B⊗C forms a Markov chain if it can be reconstructed from its marginal on A⊗B{A \otimes B}A⊗B by a quantum operation from B to B⊗C{B \otimes C}B⊗C . We show that the quantum conditional mutual information I(A : C|B) of an arbitrary state is an upper bound on its distance to the closest reconstructed state. It thus quantifies how well the Markov chain property is approximated.