Bounding the Classical Capacity of Multilevel Damping Quantum Channels

• URL: http://arxiv.org/abs/2001.06486v2
• Date: Wed, 27 May 2020 14:24:14 GMT
• Title: Bounding the Classical Capacity of Multilevel Damping Quantum Channels
• Authors: Chiara Macchiavello, Massimiliano F. Sacchi, Tito Sacchi
• Abstract summary: A recent method to certify the capacity of quantum communication channels is applied for general damping channels in finite dimension. The results for large representative classes of different damping structures are presented.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A recent method to certify the classical capacity of quantum communication channels is applied for general damping channels in finite dimension. The method compares the mutual information obtained by coding on the computational and a Fourier basis, which can be obtained by just two local measurement settings and classical optimization. The results for large representative classes of different damping structures are presented.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Towards Efficient Quantum Hybrid Diffusion Models [68.43405413443175]
  We propose a new methodology to design quantum hybrid diffusion models. We propose two possible hybridization schemes combining quantum computing's superior generalization with classical networks' modularity.
  arXiv  Detail & Related papers  (2024-02-25T16:57:51Z)
• Adversarial guesswork with quantum side information [2.4554686192257424]
  We show that the guesswork of a classical-quantum channel quantifies the cost incurred in guessing the state transmitted by the channel. We compute the optimal guesswork for the class of so-called highly symmetric informationally complete classical-quantum channels.
  arXiv  Detail & Related papers  (2023-06-22T02:03:45Z)
• Information capacity analysis of fully correlated multi-level amplitude damping channels [0.9790236766474201]
  We investigate some of the information capacities of the simplest member of multi-level Amplitude Damping Channel, a qutrit channel. We find the upper bounds of the single-shot classical capacities and calculate the quantum capacities associated with a specific class of maps.
  arXiv  Detail & Related papers  (2023-05-08T06:10:56Z)
• A quantum advantage over classical for local max cut [48.02822142773719]
  Quantum optimization approximation algorithm (QAOA) has a computational advantage over comparable local classical techniques on degree-3 graphs. Results hint that even small-scale quantum computation, which is relevant to the current state-of the art quantum hardware, could have significant advantages over comparably simple classical.
  arXiv  Detail & Related papers  (2023-04-17T16:42:05Z)
• Commitment capacity of classical-quantum channels [70.51146080031752]
  We define various notions of commitment capacity for classical-quantum channels. We prove matching upper and lower bound on it in terms of the conditional entropy.
  arXiv  Detail & Related papers  (2022-01-17T10:41:50Z)
• Towards fully-fledged quantum and classical communication over deployed fiber with up-conversion module [47.187609203210705]
  We propose and demonstrate a new method, based on up-conversion assisted receiver, for co-propagating classical light and QKD signals. Our proposal exhibits higher tolerance for noise in comparison to the standard receiver, thus enabling the distribution of secret keys in the condition of 4 dB-higher classical power.
  arXiv  Detail & Related papers  (2021-06-09T13:52:27Z)
• Computation-aided classical-quantum multiple access to boost network communication speeds [61.12008553173672]
  We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC. We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
  arXiv  Detail & Related papers  (2021-05-30T11:19:47Z)
• Quasi-inversion of quantum and classical channels in finite dimensions [2.362412515574206]
  We introduce the concept of quasi-inverse of quantum and classical channels, prove general properties of these inverses and determine them for a large class of channels acting in an arbitrary finite dimension. We demonstrate how application of the proposed scheme can increase on the average the fidelity between a given random pure state and its image transformed by the quantum channel followed by its quasi-inversion.
  arXiv  Detail & Related papers  (2021-04-13T09:57:57Z)
• Bounding the forward classical capacity of bipartite quantum channels [12.903847542910807]
  We introduce various measures of forward classical communication for bipartite quantum channels. Since a point-to-point channel is a special case of a bipartite channel, the measures reduce to measures of classical communication for point-to-point channels.
  arXiv  Detail & Related papers  (2020-10-02T15:39:01Z)
• Quantum capacity analysis of multi-level amplitude damping channels [4.2231191686871234]
  The set of Multi-level Amplitude Damping (MAD) quantum channels is introduced as a generalization of the standard qubit Amplitude Damping Channel to quantum systems of finite dimension $d$. We compute the associated quantum and private classical capacities for a rather wide class of maps, extending the set of solvable models known so far.
  arXiv  Detail & Related papers  (2020-08-02T13:15:00Z)

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.