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

A Markov–Dobrushin Inequality for Quantum Channels

Luigi Accardi, Yun Gang Lu, Abdessatar Souissi

Published Dec 1, 2021• 12 citations
Publisher

Abstract

We propose a quantum extension of the Markov-Dobrushin inequality. As an application, we estimate the Markov-Dobrushin constant for some classes of quantum Markov channels, in particular for the Pauli channel, widely studied in quantum information theory.
DOI
10.1142/s1230161221500189

Related papers

MARKOV PROPERTY – RECENT DEVELOPMENTS ON THE QUANTUM MARKOV PROPERTY

Luigi Accardi, Francesco Fidaleo

We review recent developments in the theory of quantum Markov states on the \nstandard \n$\\bz^{d}$--spin lattice. A Dobrushin theory for quantum Markov fields \nis proposed. In the \none--di\\-men\\-sional case where the order plays a crucial role, the \nstructure arising from a quantum Markov state is fully understood. In \nthis situation we obtain a splitting of a Markov state into a classical \npart, and a purely quantum part. This result allows us to provide a \nreconstruction theorem for quantum Markov states on chains

Quantum Probability and Infinite Dimensional Analysis•Jan 1, 2003•2 citations

Efficient Estimation of Pauli Channels

Steven T. Flammia, Joel J. Wallman

Pauli channels are ubiquitous in quantum information, both as a dominant noise source in many computing architectures and as a practical model for analyzing error correction and fault tolerance. Here, we prove several results on efficiently learning Pauli channels and more generally the Pauli projection of a quantum channel. We first derive a procedure for learning a Pauli channel on n qubits with high probability to a relative precision ϵ using O (ϵ -2 n2 n ) measurements, which is efficient in the Hilbert space dimension. The estimate is robust to state preparation and measurement errors, which, together with the relative precision, makes it especially appropriate for applications involving characterization of high-accuracy quantum gates. Next, we show that the error rates for an arbitrary set of s Pauli errors can be estimated to a relative precision ϵ using O (ϵ -4 log s log s/ϵ) measurements. Finally, we show that when the Pauli channel is given by a Markov field with at most k -local correlations, we can learn an entire n -qubit Pauli channel to relative precision ϵ with only O k (ϵ -2 n 2 log n ) measurements, which is efficient in the number of qubits. These results enable a host of applications beyond just characterizing noise in a large-scale quantum system: they pave the way to tailoring quantum codes, optimizing decoders, and customizing fault tolerance procedures to suit a particular device.

arXiv:1907.12976•ACM Transactions on Quantum Computing•Dec 7, 2020•180 citations

Quantum Capacities and Entropy Production of Quantum Markov Chains

Alexander Müller‐Hermes

A basic question in quantum information theory is to quantify the optimal rate of transmitting quantum information via a given quantum channel using certain coding schemes. We study this question for discrete- and continuous-time quantum Markov processes. For continuous-time processes modeling a quantum memory we introduce new capacities where coding channels may be applied during the storage time. We prove upper bounds on these quantities by studying the entropy production of quantum Markov processes.

•Jan 1, 2015•0 citations

Quantum Markov monogamy inequalities

Matheus Capela, Lucas C. Céleri, Rafael Chaves +1 more

Markovianity lies at the heart of communication problems. This in turn makes the information-theoretic characterization of Markov processes worthwhile. Data-processing inequalities are ubiquitous in this sense, assigning necessary conditions for all Markov processes. We address here the problem of the information-theoretic analysis of constraints on Markov processes in the quantum regime. We show the existence of a class of quantum data-processing inequalities called here quantum Markov monogamy inequalities. This class of necessary conditions on quantum Markov processes is inspired by its counterpart for classical Markov processes, thus providing a strong link between classical and quantum constraints on Markovianity. We go on to construct a family of multitime quantum Markov monogamy inequalities, based on the process tensor formalism and that exploits multitime correlations. We then show, by means of an explicit example, that the Markov monogamy inequalities can be stronger than the usual quantum data-processing inequalities.

arXiv:2108.11533•Physical Review A•Aug 29, 2022•8 citations

An application of a matrix inequality in quantum information theory

Christopher King

Quantum information theory has generated several interesting conjectures involving products of completely positive maps on matrix algebras, also known as quantum channels. In particular it is conjectured that the output state with maximal p-norm from a product channel is always a product state. It is shown here that the Lieb-Thirring inequality can be used to prove this conjecture for one special case, namely when one of the components of the product channel is of the type known as a diagonal channel, which acts on a state by taking the Hadamard product with a positive matrix.

arXiv:quant-ph/0412046•Dec 6, 2004•20 citations

Desigualdade de Markov-Dobrushin para canais quânticos

Ávila, Marcelo Reinaldo de

Neste trabalho, revisamos o artigo de L. Accardi, Y. G. Lu e A. Souissi no qual a desigualdade de Markov-Dobrushin é estendida para canais quânticos, e exploramos sua aplicação no contexto das cadeias de Markov quânticas, definidas por S. Gudder, sobre grafos finitos. Na desigualdade obtida, é necessário determinar o ínfimo de uma família de operadores, através do qual se obtém uma versão quântica da constante de Markov-Dobrushin. Estudamos exemplos cuja constante fosse não nula, obtendo-se em particular resultados para QMCs definidas por matrizes de Pauli.

•Jan 1, 2025•0 citations
We review recent developments in the theory of quantum Markov states on the \nstandard \nbzd\\bz^{d}bzd--spin lattice. A Dobrushin theory for quantum Markov fields \nis proposed. In the \none--di\\-men\\-sional case where the order plays a crucial role, the \nstructure arising from a quantum Markov state is fully understood. In \nthis situation we obtain a splitting of a Markov state into a classical \npart, and a purely quantum part. This result allows us to provide a \nreconstruction theorem for quantum Markov states on chains
Pauli channels are ubiquitous in quantum information, both as a dominant noise source in many computing architectures and as a practical model for analyzing error correction and fault tolerance. Here, we prove several results on efficiently learning Pauli channels and more generally the Pauli projection of a quantum channel. We first derive a procedure for learning a Pauli channel on n qubits with high probability to a relative precision ϵ using O (ϵ -2 n2 n ) measurements, which is efficient in the Hilbert space dimension. The estimate is robust to state preparation and measurement errors, which, together with the relative precision, makes it especially appropriate for applications involving characterization of high-accuracy quantum gates. Next, we show that the error rates for an arbitrary set of s Pauli errors can be estimated to a relative precision ϵ using O (ϵ -4 log s log s/ϵ) measurements. Finally, we show that when the Pauli channel is given by a Markov field with at most k -local correlations, we can learn an entire n -qubit Pauli channel to relative precision ϵ with only O k (ϵ -2 n 2 log n ) measurements, which is efficient in the number of qubits. These results enable a host of applications beyond just characterizing noise in a large-scale quantum system: they pave the way to tailoring quantum codes, optimizing decoders, and customizing fault tolerance procedures to suit a particular device.
A basic question in quantum information theory is to quantify the optimal rate of transmitting quantum information via a given quantum channel using certain coding schemes. We study this question for discrete- and continuous-time quantum Markov processes. For continuous-time processes modeling a quantum memory we introduce new capacities where coding channels may be applied during the storage time. We prove upper bounds on these quantities by studying the entropy production of quantum Markov processes.
Markovianity lies at the heart of communication problems. This in turn makes the information-theoretic characterization of Markov processes worthwhile. Data-processing inequalities are ubiquitous in this sense, assigning necessary conditions for all Markov processes. We address here the problem of the information-theoretic analysis of constraints on Markov processes in the quantum regime. We show the existence of a class of quantum data-processing inequalities called here quantum Markov monogamy inequalities. This class of necessary conditions on quantum Markov processes is inspired by its counterpart for classical Markov processes, thus providing a strong link between classical and quantum constraints on Markovianity. We go on to construct a family of multitime quantum Markov monogamy inequalities, based on the process tensor formalism and that exploits multitime correlations. We then show, by means of an explicit example, that the Markov monogamy inequalities can be stronger than the usual quantum data-processing inequalities.
Quantum information theory has generated several interesting conjectures involving products of completely positive maps on matrix algebras, also known as quantum channels. In particular it is conjectured that the output state with maximal p-norm from a product channel is always a product state. It is shown here that the Lieb-Thirring inequality can be used to prove this conjecture for one special case, namely when one of the components of the product channel is of the type known as a diagonal channel, which acts on a state by taking the Hadamard product with a positive matrix.
Neste trabalho, revisamos o artigo de L. Accardi, Y. G. Lu e A. Souissi no qual a desigualdade de Markov-Dobrushin é estendida para canais quânticos, e exploramos sua aplicação no contexto das cadeias de Markov quânticas, definidas por S. Gudder, sobre grafos finitos. Na desigualdade obtida, é necessário determinar o ínfimo de uma família de operadores, através do qual se obtém uma versão quântica da constante de Markov-Dobrushin. Estudamos exemplos cuja constante fosse não nula, obtendo-se em particular resultados para QMCs definidas por matrizes de Pauli.