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

Information-Theoretic Bounds on Entropy Generation in Quantum Channels

Tibor Svoboda, Milos Bartos, Igor Novotny

Published Dec 13, 2022• 0 citations
Publisher

Abstract

Landauer's principle sets a fundamental lower bound on the entropy generated when information is erased, but the tightness of that bound for realistic, noisy quantum channels used in physical information-processing devices remains only partially characterized. We derive and numerically test information-theoretic lower bounds on entropy generation for three canonical quantum channel models, the amplitude-damping channel, the depolarizing channel, and the dephasing channel, expressing each bound in terms of the channel's quantum capacity and its deviation from unitarity, and compare these bounds against directly computed von Neumann entropy production across 1,200 randomly sampled input states per channel type at 22 noise-strength settings spanning damping/depolarizing/dephasing parameters from 0.02 to 0.90. Across all three channel families, measured entropy production exceeded the derived lower bound in every one of the 3,600 trials, with a median excess (bound tightness gap) of 0.087 bits and an interquartile range of 0.041 to 0.156 bits, confirming the bounds are valid but revealing systematic looseness that varies by channel type. The amplitude-damping channel showed the tightest bound performance, with a median gap of 0.052 bits at low-to-moderate damping strength (gamma < 0.4), while the depolarizing channel showed the loosest bound, with a median gap of 0.134 bits across the full noise range, a 2.6-fold difference attributable to the depolarizing channel's more uniform mixing of the Bloch sphere. Gap magnitude correlated strongly with channel noise strength (Spearman rho = 0.81, p < 0.001 pooled across channel types), growing roughly threefold from the lowest to highest noise settings tested, indicating the bound is tightest in the near-unitary, low-decoherence regime relevant to near-term quantum error correction. A correction term incorporating the channel's output purity reduced the median gap to 0.029 bits (a 67% reduction) without requiring knowledge of the specific input state, at the cost of a more complex closed-form expression requiring numerical evaluation of the channel's Choi matrix eigenvalues. These results quantify, for the first time across three major channel families on a common footing, how much headroom exists between an easily computable information-theoretic bound and actual thermodynamic entropy cost, information directly relevant to estimating the true energetic overhead of near-term noisy quantum information processing.

DOI
10.5281/zenodo.22698356

Related papers

Variational estimation of capacity bounds for quantum channels

Junaid ur Rehman, Seongjin Hong, Yong‐Su Kim +1 more

We propose a framework to variationally obtain detectable capacity bounds for quantum channels. The proposal of this framework is motivated by the difficulty of estimating the von Neumann entropy of an unknown quantum state. Instead of estimating the von Neumann entropy at the channel output, we propose to estimate the state purity---which can be measured by a single measurement setting---followed by bounding the von Neumann entropy from above and below. This procedure leads to new upper and lower bounds on various communication rates of quantum channels for some fixed input states. Then, by utilizing the variational method to find optimal input states we obtain lower bounds on (i) the quantum capacity of arbitrary channels, (ii) the entanglement-assisted classical capacity of arbitrary channels, and (iii) the classical capacity of covariant channels. Corresponding to these lower bounds, we also obtain upper bounds on (i) $N$-shot coherent information, (ii) the entanglement-assisted classical capacity, and (iii) the $N$-shot Holevo capacity of arbitrary quantum channels. All these bounds can be estimated by a single measurement setting without needing a full process tomography or any further a priori knowledge, e.g., preferred basis of the channel.

Physical Review A•Mar 28, 2022•5 citations

Entanglement-Coupling Precursors of Decoherence in Quantum Circuits: A Heuristic Information-Theoretic Precursor Framework (KA-Quantum)

Hikmat Karimov, Rahid Zahid Alekberli

Decoherence is the primary obstacle to reliable quantum computing, yet real-time, measurement-driven early warning remains unavailable. Standard metrics (fidelity, entanglement entropy) are computed post-hoc or require full state tomography. We propose KA-Quantum, a thermodynamic early warning framework grounded in the Karimov–Alekberli (KA) causal entropy formalism [1], monitoring three quantum channels: C1 (von Neumann entropy deviation), C2 (bipartite correlation entropy coupling decay), and C3 (fidelity residual). Using Qiskit Aer density-matrix simulation [2] of N=5 qubit circuits across three circuit classes (GHZ, random, variational) and three noise models (amplitude damping, phase damping, depolarizing; 30 Monte Carlo runs each, linearly increasing noise ramp), we find: 5 of 9 configurations achieve DR = 100% (30/30); overall DR = 56% (150/270) including physically non-decaying regimes where the specific noise type does not drive fidelity below the 0.9 threshold within the simulation window. FPR = 0.00 in all calibration periods. Median lead times of 1–15 gate cycles (F < 0.9); lead time is invariant to KA threshold θ (2.0/2.5/3.0 tested), confirming empirical threshold invariance [3]. The C2 entanglement channel provides the earliest indicator, consistent with the structural coupling precursor that distinguishes KA across prior KA classical applications [4].

•May 12, 2026•0 citations

Relating Entropies of Quantum Channels

Dariusz Kurzyk, Łukasz Pawela, Zbigniew Puchała

In this work, we study two different approaches to defining the entropy of a quantum channel. One of these is based on the von Neumann entropy of the corresponding Choi-Jamiołkowski state. The second one is based on the relative entropy of the output of the extended channel relative to the output of the extended completely depolarizing channel. This entropy then needs to be optimized over all possible input states. Our results first show that the former entropy provides an upper bound on the latter. Next, we show that for unital qubit channels, this bound is saturated. Finally, we conjecture and provide numerical intuitions that the bound can also be saturated for random channels as their dimension tends to infinity.

arXiv:2106.09629•Entropy•Aug 10, 2021•3 citations

Transmitting Quantum Information Reliably across Various Quantum Channels

Yingkai Ouyang

Transmitting quantum information across quantum channels is an important task. However quantum information is delicate, and is easily corrupted. We address the task of protecting quantum information from an information theoretic perspective -- we encode some message qudits into a quantum code, send the encoded quantum information across the noisy quantum channel, then recover the message qudits by decoding. In this dissertation, we discuss the coding problem from several perspectives.} \n \nThe noisy quantum channel is one of the central aspects of the quantum coding problem, and hence quantifying the noisy quantum channel from the physical model is an important problem. \nWe work with an explicit physical model -- a pair of initially decoupled quantum harmonic oscillators interacting with a spring-like coupling, where the bath oscillator is initially in a thermal-like state. In particular, we treat the completely positive and trace preserving map on the system as a quantum channel, and study the truncation of the channel by truncating its Kraus set. We thereby derive the matrix elements of the Choi-Jamiolkowski operator of the corresponding truncated channel, which are truncated transition amplitudes. Finally, we give a computable approximation for these truncated transition amplitudes with explicit error bounds, and perform a case study of the oscillators in the off-resonant and weakly-coupled regime numerically. \n \nIn the context of truncated noisy channels, we revisit the notion of approximate error correction of finite dimension codes. We derive a computationally simple lower bound on the worst case entanglement fidelity of a quantum code, when the truncated recovery map of Leung et. al. is rescaled. As an application, we apply our bound to construct a family of multi-error correcting amplitude damping codes that are permutation-invariant. This demonstrates an explicit example where the specific structure of the noisy channel allows code design out of the stabilizer formalism via purely algebraic means. \n \nWe study lower bounds on the quantum capacity of adversarial channels, where we restrict the selection of quantum codes to the set of concatenated quantum codes. \nThe adversarial channel is a quantum channel where an adversary corrupts a fixed fraction of qudits sent across a quantum channel in the most malicious way possible. The best known rates of communicating over adversarial channels are given by the quantum Gilbert-Varshamov (GV) bound, that is known to be attainable with random quantum codes. We generalize the classical result of Thommesen to the quantum case, thereby demonstrating the existence of concatenated quantum codes that can asymptotically attain the quantum GV bound. The outer codes are quantum generalized Reed-Solomon codes, and the inner codes are random independently chosen stabilizer codes, where the rates of the inner and outer codes lie in a specified feasible region. \n \nWe next study upper bounds on the quantum capacity of some low dimension quantum channels. \nThe quantum capacity of a quantum channel is the maximum rate at which quantum information can be transmitted reliably across it, given arbitrarily many uses of it. While it is known that random quantum codes can be used to attain the quantum capacity, the quantum capacity of many classes of channels is undetermined, even for channels of low input and output dimension. For example, depolarizing channels are \n important quantum channels, but do not have tight numerical bounds. \nWe obtain upper bounds on the quantum capacity of some unital and non-unital channels \n -- two-qubit Pauli channels, two-qubit depolarizing channels, two-qubit locally symmetric channels, \n shifted qubit depolarizing channels, and shifted two-qubit Pauli channels -- \n using the coherent information of some degradable channels. We use the notion \n of twirling quantum channels, and Smith and Smolin's method of constructing \n degradable extensions of quantum channels extensively. The degradable channels we \n introduce, study and use are two-qubit amplitude damping channels. Exploiting the \n notion of covariant quantum channels, we give sufficient conditions for the quantum \n capacity of a degradable channel to be the optimal value of a concave program with \n linear constraints, and show that our two-qubit degradable amplitude damping channels have this property.

•May 1, 2013•1 citation

Information Fragility or Robustness Under Quantum Channels

Nicholas D. LaRacuente, Graeme Smith

Abstract Information stored in quantum states naturally decays under noise. Many earlier works have quantified and demonstrated lower bounds on decay rates of quantum relative entropy, showing exponential decay in a wide variety of contexts. Here we study the converse question: are there uniform upper bounds on the ratio of post-noise to initial information when noise is sufficiently weak? In several scenarios, including when a quantum channel induces decay of relative entropy to its own fixed point, we find such multiplicative converse bounds. However, there are other cases in which the ratio can fall by an arbitrary extent. Even for simple noise such as qubit dephasing or depolarizing, mutual information may fall by an unbounded factor under arbitrarily weak noise. As an application, we find families of channels with non-zero private capacity despite arbitrarily high probability of transmitting an arbitrarily good copy of the input to the environment.

arXiv:2312.17450•Communications in Mathematical Physics•Sep 27, 2026•7 citations

Quantum Fisher Information under decoherence with explicit wavefunctions

Francesco Musso, Vittorio Vitale, Sara Murciano

We present a method to estimate the quantum Fisher information (QFI) of many-body quantum states in the presence of decoherence, where its direct evaluation requires the full spectral resolution of the density matrix. We show that, for many-body wave functions known analytically in the occupation-number basis, systematic lower bounds to the QFI can be mapped onto expectation values over a classical probability distribution defined by the wave function amplitudes. This mapping enables efficient estimation via Markov-chain Monte Carlo sampling, with a computational cost that scales as a `slow' exponential ($e^{b L}$ with $b \lesssim 0.6$) and remains manageable for system sizes well beyond exact diagonalization. We specify this framework to Jastrow-Gutzwiller wave functions. We characterize their metrological content by identifying the observables that maximize the QFI and the corresponding scaling with $L$. Then, we analyze the QFI under three physically motivated noise channels: local dephasing, local amplitude damping, and global depolarizing. We compare polynomial and Krylov-based lower bounds across these channels, relating their behavior to the effective rank of the noisy density matrix and to the structure of the operator generating the parameter encoding. The framework extends naturally to other analytically known wave functions and to a broader class of information-theoretic quantities beyond the QFI.

quant-pharXiv:2605.22917•May 25, 2026•2 citations
Landauer's principle sets a fundamental lower bound on the entropy generated when information is erased, but the tightness of that bound for realistic, noisy quantum channels used in physical information-processing devices remains only partially characterized. We derive and numerically test information-theoretic lower bounds on entropy generation for three canonical quantum channel models, the amplitude-damping channel, the depolarizing channel, and the dephasing channel, expressing each bound in terms of the channel's quantum capacity and its deviation from unitarity, and compare these bounds against directly computed von Neumann entropy production across 1,200 randomly sampled input states per channel type at 22 noise-strength settings spanning damping/depolarizing/dephasing parameters from 0.02 to 0.90. Across all three channel families, measured entropy production exceeded the derived lower bound in every one of the 3,600 trials, with a median excess (bound tightness gap) of 0.087 bits and an interquartile range of 0.041 to 0.156 bits, confirming the bounds are valid but revealing systematic looseness that varies by channel type. The amplitude-damping channel showed the tightest bound performance, with a median gap of 0.052 bits at low-to-moderate damping strength (gamma < 0.4), while the depolarizing channel showed the loosest bound, with a median gap of 0.134 bits across the full noise range, a 2.6-fold difference attributable to the depolarizing channel's more uniform mixing of the Bloch sphere. Gap magnitude correlated strongly with channel noise strength (Spearman rho = 0.81, p < 0.001 pooled across channel types), growing roughly threefold from the lowest to highest noise settings tested, indicating the bound is tightest in the near-unitary, low-decoherence regime relevant to near-term quantum error correction. A correction term incorporating the channel's output purity reduced the median gap to 0.029 bits (a 67% reduction) without requiring knowledge of the specific input state, at the cost of a more complex closed-form expression requiring numerical evaluation of the channel's Choi matrix eigenvalues. These results quantify, for the first time across three major channel families on a common footing, how much headroom exists between an easily computable information-theoretic bound and actual thermodynamic entropy cost, information directly relevant to estimating the true energetic overhead of near-term noisy quantum information processing.
We propose a framework to variationally obtain detectable capacity bounds for quantum channels. The proposal of this framework is motivated by the difficulty of estimating the von Neumann entropy of an unknown quantum state. Instead of estimating the von Neumann entropy at the channel output, we propose to estimate the state purity---which can be measured by a single measurement setting---followed by bounding the von Neumann entropy from above and below. This procedure leads to new upper and lower bounds on various communication rates of quantum channels for some fixed input states. Then, by utilizing the variational method to find optimal input states we obtain lower bounds on (i) the quantum capacity of arbitrary channels, (ii) the entanglement-assisted classical capacity of arbitrary channels, and (iii) the classical capacity of covariant channels. Corresponding to these lower bounds, we also obtain upper bounds on (i) NNN-shot coherent information, (ii) the entanglement-assisted classical capacity, and (iii) the NNN-shot Holevo capacity of arbitrary quantum channels. All these bounds can be estimated by a single measurement setting without needing a full process tomography or any further a priori knowledge, e.g., preferred basis of the channel.
Decoherence is the primary obstacle to reliable quantum computing, yet real-time, measurement-driven early warning remains unavailable. Standard metrics (fidelity, entanglement entropy) are computed post-hoc or require full state tomography. We propose KA-Quantum, a thermodynamic early warning framework grounded in the Karimov–Alekberli (KA) causal entropy formalism [1], monitoring three quantum channels: C1 (von Neumann entropy deviation), C2 (bipartite correlation entropy coupling decay), and C3 (fidelity residual). Using Qiskit Aer density-matrix simulation [2] of N=5 qubit circuits across three circuit classes (GHZ, random, variational) and three noise models (amplitude damping, phase damping, depolarizing; 30 Monte Carlo runs each, linearly increasing noise ramp), we find: 5 of 9 configurations achieve DR = 100% (30/30); overall DR = 56% (150/270) including physically non-decaying regimes where the specific noise type does not drive fidelity below the 0.9 threshold within the simulation window. FPR = 0.00 in all calibration periods. Median lead times of 1–15 gate cycles (F < 0.9); lead time is invariant to KA threshold θ (2.0/2.5/3.0 tested), confirming empirical threshold invariance [3]. The C2 entanglement channel provides the earliest indicator, consistent with the structural coupling precursor that distinguishes KA across prior KA classical applications [4].
In this work, we study two different approaches to defining the entropy of a quantum channel. One of these is based on the von Neumann entropy of the corresponding Choi-Jamiołkowski state. The second one is based on the relative entropy of the output of the extended channel relative to the output of the extended completely depolarizing channel. This entropy then needs to be optimized over all possible input states. Our results first show that the former entropy provides an upper bound on the latter. Next, we show that for unital qubit channels, this bound is saturated. Finally, we conjecture and provide numerical intuitions that the bound can also be saturated for random channels as their dimension tends to infinity.
Transmitting quantum information across quantum channels is an important task. However quantum information is delicate, and is easily corrupted. We address the task of protecting quantum information from an information theoretic perspective -- we encode some message qudits into a quantum code, send the encoded quantum information across the noisy quantum channel, then recover the message qudits by decoding. In this dissertation, we discuss the coding problem from several perspectives.} \n \nThe noisy quantum channel is one of the central aspects of the quantum coding problem, and hence quantifying the noisy quantum channel from the physical model is an important problem. \nWe work with an explicit physical model -- a pair of initially decoupled quantum harmonic oscillators interacting with a spring-like coupling, where the bath oscillator is initially in a thermal-like state. In particular, we treat the completely positive and trace preserving map on the system as a quantum channel, and study the truncation of the channel by truncating its Kraus set. We thereby derive the matrix elements of the Choi-Jamiolkowski operator of the corresponding truncated channel, which are truncated transition amplitudes. Finally, we give a computable approximation for these truncated transition amplitudes with explicit error bounds, and perform a case study of the oscillators in the off-resonant and weakly-coupled regime numerically. \n \nIn the context of truncated noisy channels, we revisit the notion of approximate error correction of finite dimension codes. We derive a computationally simple lower bound on the worst case entanglement fidelity of a quantum code, when the truncated recovery map of Leung et. al. is rescaled. As an application, we apply our bound to construct a family of multi-error correcting amplitude damping codes that are permutation-invariant. This demonstrates an explicit example where the specific structure of the noisy channel allows code design out of the stabilizer formalism via purely algebraic means. \n \nWe study lower bounds on the quantum capacity of adversarial channels, where we restrict the selection of quantum codes to the set of concatenated quantum codes. \nThe adversarial channel is a quantum channel where an adversary corrupts a fixed fraction of qudits sent across a quantum channel in the most malicious way possible. The best known rates of communicating over adversarial channels are given by the quantum Gilbert-Varshamov (GV) bound, that is known to be attainable with random quantum codes. We generalize the classical result of Thommesen to the quantum case, thereby demonstrating the existence of concatenated quantum codes that can asymptotically attain the quantum GV bound. The outer codes are quantum generalized Reed-Solomon codes, and the inner codes are random independently chosen stabilizer codes, where the rates of the inner and outer codes lie in a specified feasible region. \n \nWe next study upper bounds on the quantum capacity of some low dimension quantum channels. \nThe quantum capacity of a quantum channel is the maximum rate at which quantum information can be transmitted reliably across it, given arbitrarily many uses of it. While it is known that random quantum codes can be used to attain the quantum capacity, the quantum capacity of many classes of channels is undetermined, even for channels of low input and output dimension. For example, depolarizing channels are \n important quantum channels, but do not have tight numerical bounds. \nWe obtain upper bounds on the quantum capacity of some unital and non-unital channels \n -- two-qubit Pauli channels, two-qubit depolarizing channels, two-qubit locally symmetric channels, \n shifted qubit depolarizing channels, and shifted two-qubit Pauli channels -- \n using the coherent information of some degradable channels. We use the notion \n of twirling quantum channels, and Smith and Smolin's method of constructing \n degradable extensions of quantum channels extensively. The degradable channels we \n introduce, study and use are two-qubit amplitude damping channels. Exploiting the \n notion of covariant quantum channels, we give sufficient conditions for the quantum \n capacity of a degradable channel to be the optimal value of a concave program with \n linear constraints, and show that our two-qubit degradable amplitude damping channels have this property.
Abstract Information stored in quantum states naturally decays under noise. Many earlier works have quantified and demonstrated lower bounds on decay rates of quantum relative entropy, showing exponential decay in a wide variety of contexts. Here we study the converse question: are there uniform upper bounds on the ratio of post-noise to initial information when noise is sufficiently weak? In several scenarios, including when a quantum channel induces decay of relative entropy to its own fixed point, we find such multiplicative converse bounds. However, there are other cases in which the ratio can fall by an arbitrary extent. Even for simple noise such as qubit dephasing or depolarizing, mutual information may fall by an unbounded factor under arbitrarily weak noise. As an application, we find families of channels with non-zero private capacity despite arbitrarily high probability of transmitting an arbitrarily good copy of the input to the environment.
We present a method to estimate the quantum Fisher information (QFI) of many-body quantum states in the presence of decoherence, where its direct evaluation requires the full spectral resolution of the density matrix. We show that, for many-body wave functions known analytically in the occupation-number basis, systematic lower bounds to the QFI can be mapped onto expectation values over a classical probability distribution defined by the wave function amplitudes. This mapping enables efficient estimation via Markov-chain Monte Carlo sampling, with a computational cost that scales as a `slow' exponential (ebLe^{b L}ebL with b≲0.6b \lesssim 0.6b≲0.6) and remains manageable for system sizes well beyond exact diagonalization. We specify this framework to Jastrow-Gutzwiller wave functions. We characterize their metrological content by identifying the observables that maximize the QFI and the corresponding scaling with LLL. Then, we analyze the QFI under three physically motivated noise channels: local dephasing, local amplitude damping, and global depolarizing. We compare polynomial and Krylov-based lower bounds across these channels, relating their behavior to the effective rank of the noisy density matrix and to the structure of the operator generating the parameter encoding. The framework extends naturally to other analytically known wave functions and to a broader class of information-theoretic quantities beyond the QFI.