Asymptotic Quantum State Discrimination for Mixtures of Unitarily Related States

• URL: http://arxiv.org/abs/2402.05297v1
• Date: Wed, 7 Feb 2024 22:24:12 GMT
• Title: Asymptotic Quantum State Discrimination for Mixtures of Unitarily Related States
• Authors: Alberto Acevedo, Janek Wehr
• Abstract summary: Quantum state discrimination is a prominent problem in quantum communication theory. We first present an approach to QSD in the case of countable mixtures. We then outline an analogous approach to uncountable mixtures, presenting some conjectures that mirror the results presented for the cases of countable mixtures.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Given a mixture of states, finding a way to optimally discriminate its elements is a prominent problem in quantum communication theory. In this paper, we will address mixtures of density operators that are unitarily equivalent via elements of a one-parameter unitary group, and the corresponding quantum state discrimination (QSD) problems. We will be particularly interested in QSD as time goes to infinity. We first present an approach to QSD in the case of countable mixtures and address the respective asymptotic QSD optimization problems, proving necessary and sufficient conditions for minimal error to be obtained in the asymptotic regime (we say that in such a case QSD is fully solvable). We then outline an analogous approach to uncountable mixtures, presenting some conjectures that mirror the results presented for the cases of countable mixtures. As a technical tool, we prove and use an infinite dimensional version of the well-known Barnum-Knill bound.

Related papers

• SDP for One-shot Dilution of Quantum Coherence [0.0]
  We find a semidefinite program of one-shot coherence dilution of pure state under maximally incoherent operation. We further give a similar but not semidefinite program form under dephasing-covariant incoherent operation. Our numerical experiment clearly demonstrates that the maximally incoherent operation and dephasing-covariant incoherent operation have different power in the coherence dilution.
  arXiv  Detail & Related papers  (2024-09-13T14:39:04Z)
• Optimal discrimination of quantum sequences [13.39567116041819]
  Key concept of quantum information theory is that accessing information encoded in a quantum system requires us to discriminate between several possible states the system could be in. In this paper, we prove that if the members of a given sequence are drawn secretly and independently from an ensemble or even from different ensembles, the optimum success probability is achievable by fixed local measurements on the individual members of the sequence.
  arXiv  Detail & Related papers  (2024-09-13T10:48:16Z)
• An Analysis of Quantum Annealing Algorithms for Solving the Maximum Clique Problem [49.1574468325115]
  We analyse the ability of quantum D-Wave annealers to find the maximum clique on a graph, expressed as a QUBO problem. We propose a decomposition algorithm for the complementary maximum independent set problem, and a graph generation algorithm to control the number of nodes, the number of cliques, the density, the connectivity indices and the ratio of the solution size to the number of other nodes.
  arXiv  Detail & Related papers  (2024-06-11T04:40:05Z)
• Saturation of the Multiparameter Quantum Cramér-Rao Bound at the Single-Copy Level with Projective Measurements [0.0]
  It was not known when the quantum Cram'er-Rao bound can be saturated (achieved) when only a single copy of the quantum state is available. In this paper, key structural properties of optimal measurements that saturate the quantum Cram'er-Rao bound are illuminated.
  arXiv  Detail & Related papers  (2024-05-02T17:04:13Z)
• Studying Stabilizer de Finetti Theorems and Possible Applications in Quantum Information Processing [0.0]
  In quantum information theory, if a quantum state is invariant under permutations of its subsystems, its marginal can be approximated by a mixture of powers of a state on a single subsystem. Recently, it has been discovered that a similar observation can be made for a larger symmetry group than permutations. This naturally raises the question if similar improvements could be found for applications where this symmetry appears.
  arXiv  Detail & Related papers  (2024-03-15T17:55:12Z)
• Quantum Soft Covering and Decoupling with Relative Entropy Criterion [11.987004396261241]
  We prove covering lemmas by deriving one-shot bounds on the rates in terms of smooth min-entropies and smooth max-divergences. We present a one-shot quantum decoupling theorem with relative entropy criterion.
  arXiv  Detail & Related papers  (2024-02-16T22:31:38Z)
• A Convergence Theory for Over-parameterized Variational Quantum Eigensolvers [21.72347971869391]
  The Variational Quantum Eigensolver (VQE) is a promising candidate for quantum applications on near-term Noisy Intermediate-Scale Quantum (NISQ) computers. We provide the first rigorous analysis of the convergence of VQEs in the over- parameterization regime.
  arXiv  Detail & Related papers  (2022-05-25T04:06:50Z)
• 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)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• A Unified Joint Maximum Mean Discrepancy for Domain Adaptation [73.44809425486767]
  This paper theoretically derives a unified form of JMMD that is easy to optimize. From the revealed unified JMMD, we illustrate that JMMD degrades the feature-label dependence that benefits to classification. We propose a novel MMD matrix to promote the dependence, and devise a novel label kernel that is robust to label distribution shift.
  arXiv  Detail & Related papers  (2021-01-25T09:46:14Z)
• 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.