SearcharxivSearch

arXiv subjects

John Calsamiglia

Publications and source records attributed to John Calsamiglia.

At least 19 recordsLinked to original sources

Quantum sequential parameter testing

Sequential strategies in hypothesis testing use a variable number of measurement rounds, allowing a decision to be made as soon as the observed data provide a prescribed level of error tolerance. Although sequential testing is well established for a discrete set of hypotheses, extending this framework to a continuous parameter space poses additional challenges and has remained largely unexplored. In this article, we introduce sequential \textit{parameter testing}, a framework for determining an unknown parameter up to a prescribed tolerance by ruling out sufficiently distant competing values with a target error tolerance. We clarify its operational distinction from conventional parameter estimation and develop sequential tests for continuous families of hypotheses, introducing the \textit{twin-peaks test} as a natural and computationally efficient analog of sequential likelihood-ratio testing. We apply the framework to two paradigmatic quantum tasks: testing the phase and the purity of a qubit. For phase testing, we show numerically that adaptive projective measurements achieve the same average sample cost as collective covariant measurements with a fixed number of copies. For purity testing, local measurements are optimal, and sequential parameter testing yields significant average sample savings over fixed sample-size protocols. Our results establish parameter testing as an operationally meaningful framework for resource-efficient certification tasks involving continuous parameters.

quant-ph

Approach to optimal quantum transport via states over time

We approach the problem of constructing a quantum analogue of the immensely fruitful classical transport cost theory of Monge from a new angle. Going back to the original motivations, by which the transport is a bilinear function of a mass distribution (without loss of generality a probability density) and a transport plan (a stochastic kernel), we explore the quantum version where the mass distribution is generalised to a density matrix, and the transport plan to a completely positive and trace preserving map. % These two data are naturally integrated into their Jordan product, which is called state over time (``stote''), and the transport cost is postulated to be a linear function of it. We explore the properties of this transport cost, as well as the optimal transport cost between two given states (simply the minimum cost over all suitable transport plans). After that, we analyse in considerable detail the case of unitary invariant cost, for which we can calculate many costs analytically. These findings suggest that our quantum transport cost is qualitatively different from Monge's classical transport.

quant-ph

Quantum-Enhanced Zero-Error Communication and Storage under Positional Uncertainty

Permutation channels model communication and storage scenarios in which the positional identity of the physical carriers is partially or completely lost, so that the transmitted information is only accessible up to an unknown reordering. Here we show that quantum mechanics can dramatically enhance zero-error communication through such channels. For cyclic reorderings of $n$ $d$-level systems, and in the absence of positional metadata, the number of classical zero-error messages scales asymptotically as $d^n/n$, whereas quantum protocols can fully recover the identity-channel value $d^n$. Ancilla-assisted protocols further increase this number to $d^{2n}/n$, enabling dense coding under positional uncertainty. We also analyze dihedral permutation channels and derive general Pólya-like formulas for the number of distinguishable messages in a broad class of permutation groups. Finally, for the symmetric group $S_n$, corresponding to complete scrambling of the information carriers, the number of distinguishable messages scales as $n^{d-1}$ classically, compared with $n^{d(d+1)/2-1}$ for quantum protocols and $n^{d^2-1}$ in the ancilla-assisted setting. Our results establish a fundamental quantum advantage for communication and storage under positional uncertainty.

quant-ph

Quantum Advantage in Identifying the Parity of Permutations with Certainty

We establish a sharp quantum advantage in determining the parity (even/odd) of an unknown permutation applied to any number $n \ge 3$ of particles. Classically, this is impossible with fewer than $n$ labels, being that the success is limited to random guessing. Quantum mechanics does it with certainty with as few as $\lceil \sqrt{n}\, \rceil$ distinguishable states per particle, thanks to entanglement. Below this threshold, not even quantum mechanics helps: both classical and quantum success are limited to random guessing. For small $n$, we provide explicit expressions for states that ensure perfect parity identification. We also assess the minimum entanglement these states need to carry, finding it to be close to maximal, and even maximal in some cases. The task requires no oracles or contrived setups and provides a simple, rigorous example of genuine quantum advantage.

quant-ph

Sequential analysis in a continuous spin-noise quantum sensor

Many control and detection applications require real-time analysis of signals from sensors, in order to quickly and accurately act upon events revealed by the sensors. Such signal analysis benefits from statistical models of signal and sensor behavior. This creates a need for data analysis methods that are simultaneously model-based, computationally efficient and causal, in the sense that they employ only sensor data available prior to a specific point in time. In this work, we implement sequential data analysis techniques on a spin-noise-based quantum sensor, to perform two key tasks: hypothesis testing and quickest change-point detection. These online protocols allow us to detect weak magnetic fields by adaptively collecting measurement data until a predefined confidence threshold is reached. We demonstrate these methods in a realistic experimental setting and derive performance bounds for the achievable precision and response time. Our approach has potential utility when detecting small perturbations to the magnetic field, in both applied and fundamental contexts including biomagnetism, geophysical surveys, detection of concealed materials, searches for dark matter candidates and exotic spin interactions. Our results demonstrate that sequential techniques enable faster and more sensitive detection, making them a powerful tool for quantum sensing.

quant-ph

From dynamical to steady-state many-body metrology: Precision limits and their attainability with two-body interactions

We consider the estimation of an unknown parameter $θ$ via a many-body probe. The probe is initially prepared in a product state and many-body time-independent interactions enhance its $θ$-sensitivity during the dynamics and/or in the steady state. We present bounds on the Quantum Fisher Information, and corresponding optimal interacting Hamiltonians, for two paradigmatic scenarios for encoding~$θ$: (i)~via unitary Hamiltonian dynamics (dynamical metrology), and (ii)~in the Gibbs and diagonal ensembles (time-averaged dephased state), two ubiquitous steady states of many-body open dynamics. We then move to the specific problem of estimating the strength of a magnetic field via interacting spins and derive two-body interacting Hamiltonians that can approach the fundamental precision bounds. In this case, we additionally analyze the transient regime leading to the steady states and characterize tradeoffs between equilibration times and measurement precision. Overall, our results provide a comprehensive picture of the potential of many-body control in quantum sensing.

quant-ph

An information-theoretic proof of the Planckian bound for thermalization

We demonstrate that quantum mechanics entails a fundamental lower bound on the thermalization time $τ$ of any system. At finite temperature, we show that $τ$ is bounded by half the Planckian dissipation time, $τ\geq τ_{\rm Pl}/2$ with $τ_{\rm Pl} = \hbar/(k_{\rm B} T)$. In the low-temperature regime, our bound takes the form $τ\geq \hbar / Δ$ with $Δ$ the spectral gap, in close connection with the quantum adiabatic theorem. These bounds, rooted in Hamiltonian estimation, hold for arbitrary quantum processes that output states close to the corresponding thermal ensemble for a nontrivial class of Hamiltonians.

quant-ph

Quantum Edge Detection

This paper introduces quantum edge detection, aimed at locating boundaries of quantum domains where all particles share the same pure state. Focusing on the 1D scenario of a string of particles, we develop an optimal protocol for quantum edge detection, efficiently computing its success probability through Schur-Weyl duality and semidefinite programming techniques. We analyze the behavior of the success probability as a function of the string length and local dimension, with emphasis in the limit of long strings. We present a protocol based on square root measurement, which proves asymptotically optimal. Additionally, we explore a mixed quantum change point detection scenario where the state of particles transitions from known to unknown, which may find practical applications in detecting malfunctions in quantum devices

quant-ph

Fundamental limits of metrology at thermal equilibrium

We consider the estimation of an unknown parameter $θ$ through a quantum probe at thermal equilibrium. The probe is assumed to be in a Gibbs state according to its Hamiltonian $H_θ$, which is divided in a parameter-encoding term $H^{\rm P}_θ$ and an additional, parameter-independent, control $H^{\rm C}$. Given a fixed encoding, we find the maximal Quantum Fisher Information attainable via arbitrary $H^{\rm C}$, which provides a fundamental bound on the measurement precision. We elucidate the role of quantum coherence between encoding and control in different temperature regimes, which include ground state metrology as a limiting case. In the case of locally-encoded parameters, the optimal sensitivity presents a $N^2$-scaling in terms of the number of particles of the probe, which can be reached, at finite temperature, with local measurements and no entanglement. We apply our results to paradigmatic spin chain models, showing that these fundamental limits can be approached using local two-body interactions. Our results set the fundamental limits and optimal control for metrology with thermal and ground state probes, including probes at the verge of criticality.

quant-ph

Sequential hypothesis testing for continuously-monitored quantum systems

We consider a quantum system that is being continuously monitored, giving rise to a measurement signal. From such a stream of data, information needs to be inferred about the underlying system's dynamics. Here we focus on hypothesis testing problems and put forward the usage of sequential strategies where the signal is analyzed in real time, allowing the experiment to be concluded as soon as the underlying hypothesis can be identified with a certified prescribed success probability. We analyze the performance of sequential tests by studying the stopping-time behavior, showing a considerable advantage over currently-used strategies based on a fixed predetermined measurement time.

quant-ph

Ultimate limits for quickest quantum change-point detection

Detecting abrupt changes in data streams is crucial because they are often triggered by events that have important consequences if left unattended. Quickest change point detection has become a vital sequential analysis primitive that aims at designing procedures that minimize the expected detection delay of a change subject to a bounded expected false alarm time. We put forward the quantum counterpart of this fundamental primitive on streams of quantum data. We give a lower-bound on the mean minimum delay when the expected time of a false alarm is asymptotically large, under the most general quantum detection strategy, which is given by a sequence of adaptive collective (potentially weak) measurements on the growing string of quantum data. In addition, we give particular strategies based on repeated measurements on independent blocks of samples, that asymptotically attain the lower-bound, and thereby establish the ultimate quantum limit for quickest change point detection. Finally, we discuss online change point detection in quantum channels.

quant-ph

Universal algorithms for quantum data learning

Operating quantum sensors and quantum computers would make data in the form of quantum states available for purely quantum processing, opening new avenues for studying physical processes and certifying quantum technologies. In this Perspective, we review a line of works dealing with measurements that reveal structural properties of quantum datasets given in the form of product states. These algorithms are universal, meaning that their performances do not depend on the reference frame in which the dataset is provided. Requiring the universality property implies a characterization of optimal measurements via group representation theory.

quant-ph

Reinforcement-learning calibration of coherent-state receivers on variable-loss optical channels

We study the problem of calibrating a quantum receiver for optical coherent states when transmitted on a quantum optical channel with variable transmissivity, a common model for long-distance optical-fiber and free/deep-space optical communication. We optimize the error probability of legacy adaptive receivers, such as Kennedy's and Dolinar's, on average with respect to the channel transmissivity distribution. We then compare our results with the ultimate error probability attainable by a general quantum device, computing the Helstrom bound for mixtures of coherent-state hypotheses, for the first time to our knowledge, and with homodyne measurements. With these tools, we first analyze the simplest case of two different transmissivity values; we find that the strategies adopted by adaptive receivers exhibit strikingly new features as the difference between the two transmissivities increases. Finally, we employ a recently introduced library of shallow reinforcement learning methods, demonstrating that an intelligent agent can learn the optimal receiver setup from scratch by training on repeated communication episodes on the channel with variable transmissivity and receiving rewards if the coherent-state message is correctly identified.

quant-ph

Squeezing-enhanced communication without a phase reference

We study the problem of transmitting classical information using quantum Gaussian states on a family of phase-noise channels with a finite decoherence time, such that the phase-reference is lost after $m$ consecutive uses of the transmission line. This problem is relevant for long-distance communication in free space and optical fiber, where phase noise is typically considered as a limiting factor. The Holevo capacity of these channels is always attained with photon-number encodings, challenging with current technology. Hence for coherent-state encodings the optimal rate depends only on the total-energy distribution and we provide upper and lower bounds for all $m$, the latter attainable at low energies with on/off modulation and photodetection. We generalize this lower bound to squeezed-coherent encodings, exhibiting for the first time to our knowledge an unconditional advantage with respect to any coherent encoding for $m=1$ and a considerable advantage with respect to its direct coherent counterpart for $m>1$. This advantage is robust with respect to moderate attenuation, and persists in a regime where Fock encodings with up to two-photon states are also suboptimal. Finally, we show that the use of part of the energy to establish a reference frame is sub-optimal even at large energies. Our results represent a key departure from the case of phase-covariant Gaussian channels and constitute a proof-of-principle of the advantages of using non-classical, squeezed light in a motivated communication setting.

quant-ph

Quantum Sequential Hypothesis Testing

We introduce sequential analysis in quantum information processing, by focusing on the fundamental task of quantum hypothesis testing. In particular our goal is to discriminate between two arbitrary quantum states with a prescribed error threshold, $ε$, when copies of the states can be required on demand. We obtain ultimate lower bounds on the average number of copies needed to accomplish the task. We give a block-sampling strategy that allows to achieve the lower bound for some classes of states. The bound is optimal in both the symmetric as well as the asymmetric setting in the sense that it requires the least mean number of copies out of all other procedures, including the ones that fix the number of copies ahead of time. For qubit states we derive explicit expressions for the minimum average number of copies and show that a sequential strategy based on fixed local measurements outperforms the best collective measurement on a predetermined number of copies. Whereas for general states the number of copies increases as $\log 1/ε$, for pure states sequential strategies require a finite average number of samples even in the case of perfect discrimination, i.e., $ε=0$.

quant-ph

Beyond the swap test: optimal estimation of quantum state overlap

We study the estimation of the overlap between two unknown pure quantum states of a finite dimensional system, given $M$ and $N$ copies of each type. This is a fundamental primitive in quantum information processing that is commonly accomplished from the outcomes of $N$ swap-tests, a joint measurement on one copy of each type whose outcome probability is a linear function of the squared overlap. We show that a more precise estimate can be obtained by allowing for general collective measurements on all copies. We derive the statistics of the optimal measurement and compute the optimal mean square error in the asymptotic pointwise and finite Bayesian estimation settings. Besides, we consider two strategies relying on the estimation of one or both the states, and show that, although they are suboptimal, they outperform the swap test. In particular, the swap test is extremely inefficient for small values of the overlap, which become exponentially more likely as the dimension increases. Finally, we show that the optimal measurement is less invasive than the swap test and study the robustness to depolarizing noise for qubit states.

quant-ph

Accessible coherence in open quantum system dynamics

Quantum coherence generated in a physical process can only be cast as a potentially useful resource if its effects can be detected at a later time. Recently, the notion of non-coherence-generating-and-detecting (NCGD) dynamics has been introduced and related to the classicality of the statistics associated with sequential measurements at different times. However, in order for a dynamics to be NCGD, its propagators need to satisfy a given set of conditions for all triples of consecutive times. We reduce this to a finite set of $d(d-1)$ conditions, where $d$ is the dimension of the quantum system, provided that the generator is time-independent. Further conditions are derived for the more general time-dependent case. The application of this result to the case of a qubit dynamics allows us to elucidate which kind of noise gives rise to non-coherence-generation-and-detection.

quant-ph

Unsupervised classification of quantum data

We introduce the problem of unsupervised classification of quantum data, namely, of systems whose quantum states are unknown. We derive the optimal single-shot protocol for the binary case, where the states in a disordered input array are of two types. Our protocol is universal and able to automatically sort the input under minimal assumptions, yet partially preserving information contained in the states. We quantify analytically its performance for arbitrary size and dimension of the data. We contrast it with the performance of its classical counterpart, which clusters data that has been sampled from two unknown probability distributions. We find that the quantum protocol fully exploits the dimensionality of the quantum data to achieve a much higher performance, provided data is at least three-dimensional. For the sake of comparison, we discuss the optimal protocol when the classical and quantum states are known.

quant-ph