arXiv subjects

Miguel Navascues

Publications and source records attributed to Miguel Navascues.

At least 19 recordsLinked to original sources

arXiv2026

Causality and realizability of local operations in quantum field theory

As noted by Sorkin, regarding quantum instruments whose Kraus operators are localizable within some spacetime region as operations accessible therein leads to superluminal communication. This so-called Sorkin paradox can be resolved by further constraining the set of allowed local operations in quantum field theory (QFT). In this spirit, Fewster and Verch proposed a framework for local QFT operations that generalizes non-relativistic quantum measurement theory and does not lead to Sorkin-like paradoxes. Shortly afterwards, Jubb (and later Oeckl) identified the minimal conditions that QFT instruments must satisfy to be compatible with Einstein's causality. In this work, we study both approaches in the quantum field theory of the free scalar field. First, we prove that a very wide class of causal instruments is FV-realizable: namely, those whose measurement channels are random displacements of the field operators. As we show, this class allows implementing arbitrary instruments in a heralded, probabilistic way, as well as non-demolition measurements deterministically. Second, we construct examples of causal channels that do not admit an approximate FV realization. Some of such causal, not FV-realizable channels violate basic physical principles, so they should not be part of any measurement theory for QFT. Third, we investigate the difficulty of characterizing the set of QFT channels that can be generated through the composition of several FV schemes. In this regard, we find a countable family of simple QFT channels for which no Turing machine can discriminate between channels within or far away from the implementable set.

hep-th↗

arXiv2025

Timed demolition measurements

Picture an experimental scenario where a closed quantum system, evolving through a time-independent Hamiltonian, is subject to a demolition measurement at a chosen time. The Hamiltonian, the measured observables, the initial state of the physical system and even its Hilbert space dimension are unknown; we nonetheless assume a promise or constraint on the energy distribution of the state. In this context we find that, for many natural energy constraints, the set of feasible time series or datasets can be characterized efficiently. Furthermore, under the assumption of a bounded energy spectrum, we prove that there exist ``self-testing'' datasets, whose approximate realization singles out specific Hamiltonians, states and measurement operators. Investigating to what extent the extrapolation of past measurement data is possible in this framework, we identify energy-constrained physical systems for which a non-trivial prediction at time $\tau$ requires a precision in the measurement data superexponential in $\tau$. We also discover two extrapolation phenomena: ``aha! datasets", which drastically increase the predictability of the future statistics of an unrelated measurement; and ``fog banks": fairly simple datasets that exhibit complete unpredictability at some future time $\tau$, but full predictability at a later time $\tau'>\tau$. Besides their relevance for quantum foundations, our results have applications in semi-device independent quantum communication, the simulation of complex quantum systems, and the design of optimal atomic clocks.

quant-ph↗

arXiv2024

Non-commutative optimization problems with differential constraints

Non-commutative polynomial optimization (NPO) problems seek to minimize the state average of a polynomial of some operator variables, subject to polynomial constraints, over all states and operators, as well as the Hilbert spaces where those might be defined. Many of these problems are known to admit a complete hierarchy of semidefinite programming (SDP) relaxations. In this work, we consider a variant of NPO problems where a subset of the operator variables satisfies a system of ordinary differential equations. We prove that, under mild conditions of operator boundedness, for every such problem one can construct a standard NPO problem with the same solution. This allows us to define a complete hierarchy of SDPs to tackle the original differential problem. We apply this method to bound averages of local observables in quantum spin systems subject to a Hamiltonian evolution (i.e., a quench). We find that, even in the thermodynamic limit of infinitely many sites, low levels of the hierarchy provide very good approximations for reasonably long evolution times.

quant-ph↗

arXiv2024

Optimisation of time-ordered processes in the finite and asymptotic regime

Many problems in quantum information theory can be formulated as optimizations over the sequential outcomes of dynamical systems subject to unpredictable external influences. Such problems include many-body entanglement detection through adaptive measurements, computing the maximum average score of a preparation game over a continuous set of target states and limiting the behavior of a (quantum) finite-state automaton. In this work, we introduce tractable relaxations of this class of optimization problems. To illustrate their performance, we use them to: (a) compute the probability that a finite-state automaton outputs a given sequence of bits; (b) develop a new many-body entanglement detection protocol; (c) let the computer invent an adaptive protocol for magic state detection. As we further show, the maximum score of a sequential problem in the limit of infinitely many time steps is in general incomputable. Nonetheless, we provide general heuristics to bound this quantity and show that they provide useful estimates in relevant scenarios.

quant-ph↗

arXiv2024

Memory attacks in network nonlocality and self-testing

We study what can or cannot be certified in communication scenarios where the assumption of independence and identical distribution (iid) between experimental rounds fails. In this respect, we prove that membership tests for non-convex sets of correlations cannot be formulated in the non-iid regime. Similarly, it is impossible to self-test non-extreme quantum operations, such as mixed states, or noisy quantum measurements, unless one allows more than a single use thereof within the same experimental round. One consequence of our results is that non-classicality in causal networks without inputs cannot be experimentally demonstrated. By analyzing optimal non-iid strategies in the triangle scenario, we raise the need to take into account the prior communication required to set up a causal network.

quant-ph↗

arXiv2023

Quantum advantages for transportation tasks: projectiles, rockets and quantum backflow

Consider a scenario where a quantum particle is initially prepared in some bounded region of space and left to propagate freely. After some time, we verify if the particle has reached some distant target region. We find that there exist "ultrafast" ("ultraslow") quantum states, whose probability of arrival is greater (smaller) than that of any classical particle prepared in the same region with the same momentum distribution. For both projectiles and rockets, we prove that the quantum advantage, quantified by the difference between the quantum and optimal classical arrival probabilities, is limited by the Bracken-Melloy constant $c_{bm}$, originally introduced to study the phenomenon of quantum backflow. In this regard, we substantiate the $29$-year-old conjecture that $c_{bm}\approx 0.038$ by proving the bounds $0.0315\leq c_{bm}\leq 0.072$. Finally, we show that, in a modified projectile scenario where the initial position distribution of the particle is also fixed, the quantum advantage can reach $0.1262$.

quant-ph↗

arXiv2023

Self-testing in prepare-and-measure scenarios and a robust version of Wigner's theorem

We consider communication scenarios where one party sends quantum states of known dimensionality $D$, prepared with an untrusted apparatus, to another, distant party, who probes them with uncharacterized measurement devices. We prove that, for any ensemble of reference pure quantum states, there exists one such prepare-and-measure scenario and a linear functional $W$ on its observed measurement probabilities, such that $W$ can only be maximized if the preparations coincide with the reference states, modulo a unitary or an anti-unitary transformation. In other words, prepare-and-measure scenarios allow one to "self-test" arbitrary ensembles of pure quantum states. Arbitrary extreme $D$-dimensional quantum measurements, or sets thereof, can be similarly self-tested. Our results rely on a robust generalization of Wigner's theorem, a well-known result in particle physics that characterizes physical symmetries.

quant-ph↗

arXiv2021

Quantum theory based on real numbers can be experimentally falsified

While complex numbers are essential in mathematics, they are not needed to describe physical experiments, expressed in terms of probabilities, hence real numbers. Physics however aims to explain, rather than describe, experiments through theories. While most theories of physics are based on real numbers, quantum theory was the first to be formulated in terms of operators acting on complex Hilbert spaces. This has puzzled countless physicists, including the fathers of the theory, for whom a real version of quantum theory, in terms of real operators, seemed much more natural. In fact, previous works showed that such "real quantum theory" can reproduce the outcomes of any multipartite experiment, as long as the parts share arbitrary real quantum states. Thus, are complex numbers really needed in the quantum formalism? Here, we show this to be case by proving that real and complex quantum theory make different predictions in network scenarios comprising independent states and measurements. This allows us to devise a Bell-like experiment whose successful realization would disprove real quantum theory, in the same way as standard Bell experiments disproved local physics.

quant-ph↗

arXiv2021

Entanglement marginal problems

We consider the entanglement marginal problem, which consists of deciding whether a number of reduced density matrices are compatible with an overall separable quantum state. To tackle this problem, we propose hierarchies of semidefinite programming relaxations of the set of quantum state marginals admitting a fully separable extension. We connect the completeness of each hierarchy to the resolution of an analog classical marginal problem and thus identify relevant experimental situations where the hierarchies are complete. For finitely many parties on a star configuration or a chain, we find that we can achieve an arbitrarily good approximation to the set of nearest-neighbour marginals of separable states with a time (space) complexity polynomial (linear) on the system size. Our results even extend to infinite systems, such as translation-invariant systems in 1D, as well as higher spatial dimensions with extra symmetries.

quant-ph↗

arXiv2021

Disease control as an optimization problem

In the context of epidemiology, policies for disease control are often devised through a mixture of intuition and brute-force, whereby the set of logically conceivable policies is narrowed down to a small family described by a few parameters, following which linearization or grid search is used to identify the optimal policy within the set. This scheme runs the risk of leaving out more complex (and perhaps counter-intuitive) policies for disease control that could tackle the disease more efficiently. In this article, we use techniques from convex optimization theory and machine learning to conduct optimizations over disease policies described by hundreds of parameters. In contrast to past approaches for policy optimization based on control theory, our framework can deal with arbitrary uncertainties on the initial conditions and model parameters controlling the spread of the disease, and stochastic models. In addition, our methods allow for optimization over policies which remain constant over weekly periods, specified by either continuous or discrete (e.g.: lockdown on/off) government measures. We illustrate our approach by minimizing the total time required to eradicate COVID-19 within the Susceptible-Exposed-Infected-Recovered (SEIR) model proposed by Kissler \emph{et al.} (March, 2020).

q-bio.PE↗

arXiv2021

Quantum Preparation Games

A preparation game is a task whereby a player sequentially sends a number of quantum states to a referee, who probes each of them and announces the measurement result. The measurement setting in each round, as well as the final score of the game, are decided by the referee based on the past history of settings and measurement outcomes. Many experimental tasks in quantum information, such as entanglement quantification or magic state detection, can be cast as preparation games. In this paper, we introduce general methods to design $n$-round preparation games, with tight bounds on the average game scores achievable by players subject to constraints on their preparation devices. We illustrate our results by devising new adaptive measurement protocols for entanglement detection and quantification. Surprisingly, we find that the standard procedure in entanglement detection, namely, estimating $n$ times the average value of a given entanglement witness, is in general sub-optimal for detecting the entanglement of a specific quantum state. On the contrary, there exist $n$-round experimental scenarios where detecting the entanglement of a known state optimally requires adaptive measurement schemes.

quant-ph↗

arXiv2021

Quantum Inflation: A General Approach to Quantum Causal Compatibility

Causality is a seminal concept in science: Any research discipline, from sociology and medicine to physics and chemistry, aims at understanding the causes that could explain the correlations observed among some measured variables. While several methods exist to characterize classical causal models, no general construction is known for the quantum case. In this work, we present quantum inflation, a systematic technique to falsify if a given quantum causal model is compatible with some observed correlations. We demonstrate the power of the technique by reproducing known results and solving open problems for some paradigmatic examples of causal networks. Our results may find applications in many fields: from the characterization of correlations in quantum networks to the study of quantum effects in thermodynamic and biological processes.

quant-ph↗

arXiv2020

Genuine Network Multipartite Entanglement

The standard definition of genuine multipartite entanglement stems from the need to assess the quantum control over an ever-growing number of quantum systems. We argue that this notion is easy to hack: in fact, a source capable of distributing bipartite entanglement can, by itself, generate genuine $k$-partite entangled states for any $k$. We propose an alternative definition for genuine multipartite entanglement, whereby a quantum state is genuinely network $k$-entangled if it cannot be produced by applying local trace-preserving maps over several $k$-partite states distributed among the parties, even with the aid of global shared randomness. We provide analytic and numerical witnesses of genuine network entanglement, and we reinterpret many past quantum experiments as demonstrations of this feature.

quant-ph↗

arXiv2020

Translating Uncontrolled Systems in Time

We show that there exist non-relativistic scattering experiments which, if successful, freeze out, speed up or even reverse the free dynamics of any ensemble of quantum systems present in the scattering region. This time translation effect is universal, i.e., it is independent of the particular interaction between the scattering particles and the target systems, or the (possibly non-Hermitian) Hamiltonian governing the evolution of the latter. The protocols require careful preparation of the probes which are scattered, and success is heralded by projective measurements of these probes at the conclusion of the experiment. We fully characterize the possible time translations which we can effect on multiple target systems through a scattering protocol of fixed duration. The core results are: a) when the target is a single system, we can translate it backwards in time for an amount proportional to the experimental runtime; b) when n targets are present in the scattering region, we can make a single system evolve n times faster (backwards or forwards), at the cost of keeping the remaining systems stationary in time. For high n our protocols therefore allow one to map, in short experimental time, a system to the state it would have reached with a very long unperturbed evolution in either positive or negative time.

quant-ph↗

arXiv2020

The Inflation Technique Completely Solves the Causal Compatibility Problem

The causal compatibility question asks whether a given causal structure graph -- possibly involving latent variables -- constitutes a genuinely plausible causal explanation for a given probability distribution over the graph's observed variables. Algorithms predicated on merely necessary constraints for causal compatibility typically suffer from false negatives, i.e. they admit incompatible distributions as apparently compatible with the given graph. In [arXiv:1609.00672], one of us introduced the inflation technique for formulating useful relaxations of the causal compatibility problem in terms of linear programming. In this work, we develop a formal hierarchy of such causal compatibility relaxations. We prove that inflation is asymptotically tight, i.e., that the hierarchy converges to a zero-error test for causal compatibility. In this sense, the inflation technique fulfills a longstanding desideratum in the field of causal inference. We quantify the rate of convergence by showing that any distribution which passes the $n^{th}$-order inflation test must be $O\left(n^{-1/2}\right)$-close in Euclidean norm to some distribution genuinely compatible with the given causal structure. Furthermore, we show that for many causal structures, the (unrelaxed) causal compatibility problem is faithfully formulated already by either the first or second order inflation test.

quant-ph↗

arXiv2019

Bounding the sets of classical and quantum correlations in networks

We present a method that allows the study of classical and quantum correlations in networks with causally-independent parties, such as the scenario underlying entanglement swapping. By imposing relaxations of factorization constraints in a form compatible with semidefinite programming, it enables the use of the Navascués-Pironio-Acín hierarchy in complex quantum networks. We first show how the technique successfully identifies correlations not attainable in the entanglement-swapping scenario. Then we use it to show how the nonlocal power of measurements can be activated in a network: there exist measuring devices that, despite being unable to generate nonlocal correlations in the standard Bell scenario, provide a classical-quantum separation in an entanglement swapping configuration.

quant-ph↗

arXiv2019

Connector tensor networks: a renormalization-type approach to quantum certification

As quantum technologies develop, we acquire control of an ever-growing number of quantum systems. Unfortunately, current tools to detect relevant quantum properties of quantum states, such as entanglement and Bell nonlocality, suffer from severe scalability issues and can only be computed for systems of a very modest size, of around $6$ sites. In order to address large many-body systems, we propose a renormalisation-type approach based on a class of local linear transformations, called connectors, which can be used to coarse-grain the system in a way that preserves the property under investigation. Repeated coarse-graining produces a system of manageable size, whose properties can then be explored by means of usual techniques for small systems. In case of a successful detection of the desired property, the method outputs a linear witness which admits an exact tensor network representation, composed of connectors. We demonstrate the power of our method by certifying using a normal desktop computer entanglement, Bell nonlocality and supra-quantum Bell nonlocality in systems with hundreds of sites.

quant-ph↗

arXiv2019

Theoretical research without projects

We propose a funding scheme for theoretical research that does not rely on project proposals, but on recent past scientific productivity. Given a quantitative figure of merit on the latter and the total research budget, we introduce a number of policies to decide the allocation of funds in each grant call. Under some assumptions on scientific productivity, some of such policies are shown to converge, in the limit of many grant calls, to a funding configuration that is close to the maximum total productivity of the whole scientific community. We present numerical simulations showing evidence that these schemes would also perform well in the presence of statistical noise in the scientific productivity and/or its evaluation. Finally, we prove that one of our policies cannot be cheated by individual research units. Our work must be understood as a first step towards a mathematical theory of the research activity.

math.OC↗