Analytical calculation formulas for capacities of classical and classical-quantum channels

• URL: http://arxiv.org/abs/2201.02450v2
• Date: Tue, 14 Feb 2023 09:01:04 GMT
• Title: Analytical calculation formulas for capacities of classical and classical-quantum channels
• Authors: Masahito Hayashi
• Abstract summary: We derive an analytical calculation formula for the channel capacity of a classical channel without any iteration. Our extended analytical algorithm have also no iteration and output the exactly optimum values.
• Score: 61.12008553173672
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We derive an analytical calculation formula for the channel capacity of a classical channel without any iteration while its existing algorithms require iterations and the number of iteration depends on the required precision level. Hence, our formula is its first analytical formula without any iteration. We apply the obtained formula to examples and see how the obtained formula works in these examples. Then, we extend it to the channel capacity of a classical-quantum (cq-) channel. Many existing studies proposed algorithms for a cq-channel and all of them require iterations. Our extended analytical algorithm have also no iteration and output the exactly optimum values.

Related papers

• Exponents for classical-quantum channel simulation in purified distance [5.598487000369366]
  We determine the exact error and strong converse exponent for entanglement-assisted classical-quantum channel simulation. We critically use various properties of the quantum fidelity, additional auxiliary channel techniques, approximations via Chebyshev inequalities, and entropic continuity bounds.
  arXiv  Detail & Related papers  (2024-10-14T17:45:41Z)
• Optimization by Decoded Quantum Interferometry [43.55132675053983]
  We introduce a quantum algorithm for reducing classical optimization problems to classical decoding problems. We show that DQI achieves a better approximation ratio than any quantum-time classical algorithm known to us.
  arXiv  Detail & Related papers  (2024-08-15T17:47:42Z)
• Unitary Quantum Algorithm for the Lattice-Boltzmann Method [0.0]
  We present a quantum algorithm for computational fluid dynamics based on the Lattice-Boltzmann method. Our results demonstrate that our quantum algorithm captures non-linearity.
  arXiv  Detail & Related papers  (2024-05-22T07:03:54Z)
• Reverse em-problem based on Bregman divergence and its application to classical and quantum information theory [53.64687146666141]
  Recent paper introduced an analytical method for calculating the channel capacity without the need for iteration. We turn our attention to the reverse em-problem, proposed by Toyota. We derive a non-iterative formula for the reverse em-problem.
  arXiv  Detail & Related papers  (2024-03-14T10:20:28Z)
• Preconditioning for a Variational Quantum Linear Solver [0.0]
  We numerically demonstrate a notable reduction in the required ansatz depth, demonstrating that preconditioning is useful for quantum algorithms. Our findings suggest that combining classical computing techniques, such as preconditioning, with quantum algorithms can significantly enhance the performance of NISQ algorithms.
  arXiv  Detail & Related papers  (2023-12-25T08:50:22Z)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• On Hitting Times for General Quantum Markov Processes [0.0]
  We use the density-matrix formalism to define a quantum Markov chain model which directly generalizes classical walks. We show that a common tools such as hitting times can be computed with a similar formula as the one found in the classical theory.
  arXiv  Detail & Related papers  (2022-10-18T22:20:27Z)
• The Accuracy vs. Sampling Overhead Trade-off in Quantum Error Mitigation Using Monte Carlo-Based Channel Inversion [84.66087478797475]
  Quantum error mitigation (QEM) is a class of promising techniques for reducing the computational error of variational quantum algorithms. We consider a practical channel inversion strategy based on Monte Carlo sampling, which introduces additional computational error. We show that when the computational error is small compared to the dynamic range of the error-free results, it scales with the square root of the number of gates.
  arXiv  Detail & Related papers  (2022-01-20T00:05:01Z)
• Compound Channel Capacities under Energy Constraints and Application [0.0]
  We give explicit formulas for the cases of the Gaussian classical-quantum compound channels with unknown noise, unknown phase and unknown attenuation. Our work demonstrates the value of the compound channel model as a method for the design of receivers in quantum communication.
  arXiv  Detail & Related papers  (2021-05-10T11:23:48Z)
• Momentum Q-learning with Finite-Sample Convergence Guarantee [49.38471009162477]
  This paper analyzes a class of momentum-based Q-learning algorithms with finite-sample guarantee. We establish the convergence guarantee for MomentumQ with linear function approximations and Markovian sampling. We demonstrate through various experiments that the proposed MomentumQ outperforms other momentum-based Q-learning algorithms.
  arXiv  Detail & Related papers  (2020-07-30T12:27:03Z)

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.