Data Processing Inequality for The Quantum Guesswork

• URL: http://arxiv.org/abs/2407.16012v1
• Date: Mon, 22 Jul 2024 19:42:16 GMT
• Title: Data Processing Inequality for The Quantum Guesswork
• Authors: Ilyass Mejdoub, Julien Béguinot, Olivier Rioul,
• Abstract summary: 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.
• Score: 4.956709222278243
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Non-orthogonal quantum states pose a fundamental challenge in quantum information processing, as they cannot be distinguished with absolute certainty. Conventionally, the focus has been on minimizing error probability in quantum state discrimination tasks. However, another criterion known as quantum guesswork has emerged as a crucial measure in assessing the distinguishability of non-orthogonal quantum states, when we are allowed to query a sequence of states. In this paper, we generalize well known properties in the classical setting that are relevant for the guessing problem. Specifically, we establish the pre and post Data Processing Inequalities. We also derive a more refined lower bound on quantum guesswork.

Related papers

• Efficient Quantum Pseudorandomness from Hamiltonian Phase States [41.94295877935867]
  We introduce a quantum hardness assumption called the Hamiltonian Phase State (HPS) problem. We show that our assumption is plausibly fully quantum; meaning, it cannot be used to construct one-way functions. We show that our assumption and its variants allow us to efficiently construct many pseudorandom quantum primitives.
  arXiv  Detail & Related papers  (2024-10-10T16:10:10Z)
• Limitations of Classically-Simulable Measurements for Quantum State Discrimination [7.0937306686264625]
  stabilizer operations play a pivotal role in fault-tolerant quantum computing. We investigate the limitations of classically-simulable measurements in distinguishing quantum states.
  arXiv  Detail & Related papers  (2023-10-17T15:01:54Z)
• 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)
• 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)
• 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)
• Algorithm and Circuit of Nesting Doubled Qubits [3.6296396308298795]
  Copying quantum states is contradictory to classical information processing. This paper investigates the naturally arising question of how well or under what conditions one can copy and measure an arbitrary quantum superposition of states.
  arXiv  Detail & Related papers  (2022-01-01T23:14:44Z)
• 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)
• An agnostic-Dolinar receiver for coherent states classification [2.6763498831034034]
  We consider the problem of discriminating quantum states, where the task is to distinguish two different quantum states with a complete classical knowledge about them. In the case the quantum states are represented by coherent states of light, we identify intermediate scenarios where partial prior information is available.
  arXiv  Detail & Related papers  (2021-06-22T16:35:42Z)
• Quantum information spreading in a disordered quantum walk [50.591267188664666]
  We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern. We focus on the coherent static and dynamic disorder to investigate anomalous and classical transport. Our results show that a Quantum Walk can be considered as a readout device of information about defects and perturbations occurring in complex networks.
  arXiv  Detail & Related papers  (2020-10-20T20:03:19Z)
• Quantum entanglement recognition [0.0]
  We formulate a framework for probing entanglement based on machine learning techniques. We show that the resulting quantum entanglement recognition task is accurate and can be assigned a well-controlled error.
  arXiv  Detail & Related papers  (2020-07-28T18:00:00Z)
• Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
  Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies. We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived. This is the first quantum protocol that can be used against the most general adversaries.
  arXiv  Detail & Related papers  (2020-03-20T17:56:14Z)

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.