
TL;DR
This paper analyzes and proves the optimality of a protocol for interaction-free detection of objects and introduces a new method to detect unitary operations with minimal disturbance and error.
Contribution
It proves the optimality of an interaction-free detection protocol using adversary methods and presents a novel protocol for detecting unitary operations with negligible error.
Findings
The protocol is proven to be optimal in certain settings.
A new protocol for detecting unitary operations with minimal disturbance is introduced.
The methods improve understanding of interaction-free measurement limits.
Abstract
This manuscript is inspired by the paper [2]. In the paper, they investigate a method to detect existence of an object with arbitrarily small interaction. Below, we sketch their protocol to motivate the present manuscript. The object of their protocol is to detect whether the given blackbox interact with input states or not, with negligible distortion of the blackbox, and high detection probability. In this paper, we do two things. First, we prove the above mentioned protocol is optimal in a certain setting. The main tool here is adversary method, a classical method in query complexity. Second, we present a protocol to detect unitary operations with negligible error and no distortion of the input at all.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Computability, Logic, AI Algorithms · Quantum Information and Cryptography
