Local certification of unitary operations and von Neumann measurements

• URL: http://arxiv.org/abs/2312.17037v1
• Date: Thu, 28 Dec 2023 14:23:59 GMT
• Title: Local certification of unitary operations and von Neumann measurements
• Authors: Mateusz St\k{e}pniak and Kamil Hendzel and {\L}ukasz Pawela and Bart{\l}omiej Gardas and Zbigniew Pucha{\l}a
• Abstract summary: We analyze the local certification of unitary quantum channels and von Neumann measurements. The goal is to minimize the probability of the type II error, given a specified maximum probability of the type I error. We introduce a new mathematical structure q-product numerical range, which is a natural generalization of the q-numerical range.
• Score: 6.374763930914524
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this work, we analyze the local certification of unitary quantum channels and von Neumann measurements, which is a natural extension of quantum hypothesis testing. A particular case of a quantum channel and von Neumann measurement, operating on two systems corresponding to product states at the input, is considered. The goal is to minimize the probability of the type II error, given a specified maximum probability of the type I error, considering assistance through entanglement. We introduce a new mathematical structure q-product numerical range, which is a natural generalization of the q-numerical range, used to obtain result, when dealing with one system. In our findings, we employ the q-product numerical range as a pivotal tool, leveraging its properties to derive our results and minimize the probability of type II error under the constraint of type I error probability. We show a fundamental dependency: for local certification, the tensor product structure inherently manifests, necessitating the transition from q-numerical range to q-product numerical range.

Related papers

• Practical Advantage of Classical Communication in Entanglement Detection [3.3058905316005744]
  Entanglement is the cornerstone of quantum communication, yet conventional detection relies solely on local measurements. We present a unified theoretical and experimental framework demonstrating that one-way local operations and classical communication (1-LOCC) can significantly outperform purely local measurements in detecting high-dimensional quantum entanglement.
  arXiv  Detail & Related papers  (2025-04-14T01:33:20Z)
• Discovering Local Hidden-Variable Models for Arbitrary Multipartite Entangled States and Arbitrary Measurements [0.0]
  Measurement correlations in quantum systems can exhibit non-local behavior. We develop an approach that employs gradient-descent algorithms from machine learning to find LHV models. Our method now offers a quantitative tool for determining the regimes of non-locality in any given physical context.
  arXiv  Detail & Related papers  (2024-07-05T17:31:35Z)
• Learning Classifiers of Prototypes and Reciprocal Points for Universal Domain Adaptation [79.62038105814658]
  Universal Domain aims to transfer the knowledge between datasets by handling two shifts: domain-shift and categoryshift. Main challenge is correctly distinguishing the unknown target samples while adapting the distribution of known class knowledge from source to target. Most existing methods approach this problem by first training the target adapted known and then relying on the single threshold to distinguish unknown target samples.
  arXiv  Detail & Related papers  (2022-12-16T09:01:57Z)
• Enhancing Prototypical Few-Shot Learning by Leveraging the Local-Level Strategy [75.63022284445945]
  We find that the existing works often build their few-shot model based on the image-level feature by mixing all local-level features. We present (a) a local-agnostic training strategy to avoid the discriminative location bias between the base and novel categories, and (b) a novel local-level similarity measure to capture the accurate comparison between local-level features.
  arXiv  Detail & Related papers  (2021-11-08T08:45:15Z)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• KL Guided Domain Adaptation [88.19298405363452]
  Domain adaptation is an important problem and often needed for real-world applications. A common approach in the domain adaptation literature is to learn a representation of the input that has the same distributions over the source and the target domain. We show that with a probabilistic representation network, the KL term can be estimated efficiently via minibatch samples.
  arXiv  Detail & Related papers  (2021-06-14T22:24:23Z)
• Genuine activation of nonlocality: From locally available to locally hidden information [13.939388417767136]
  Quantum nonlocality has different manifestations that, in general, are revealed by local measurements of parts of a composite system. We show that there exist sets that are locally distinguishable but without local redundancy. We suggest an application, namely, local hiding of information, that allows us to locally hide locally available information without losing any part.
  arXiv  Detail & Related papers  (2021-04-24T12:02:48Z)
• Unextendible entangled bases and more nonlocality with less entanglement [0.0]
  We show that the phenomenon of more nonlocality with less entanglement can be observed for two qubits, while still being at the single-copy level. The results are potentially useful for secure quantum communication technologies with an optimal amount of resources.
  arXiv  Detail & Related papers  (2021-03-16T15:33:44Z)
• Reinforcement Learning with Neural Networks for Quantum Multiple Hypothesis Testing [8.006109507455038]
  Reinforcement learning with neural networks (RLNN) has recently demonstrated great promise for many problems. We use RLNN to find locally-adaptive measurement strategies that are experimentally feasible. We provide a new example which, to our knowledge, is the simplest known state set exhibiting a significant gap between local and collective protocols.
  arXiv  Detail & Related papers  (2020-10-16T18:49:23Z)
• Log-Likelihood Ratio Minimizing Flows: Towards Robust and Quantifiable Neural Distribution Alignment [52.02794488304448]
  We propose a new distribution alignment method based on a log-likelihood ratio statistic and normalizing flows. We experimentally verify that minimizing the resulting objective results in domain alignment that preserves the local structure of input domains.
  arXiv  Detail & Related papers  (2020-03-26T22:10:04Z)
• Fermionic state discrimination by local operations and classical communication [68.8204255655161]
  Local operations and classical communication (LOCC) discrimination between two bipartite pure states of fermionic systems is studied. We show that, contrary to the case of quantum systems, for fermionic systems it is generally not possible to achieve the ideal state discrimination performances.
  arXiv  Detail & Related papers  (2020-02-24T12:25:36Z)
• Identification of malfunctioning quantum devices [0.0]
  We consider the problem of correctly identifying a malfunctioning quantum device that forms part of a network of $N$ such devices. We show that the optimal probability of successful identification requires a global quantum measurement.
  arXiv  Detail & Related papers  (2018-08-08T11:39:50Z)

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.