'Interaction-Free' Channel Discrimination

• URL: http://arxiv.org/abs/2010.00623v1
• Date: Thu, 1 Oct 2020 18:06:56 GMT
• Title: 'Interaction-Free' Channel Discrimination
• Authors: Markus Hasen\"ohrl and Michael M. Wolf
• Abstract summary: We generalize the notion of 'interaction-free' measurement to arbitrary quantum channels. Our main result is a necessary and sufficient criterion for when it is possible or impossible to discriminate quantum channels in an 'interaction-free' manner.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work, we investigate the question, which objects one can discriminate perfectly by 'interaction-free' measurements. To this end, we interpret the Elitzur-Vaidman bomb-tester experiment as a quantum channel discrimination problem and generalize the notion of 'interaction-free' measurement to arbitrary quantum channels. Our main result is a necessary and sufficient criterion for when it is possible or impossible to discriminate quantum channels in an 'interaction-free' manner (i.e., such that the discrimination error probability and the 'interaction' probability can be made arbitrarily small). For the case where our condition holds, we devise an explicit protocol with the property that both probabilities approach zero with an increasing number of channel uses, $N$. More specifically, the 'interaction' probability in our protocol decays as $\frac{1}{N}$ and we show that this rate is the optimal achievable one. Furthermore, our protocol only needs at most one ancillary qubit and might thus be implementable in near-term experiments. For the case where our condition does not hold, we prove an inequality that quantifies the trade-off between the error probability and the 'interaction' probability.

Related papers

• Discrimination of bosonic dephasing quantum channels [3.7498611358320733]
  We study the possibility of discriminating between two bosonic dephasing quantum channels. In the presence of an input energy constraint, we derive an upper bound on the error probability. We extend these results from single-shot to multi-shot discrimination, envisaging the behavior.
  arXiv  Detail & Related papers  (2024-07-20T17:01:03Z)
• To Believe or Not to Believe Your LLM [51.2579827761899]
  We explore uncertainty quantification in large language models (LLMs) We derive an information-theoretic metric that allows to reliably detect when only epistemic uncertainty is large. We conduct a series of experiments which demonstrate the advantage of our formulation.
  arXiv  Detail & Related papers  (2024-06-04T17:58:18Z)
• Kolmogorovian Censorship, Predictive Incompleteness, and the locality loophole in Bell experiments [0.0]
  Kolmogorovian Censorship stipulates that quantum probabilities can be identified with classical, Kolmogorovian probabilities. In a loophole-free Bell test, the remote random choices of measurements have the purpose to prevent this matching. We argue that predictive incompleteness is the correct quantum way to understand the violation of Bell's inequalities.
  arXiv  Detail & Related papers  (2024-05-06T06:20:54Z)
• Possibilistic and maximal indefinite causal order in the quantum switch [0.0]
  We show that the indefinite causal order in the quantum switch can be certified device-independently when assuming the impossibility of superluminal influences. We also show that the observed correlations are incompatible even with the existence of a causal order on only a small fraction of the runs of the experiment.
  arXiv  Detail & Related papers  (2023-11-01T14:55:03Z)
• 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)
• Excluding false negative error in certification of quantum channels [68.8204255655161]
  This work focuses on the scenario when the false negative error cannot occur, even if it leads to the growth of the probability of false positive error. We establish a condition when it is possible to exclude false negative error after a finite number of queries to the quantum channel in parallel.
  arXiv  Detail & Related papers  (2021-06-04T09:41:11Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• Ultimate limits of approximate unambiguous discrimination [1.14219428942199]
  Two main strategies have been widely adopted: in a minimum error discrimination strategy, the average error probability is minimized; while in an unambiguous discrimination strategy, an inconclusive decision is allowed to vanish any possibility of errors when a conclusive result is obtained. In this paper, we formulate an approximate unambiguous discrimination scenario, and derive the ultimate limits of the performance for both states and channels. For the special class of teleportation-covariant' channels, the lower bound is achievable with maximum entangled inputs and no adaptive strategy is necessary.
  arXiv  Detail & Related papers  (2020-10-29T16:58:42Z)
• A Weaker Faithfulness Assumption based on Triple Interactions [89.59955143854556]
  We propose a weaker assumption that we call $2$-adjacency faithfulness. We propose a sound orientation rule for causal discovery that applies under weaker assumptions.
  arXiv  Detail & Related papers  (2020-10-27T13:04:08Z)
• Discrimination of Ohmic thermal baths by quantum dephasing probes [68.8204255655161]
  We evaluate the minimum error probability achievable by three different kinds of quantum probes, namely a qubit, a qutrit and a quantum register made of two qubits. A qutrit probe outperforms a qubit one in the discrimination task, whereas a register made of two qubits does not offer any advantage.
  arXiv  Detail & Related papers  (2020-08-06T08:51:51Z)
• 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)

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.