Adversarial guesswork with quantum side information

• URL: http://arxiv.org/abs/2306.12633v2
• Date: Sun, 24 Dec 2023 00:49:38 GMT
• Title: Adversarial guesswork with quantum side information
• Authors: Baasanchimed Avirmed, Kaito Niinomi, Michele Dall'Arno
• Abstract summary: 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.
• Score: 2.4554686192257424
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The guesswork of a classical-quantum channel quantifies the cost incurred in guessing the state transmitted by the channel when only one state can be queried at a time, maximized over any classical pre-processing and minimized over any quantum post-processing. For arbitrary-dimensional covariant classical-quantum channels, we prove the invariance of the optimal pre-processing and the covariance of the optimal post-processing. In the qubit case, we compute the optimal guesswork for the class of so-called highly symmetric informationally complete classical-quantum channels.

Related papers

• Regularization of Riemannian optimization: Application to process tomography and quantum machine learning [0.0]
  We investigate the influence of various regularization terms added to the cost function of gradient descent algorithms. Motivated by Lasso regularization, we apply penalties for large ranks of the quantum channel. We apply the method to quantum process tomography and a quantum machine learning problem.
  arXiv  Detail & Related papers  (2024-04-30T15:56:16Z)
• Fully quantum arbitrarily varying channel coding for entanglement-assisted communication [0.0]
  We study the problem of entanglement-assisted capacity in the presence of system uncertainty. We find that, under the assumption of a finite environment dimension, it is equal to a corresponding compound capacity. Our results imply that in certain fully quantum arbitrarily varying channel models, the entanglement-assisted capacity can be positive while the classical capacity is equal to zero.
  arXiv  Detail & Related papers  (2024-04-12T02:10:04Z)
• 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)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Quantum Error Mitigation Relying on Permutation Filtering [84.66087478797475]
  We propose a general framework termed as permutation filters, which includes the existing permutation-based methods as special cases. We show that the proposed filter design algorithm always converges to the global optimum, and that the optimal filters can provide substantial improvements over the existing permutation-based methods.
  arXiv  Detail & Related papers  (2021-07-03T16:07:30Z)
• 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)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Explicit construction of optimal witnesses for input-output correlations attainable by quantum channels [3.441021278275805]
  We consider the problem of characterizing the set of classical noisy channels that can be obtained from a quantum channel. We consider various classes of linear witnesses and compute their optimum values in closed form for several classes of quantum channels. The witnesses that we consider here are formulated as communication games, in which Alice's aim is to exploit a single use of a given quantum channel to help Bob guess some information she has received from an external referee.
  arXiv  Detail & Related papers  (2020-09-02T07:34:23Z)
• From a quantum theory to a classical one [117.44028458220427]
  We present and discuss a formal approach for describing the quantum to classical crossover. The method was originally introduced by L. Yaffe in 1982 for tackling large-$N$ quantum field theories.
  arXiv  Detail & Related papers  (2020-04-01T09:16:38Z)
• Bounding the Classical Capacity of Multilevel Damping Quantum Channels [0.0]
  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.
  arXiv  Detail & Related papers  (2020-01-17T11:47:12Z)

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.