Capacities of highly Markovian divisible quantum channels

• URL: http://arxiv.org/abs/2504.10436v1
• Date: Mon, 14 Apr 2025 17:27:43 GMT
• Title: Capacities of highly Markovian divisible quantum channels
• Authors: Satvik Singh, Nilanjana Datta,
• Abstract summary: We analyze information transmission capacities of quantum channels acting on $d$-dimensional quantum systems.<n>For any channel $Psi$, the classical, private classical, and quantum capacities of $Psi_infty$ satisfy the strong converse property.<n>In the zero-error case, we introduce the notion of the stabilized non-commutative confusability graph of a quantum channel.
• Score: 9.054540533394926
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We analyze information transmission capacities of quantum channels acting on $d$-dimensional quantum systems that are highly Markovian divisible, i.e., channels of the form \begin{equation*} \Phi = \underbrace{\Psi\circ \Psi \circ \ldots \circ \Psi}_{l \,\operatorname{times}} \end{equation*} with $l \geq \gamma d^2 \log d$ for some constant $\gamma=\gamma(\Psi)$ that depends on the spectral gap of the dividing channel $\Psi$. We prove that capacities of such channels are approximately strongly additive and can be efficiently approximated in terms of the structure of their peripheral spaces. Furthermore, the quantum and private classical capacities of such channels approximately coincide and approximately satisfy the strong converse property. We show that these approximate results become exact for the corresponding zero-error capacities when $l \geq d^2$. To prove these results, we show that for any channel $\Psi$, the classical, private classical, and quantum capacities of $\Psi_\infty$, which is its so-called asymptotic part, satisfy the strong converse property and are strongly additive. In the zero-error case, we introduce the notion of the stabilized non-commutative confusability graph of a quantum channel and characterize its structure for any given channel.

Related papers

• Quantum channels, complex Stiefel manifolds, and optimization [45.9982965995401]
  We establish a continuity relation between the topological space of quantum channels and the quotient of the complex Stiefel manifold. The established relation can be applied to various quantum optimization problems.
  arXiv  Detail & Related papers  (2024-08-19T09:15:54Z)
• Phase Transition in the Quantum Capacity of Quantum Channels [0.0]
  We prove that every quantum channel $Lambda$ in arbitrary dimension, when contaminated by white noise, completely loses its capacity of transmitting quantum states. We also find the quantum capacity of the complement of the depolarizing channel in closed form.
  arXiv  Detail & Related papers  (2024-08-11T09:49:52Z)
• General Communication Enhancement via the Quantum Switch [15.779145740528417]
  We conjecture that $mathcalP_n>0$ is both a necessary and sufficient condition for communication enhancement via the quantum $tt SWITCH$. We then formulate a communication protocol involving the quantum $tt SWITCH$ which enhances the private capacity of the BB84 channel.
  arXiv  Detail & Related papers  (2024-07-03T00:47:13Z)
• Deterministic identification over channels with finite output: a dimensional perspective on superlinear rates [49.126395046088014]
  We consider the problem in its generality for memoryless channels with finite output, but arbitrary input alphabets.<n>Our main findings are that the maximum length of messages thus identifiable scales superlinearly as $R,nlog n$ with the block length $n$.<n>We show that it is sufficient to ensure pairwise reliable distinguishability of the output distributions to construct a DI code.
  arXiv  Detail & Related papers  (2024-02-14T11:59:30Z)
• Correspondence between open bosonic systems and stochastic differential equations [77.34726150561087]
  We show that there can also be an exact correspondence at finite $n$ when the bosonic system is generalized to include interactions with the environment. A particular system with the form of a discrete nonlinear Schr"odinger equation is analyzed in more detail.
  arXiv  Detail & Related papers  (2023-02-03T19:17:37Z)
• A lower bound on the space overhead of fault-tolerant quantum computation [51.723084600243716]
  The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation. We prove an exponential upper bound on the maximal length of fault-tolerant quantum computation with amplitude noise.
  arXiv  Detail & Related papers  (2022-01-31T22:19:49Z)
• Dephasing superchannels [0.09545101073027092]
  We characterise a class of environmental noises that decrease coherent properties of quantum channels by introducing and analysing the properties of dephasing superchannels. These are defined as superchannels that affect only non-classical properties of a quantum channel $mathcalE$. We prove that such superchannels $Xi_C$ form a particular subclass of Schur-product supermaps that act on the Jamiolkowski state $J(mathcalE)$ of a channel $mathcalE$ via a Schur product, $J'=J
  arXiv  Detail & Related papers  (2021-07-14T10:10:46Z)
• Coherent control and distinguishability of quantum channels via PBS-diagrams [59.94347858883343]
  We introduce a graphical language for coherent control of general quantum channels inspired by practical quantum optical setups involving polarising beam splitters (PBS) We characterise the observational equivalence of purified channels in various coherent-control contexts, paving the way towards a faithful representation of quantum channels under coherent control.
  arXiv  Detail & Related papers  (2021-03-02T22:56:25Z)
• Bosonic quantum communication across arbitrarily high loss channels [68.58838842613457]
  A general attenuator $Phi_lambda, sigma$ is a bosonic quantum channel that acts by combining the input with a fixed environment state. We show that for any arbitrary value of $lambda>0$ there exists a suitable single-mode state $sigma(lambda)$. Our result holds even when we fix an energy constraint at the input of the channel, and implies that quantum communication at a constant rate is possible even in the limit of arbitrarily low transmissivity.
  arXiv  Detail & Related papers  (2020-03-19T16:50:11Z)
• Decoding quantum information via the Petz recovery map [16.276576840098254]
  We show that there is a sharp error threshold above which $Qn, epsilon(mathcalN)$ scales as $sqrtn$. Applying our achievability bound to the 50-50 erasure channel, we find that there is a sharp error threshold above which $Qn, epsilon(mathcalN)$ scales as $sqrtn$.
  arXiv  Detail & Related papers  (2015-04-17T06:20:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.