Searcharxiv⌕ Search

arXiv subjects

Jorge Escandón-Monardes

Publications and source records attributed to Jorge Escandón-Monardes.

3 recordsLinked to original sources

Optimal Interaction Free Localization with Multipath Interferometers

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.

quant-ph↗

A map of indefinite causal order

In this "map" we are going to present the concept of indefinite causal order and make a quick journey through its different flavours. We will start with a broad conceptual motivation for studying indefinite causal order, based on the approach of Lucien Hardy to quantum gravity. Then, we will introduce the quantum switch, which is a particular instance of indefinite causal order, followed by the process matrices framework and the superposition of causal structures. Finally, we will comment on some ongoing debates within the field. This document started as an excerpt of the author's PhD Thesis and is intended as a map of indefinite causal order, which can be used to guide the trip of any explorer in the field.

quant-ph↗

Practical computational advantage from the quantum switch on a generalized family of promise problems

The quantum switch is a quantum computational primitive that provides computational advantage by applying operations in a superposition of orders. In particular, it can reduce the number of gate queries required for solving promise problems where the goal is to discriminate between a set of properties of a given set of unitary gates. In this work, we use Complex Hadamard matrices to introduce more general promise problems, which reduce to the known Fourier and Hadamard promise problems as limiting cases. Our generalization loosens the restrictions on the size of the matrices, number of gates and dimension of the quantum systems, providing more parameters to explore. In addition, it leads to the conclusion that a continuous variable system is necessary to implement the most general promise problem. In the finite dimensional case, the family of matrices is restricted to the so-called Butson-Hadamard type, and the complexity of the matrix enters as a constraint. We introduce the ``query per gate'' parameter and use it to prove that the quantum switch provides computational advantage for both the continuous and discrete cases. Our results should inspire implementations of promise problems using the quantum switch where parameters and therefore experimental setups can be chosen much more freely.

quant-ph↗