works on

From the 4 of 88 papers with an AI index.

most citedQ penalties due to pump phase modulation and pump RIN in fiber optic parametric amplifiers with non-uniform dispersion

40 citations

Showing quant-phShow all

13 papers · 1 filter

quant-ph2026

Measurement incompatibility and quantum steering via linear programming

Lucas E. A. Porto, Sébastien Designolle, Sebastian Pokutta +1

The problem of deciding whether a set of quantum measurements is jointly measurable is known to be equivalent to determining whether a quantum assemblage is unsteerable. This probl…

quant-ph2026

Absorption-based qubit estimation in discrete-time quantum walks

Edgard P. M. Amorim, Lorena R. Cerutti, O. P. de Sá Neto +1

We investigate state estimation in discrete-time quantum walks with a single absorbing boundary. Using a spectral approach, we obtain closed expressions for the escape probability…

quant-ph2026

Over forty years of research towards the understanding of Quantum Brownian Motion -- the contributions of A. O. Caldeira

Marcus V. S. Bonança, Marcus V. S. Bonança, Sebastian Deffner +1

This article presents a brief account of Amir O. Caldeira's contributions to the theory of quantum Brownian motion. Motivated by its importance, we outline the description of Brown…

quant-ph2026

Can outcome communication explain Bell nonlocality?

Carlos Vieira, Carlos de Gois, Pedro Lauand +3

A central aspect of quantum information is that correlations between spacelike separated observers sharing entangled states cannot be reproduced by local hidden variable (LHV) mode…

quant-ph2026

Structure of quantum measurements implementable with one round of classical communication

Arthur C. R. Dutra, Ties-A. Ohst, Hai-Chau Nguyen +1

Measurements that can be implemented via local operations and classical communication (LOCC) constitute a class of operations that is available in future quantum networks in which…

quant-ph2026

FALQON-MST: A Fully Quantum Framework for Graph Optimization in Vision Systems

Guilherme E. L. Pexe, Lucas A. M. Rattighieri, Leandro A. Passos +4

Finding the minimum spanning tree (MST) of a graph is an important task in computer vision, as it enables a sparse and low-cost representation of connectivity among elements (such…