Bounds for Revised Unambiguous Discrimination Tasks of Quantum Resources

• URL: http://arxiv.org/abs/2410.04504v1
• Date: Sun, 6 Oct 2024 14:52:17 GMT
• Title: Bounds for Revised Unambiguous Discrimination Tasks of Quantum Resources
• Authors: Xian Shi,
• Abstract summary: 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.
• Score: 0.9790236766474201
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: Quantum state discrimination is a fundamental task that is meaningful in quantum information theory. In this manuscript, we consider a revised unambiguous discrimination of quantum resources. First, we present an upper bound of the success probability for a revised unambiguous discrimination task in the unasymptotic and asymptotic scenarios. Next, we generalize the task from quantum states to quantum channels. We present an upper bound of the success probability for the task under the adaptive strategy. Furthermore, we show the bound can be computed efficiently. Finally, compared with the classical unambiguous discrimination, we show the advantage of the quantum by considering a quantifier on a set of semidefinite positive operators.

Related papers

• Data Processing Inequality for The Quantum Guesswork [4.956709222278243]
  Non-orthogonal quantum states cannot be distinguished with absolute certainty. Quantum guesswork has emerged as a crucial measure in assessing the distinguishability of non-orthogonal quantum states.
  arXiv  Detail & Related papers  (2024-07-22T19:42:16Z)
• Barycentric bounds on the error exponents of quantum hypothesis exclusion [7.812210699650153]
  We study the optimal error probability of quantum state exclusion from an information-theoretic perspective. We extend our analysis to the more complicated task of quantum channel exclusion.
  arXiv  Detail & Related papers  (2024-07-18T17:27:36Z)
• 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)
• Quasiprobability distribution of work in the quantum Ising model [0.0]
  We try to clarify the genuinely quantum features of the process by studying the work quasiprobability for an Ising model in a transverse field. We examine the critical features related to a quantum phase transition and the role of the initial quantum coherence as useful resource.
  arXiv  Detail & Related papers  (2023-02-22T10:07:49Z)
• Approximation of the Nearest Classical-Classical State to a Quantum State [0.0]
  A revolutionary step in computation is driven by quantumness or quantum correlations, which are permanent in entanglements but often in separable states. The exact quantification of quantumness is an NP-hard problem; thus, we consider alternative approaches to approximate it. We show that the objective value decreases along the flow by proofs and numerical results.
  arXiv  Detail & Related papers  (2023-01-23T08:26:17Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• 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)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Facial Expression Recognition on a Quantum Computer [68.8204255655161]
  We show a possible solution to facial expression recognition using a quantum machine learning approach. We define a quantum circuit that manipulates the graphs adjacency matrices encoded into the amplitudes of some appropriately defined quantum states.
  arXiv  Detail & Related papers  (2021-02-09T13:48:00Z)
• Simple upper and lower bounds on the ultimate success probability for discriminating arbitrary finite-dimensional quantum processes [2.538209532048866]
  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.
  arXiv  Detail & Related papers  (2020-12-27T01:14:23Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

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.