Optimal Interaction Free Localization with Multipath Interferometers
Anubhav Chaturvedi, Jorge Escandón-Monardes, Esteban S. Gómez, Gustavo Lima, Stephen P. Walborn
Abstract
Interaction-free measurement (IFM) certifies the presence of an absorbing object without a photon ever being absorbed by it. When several candidate locations are available, existing protocols can also identify which one holds the absorber, but they do so by testing paths sequentially through two-path interferometers, resolving a binary presence question at each step. We propose a different approach: probing all candidate locations at once, with the photon prepared in a coherent superposition across every path before a single measurement resolves the outcome. We prove that a three-stage protocol built on a d-path interferometer attains the exact one-shot optimum for this task, and we extend it to k absorbers among d paths, where the no-absorption branch encodes the entire absorber subset coherently rather than revealing individual locations one by one. The dark port therefore ceases to be a mere witness of presence and becomes a location-resolving signal. We then move beyond single-pass strategies using the quantum-comb formalism, casting the problem as an exact optimization over all multi-pass strategies and showing that adaptive protocols surpass the one-shot ceiling. Enriching the interferometer geometry with one additional path guaranteed to be empty, we show that sequential scanning, bright-port recycling, and Zeno-type interrogation all become particular feasible strategies within this same optimization, rather than separate benchmarks to compare against. This unified formulation identifies the optimal interaction-free localization strategy for any given set of resources, opening a route toward loss-resilient quantum imaging protocols for the study of fragile, absorption-sensitive samples.
Create a lesson
Related papers
Trading Circuit Depth for Pulse Sparsity in Chromatic Dynamical Decoupling
Amy F. Brown, Daniel A. Lidar
Optimal spectrum estimation
Ainesh Bakshi, Apoorv Vikram Singh, Xinyu Tan
Non-Abelian sheaf quantum LDPC codes: good and magical
Zimu Li, Fuchuan Wei, Zhengyi Han et al.
Learning and interpreting policies for simultaneous entanglement requests in quantum networks
Leon Rode, Sumeet Khatri, Supartha Podder
Sharp universal death of entanglement threshold for Pauli Hamiltonians
Bobak T. Kiani
Proper Agnostic Learning of Matrix Product States and Tree Tensor Networks
Constantin Cedillo Vayson de Pradenne, Jordan Cotler