Simple upper and lower bounds on the ultimate success probability for discriminating arbitrary finite-dimensional quantum processes

• URL: http://arxiv.org/abs/2012.13844v3
• Date: Sat, 19 Feb 2022 07:37:35 GMT
• Title: Simple upper and lower bounds on the ultimate success probability for discriminating arbitrary finite-dimensional quantum processes
• Authors: Kenji Nakahira and Kentaro Kato
• Abstract summary: We present a simple upper bound on the ultimate success probability for discriminating arbitrary quantum processes. In the special case of multi-shot channel discrimination, it can be shown that the ultimate success probability increases by at most a constant factor determined by the given channels. We also present a lower bound based on Bayesian updating, which has a low computational cost.
• Score: 2.538209532048866
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider the problem of discriminating finite-dimensional quantum processes, also called quantum supermaps, that can consist of multiple time steps. Obtaining the ultimate performance for discriminating quantum processes is of fundamental importance, but is challenging mainly due to the necessity of considering all discrimination strategies allowed by quantum mechanics, including entanglement-assisted strategies and adaptive strategies. In the case in which the processes to be discriminated have internal memories, the ultimate performance would generally be more difficult to analyze. In this paper, we present a simple upper bound on the ultimate success probability for discriminating arbitrary quantum processes. In the special case of multi-shot channel discrimination, it can be shown that the ultimate success probability increases by at most a constant factor determined by the given channels if the number of channel evaluations increases by one. We also present a lower bound based on Bayesian updating, which has a low computational cost. Our numerical experiments demonstrate that the proposed bounds are reasonably tight. The proposed bounds do not explicitly depend on any quantum phenomena, and can be readily extended to a general operational probabilistic theory.

Related papers

• The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the extreme multimode bosonic Gaussian channels [53.253900735220796]
  Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes. Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
  arXiv  Detail & Related papers  (2024-10-18T13:59:50Z)
• Bounds for Revised Unambiguous Discrimination Tasks of Quantum Resources [0.9790236766474201]
  Quantum state discrimination is a fundamental task that is meaningful in quantum information theory. We show an upper bound of the success probability for a revised discrimination task in the unasymptotic and unambiguous scenarios. We also show the advantage of the quantum by considering a quantifier on a set of semidefinite positive operators.
  arXiv  Detail & Related papers  (2024-10-06T14:52:17Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Quantum process discrimination with restricted strategies [2.030567625639093]
  We present a general formulation of the task of finding the maximum success probability for discriminating quantum processes. We derive necessary and sufficient conditions for an optimal restricted strategy to be optimal within the set of all strategies. This finding has the potential to provide a deeper insight into the discrimination performance of various restricted strategies.
  arXiv  Detail & Related papers  (2021-04-19T04:02:51Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Idler-Free Multi-Channel Discrimination via Multipartite Probe States [0.0]
  Multi-channel discrimination creates a scenario in which the discrimination of multiple quantum channels can be equated to the idea of pattern recognition. We develop general classes of unassisted multi-channel discrimination protocols which are not assisted by idler modes. Our findings uncover the existence of strongly quantum advantageous, idler-free protocols for the discrimination of bosonic loss and environmental noise.
  arXiv  Detail & Related papers  (2020-10-23T12:35:15Z)
• Ultimate limits for multiple quantum channel discrimination [0.966840768820136]
  This paper studies the problem of hypothesis testing with quantum channels. We establish a lower limit for the ultimate error probability affecting the discrimination of an arbitrary number of quantum channels. We also show that this lower bound is achievable when the channels have certain symmetries.
  arXiv  Detail & Related papers  (2020-07-29T03:08:48Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)
• Advanced Equivalence Checking for Quantum Circuits [4.265279817927261]
  We propose an advanced methodology for equivalence checking of quantum circuits. We show that, by exploiting the reversibility of quantum circuits, complexity can be kept feasible. In contrast to the classical realm, simulation is very powerful in verifying quantum circuits.
  arXiv  Detail & Related papers  (2020-04-17T18:56:23Z)

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.