Classical-Quantum Channel Resolvability Using Matrix Multiplicative Weight Update Algorithm

• URL: http://arxiv.org/abs/2601.12230v1
• Date: Sun, 18 Jan 2026 02:49:45 GMT
• Title: Classical-Quantum Channel Resolvability Using Matrix Multiplicative Weight Update Algorithm
• Authors: Koki Takahashi, Shun Watanabe,
• Abstract summary: We study classical-quantum (C-Q) channel resolvability. C-Q channel resolvability has been proved by only random coding in the literature.<n>We prove C-Q channel resolvability by deterministic coding, using the matrix multiplicative weight update algorithm.
• Score: 7.161783472741747
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study classical-quantum (C-Q) channel resolvability. C-Q channel resolvability has been proved by only random coding in the literature. In our previous study, we proved channel resolvability by deterministic coding, using multiplicative weight update algorithm. We extend this approach to C-Q channels and prove C-Q channel resolvability by deterministic coding, using the matrix multiplicative weight update algorithm. This is the first approach to C-Q channel resolvability using deterministic coding.

Related papers

• Generalized Quantum Stein's Lemma and Reversibility of Quantum Resource Theories for Classical-Quantum Channels [8.921166277011347]
  We extend the recent proof of the Generalized Quantum Stein's Lemma by Hayashi and Yamasaki to classical-quantum (c-q) channels.<n>We analyze the composite hypothesis testing problem of testing a c-q channel $mathcalEotimes n$ against a sequence of sets of c-q channels.
  arXiv  Detail & Related papers  (2025-09-16T17:34:37Z)
• Generalized Quantum Stein's Lemma for Classical-Quantum Dynamical Resources [39.89113394317153]
  Channel conversion provides a unified problem setting that encompasses celebrated results such as Shannon's noisy-channel coding theorem.<n>Quantum resource theories (QRTs) offer a general framework to study such problems under a prescribed class of operations.<n>In QRTs, quantum states serve as static resources, while quantum channels give rise to dynamical resources.
  arXiv  Detail & Related papers  (2025-09-08T23:00:48Z)
• Deciding Whether a C-Q Channel Preserves a Bit is QCMA-Complete [0.0]
  We prove that deciding whether a classical-quantum (C-Q) channel can exactly preserve a single classical bit is QCMA-complete.<n>This "bit-preservation" problem is a special case of orthogonality-constrained optimization tasks over C-Q channels.
  arXiv  Detail & Related papers  (2025-08-14T14:03:38Z)
• Optimization by Decoded Quantum Interferometry [38.063836468778895]
  We introduce Decoded Quantum Interferometry (DQI), a quantum algorithm that uses the quantum Fourier transform to reduce optimization problems to decoding problems.<n>For approximating optimal fits over finite fields, DQI achieves a superpolynomial speedup over known classical algorithms.
  arXiv  Detail & Related papers  (2024-08-15T17:47:42Z)
• QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
  We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
  arXiv  Detail & Related papers  (2023-04-14T08:03:20Z)
• Quantum Imitation Learning [74.15588381240795]
  We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL. We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL) Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
  arXiv  Detail & Related papers  (2023-04-04T12:47:35Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Graph Neural Networks for Channel Decoding [71.15576353630667]
  We showcase competitive decoding performance for various coding schemes, such as low-density parity-check (LDPC) and BCH codes. The idea is to let a neural network (NN) learn a generalized message passing algorithm over a given graph. We benchmark our proposed decoder against state-of-the-art in conventional channel decoding as well as against recent deep learning-based results.
  arXiv  Detail & Related papers  (2022-07-29T15:29:18Z)
• Analytical calculation formulas for capacities of classical and classical-quantum channels [61.12008553173672]
  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.
  arXiv  Detail & Related papers  (2022-01-07T13:39:09Z)
• Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
  Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm. Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
  arXiv  Detail & Related papers  (2021-05-06T17:59:38Z)
• Computing Sum of Sources over a Classical-Quantum MAC [13.561997774592664]
  We propose and analyze a coding scheme based on coset codes. The proposed technique enables the decoder recover the desired function without recovering the sources themselves. This work is based on a new ensemble of coset codes that are proven to achieve the capacity of a classical-quantum point-to-point channel.
  arXiv  Detail & Related papers  (2021-03-02T23:14:05Z)

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.