Searcharxiv⌕ Search

arXiv subjects

Costantino Budroni

Publications and source records attributed to Costantino Budroni.

At least 19 recordsLinked to original sources

Strict hierarchy between $n$-wise measurement simulability, compatibility structures, and multi-copy compatibility

The incompatibility of quantum measurements, i.e. the fact that certain observable quantities cannot be measured jointly is widely regarded as a distinctive quantum feature with important implications for the foundations and the applications of quantum information theory. While the standard incompatibility of multiple measurements has been the focus of attention since the inception of quantum theory, its generalizations, such as measurement simulability, $n$-wise incompatibility, and mulit-copy incompatibility have only been proposed recently. Here, we point out that all these generalizations are differing notions of the question of how many measurements are genuinely contained in a measurement device. We then show, that all notions do differ not only in their operational meaning but also mathematically in the set of measurement assemblages they describe. We then fully resolve the relations between these different generalizations, by showing a strict hierarchy between these notions. Hence, we provide a general framework for generalized measurement incompatibility. Finally, we consider the implications our results have for recent works using these different notions.

quant-ph↗

Least Variable Quantum Counting Processes

Counting processes provide a fundamental description of stochastic events ranging from photon detection to clock ticks. A central question is how accurately such events can be timed when only finite memory resources are available. Here, we investigate this problem within a general framework of finite-dimensional classical and quantum counting processes. We derive a rigorous finite-memory variance bound obeyed by every classical $d$-state counting process, which is tight and saturated by a discrete Erlang-type ladder process. Through numerical optimization, we identify quantum counting processes that violate this classical bound, achieving smaller first-tick fluctuations than any classical process with the same memory size and mean tick time. For the qubit case, we further derive an analytical large-mean bound within a single-Kraus no-tick family, showing that the quantum advantage persists asymptotically within this class. The optimized quantum processes exhibit coherent conditioned dynamics and approach a continuous-time quantum-jump description as the mean increases. Our results establish a finite-memory quantum advantage in temporal precision and connect discrete-time counting processes with continuous-time quantum timekeeping.

quant-ph↗

Entanglement-breaking channels are a quantum memory resource

Entanglement-breaking channels (equivalently, measure-and-prepare channels) are an important class of quantum operations noted for their ability to destroy multipartite spatial quantum correlations. Inspired by this property, they have also been employed in defining notions of "classical memory", under the assumption that such channels effectively act as a classical resource. We show that, in a single-system multi-time scenario, entanglement-breaking channels are still a quantum memory resource: a qudit going through an entanglement-breaking channel cannot be simulated by a classical system of same dimension. We provide explicit examples of memory-based output generation tasks where entanglement-breaking channels outperform classical memories of the same size. Our results imply that entanglement-breaking channels cannot be generally employed to characterize classical memory effects in temporal scenarios without additional assumptions.

quant-ph↗

Entanglement detection in quantum materials with competing orders

We investigate entanglement detection in quantum materials through criteria based on the simultaneous suppression of collective matter excitations. Unlike other detection schemes, these criteria can be applied to continuous and unbounded variables. By considering a system of interacting dipoles on a lattice, we show the detection of collective entanglement arising from two different physical mechanisms, namely, the ferroelectric ordering and the dressing of matter degrees of freedom by light. In the latter case, the detection shows the formation of a collective entangled phase not directly related to spontaneous symmetry breaking. These results open a new perspective for the entanglement characterization of competing orders in quantum materials, and have direct application to quantum paraelectrics with large polariton splittings.

cond-mat.str-el↗

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↗

Measurement incompatibility cannot be stochastically distilled

We show that the incompatibility of a set of measurements cannot be increased by subjecting them to a filter, namely, by combining them with a device that post-selects the incoming states on a fixed outcome of a stochastic transformation. This result holds for several measures of incompatibility, such as those based on robustness and convex weight. Expanding these ideas to Einstein-Podolsky-Rosen steering experiments, we are able to solve the problem of the maximum steerability obtained with respect to the most general local filters in a way that allows for an explicit calculation of the filter operation. Moreover, our results generalize to nonphysical maps, i.e., positive but not completely positive linear maps.

quant-ph↗

Indefinite causal order in boxworld theories

An astonishing feature of higher-order quantum theory is that it can accommodate indefinite causal order. In the simplest bipartite setting, there exist signaling correlations for which it is fundamentally impossible to ascribe a definite causal order for the parties' actions. Moreover, the assumptions required to arrive at such a statement (local quantum transformations and well-behaved probabilities) result in a nontrivial set of correlations, whose boundary is, to date, uncharacterized. In this work, we investigate indefinite causal order in boxworld theories. We construct a higher-order theory whose descriptor is the generalized bit (gbit) - the natural successor of the classical bit and quantum qubit. By fixing the local transformations in boxworld and asking about the global causal structure, we find that we trivially recover the full set of two-way signaling correlations. In light of this, we motivate and propose two physical principles in order to limit the set of achievable correlations: nonsignaling preservation and no signaling without system exchange. We find that a higher-order boxworld theory that respects these physical principles leads to (i) a nontrivial set of achievable correlations and (ii) a violation of some causal inequalities that is higher than what can be achieved in higher-order quantum theory. These results lead us to conjecture that the set of correlations of our higher-order boxworld theory is an outer approximation to the set of correlations produced by higher-order quantum theory.

quant-ph↗

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↗

Leggett-Garg Macrorealism and temporal correlations

Leggett and Garg formulated macrorealist models encoding our intuition on classical systems, i.e., physical quantities have a definite value that can be measured with minimal disturbance, and with the goal of testing macroscopic quantum coherence effects. The associated inequalities, involving the statistics of sequential measurements on the system, are violated by quantum mechanical predictions and experimental observations. Such tests, however, are subject to loopholes: a classical explanation can be recovered assuming specific models of measurement disturbance. We review recent theoretical and experimental progress in characterizing macrorealist and quantum temporal correlations, and in closing loopholes associated with Leggett-Garg tests. Finally, we review recent definitions of nonclassical temporal correlations, which go beyond macrorealist models by relaxing the assumption on the measurement disturbance, and their applications in sequential quantum information processing.

quant-ph↗

Witnessing environment dimension through temporal correlations

We introduce a framework to compute upper bounds for temporal correlations achievable in open quantum system dynamics, obtained by repeated measurements on the system. As these correlations arise by virtue of the environment acting as a memory resource, such bounds are witnesses for the minimal dimension of an effective environment compatible with the observed statistics. These witnesses are derived from a hierarchy of semidefinite programs with guaranteed asymptotic convergence. We compute non-trivial bounds for various sequences involving a qubit system and a qubit environment, and compare the results to the best known quantum strategies producing the same outcome sequences. Our results provide a numerically tractable method to determine bounds on multi-time probability distributions in open quantum system dynamics and allow for the witnessing of effective environment dimensions through probing of the system alone.

quant-ph↗

Characterisation and fundamental limitations of irreversible stochastic steering distillation

Steering resources, central for quantum advantages in one-sided device-independent quantum information tasks, can be enhanced via local filters. Recently, reversible steering conversion under local filters has been fully characterised. Here, we solve the problem in the irreversible scenario, which leads to a complete understanding of stochastic steering distillation. This result also provides an operational interpretation of the max-relative entropy as the optimal filter success probability. We further show that all steering measures can be used to quantify measurement incompatibility in certain stochastic steering distillation scenarios. Finally, for a broad class of steering robustness measures, we show that their maximally achievable values in stochastic steering distillation are always upper bounded by different types of incompatibility robustness measures. Hence, measurement incompatibility sets the fundamental limitations for stochastic steering distillation.

quant-ph↗

Kochen-Specker Contextuality

A central result in the foundations of quantum mechanics is the Kochen-Specker theorem. In short, it states that quantum mechanics is in conflict with classical models in which the result of a measurement does not depend on which other compatible measurements are jointly performed. Here compatible measurements are those that can be implemented simultaneously or, more generally, those that are jointly measurable. This conflict is generically called quantum contextuality. In this review, an introduction to this subject and its current status is presented. Several proofs of the Kochen-Specker theorem and different notions of contextuality are reviewed. How to experimentally test some of these notions is explained and connections between contextuality and nonlocality or graph theory are discussed. Finally, some applications of contextuality in quantum information processing are reviewed.

quant-ph↗

Complete classification of steerability under local filters and its relation with measurement incompatibility

Quantum steering is the central resource for one-sided device-independent quantum information. It is manipulated via one-way local operations and classical communication, such as local filtering on the trusted party. Here, we provide a necessary and sufficient condition for a steering assemblage to be transformable into another one via local filtering. We characterize the equivalence classes with respect to filters in terms of the steering equivalent observables measurement assemblage (SEO), first proposed to connect the problem of steerability with measurement incompatibility. We provide an efficient method to compute the maximal extractable steerability via local filters and show that it coincides with the incompatibility of the SEO. Moreover, we show that there always exists a bipartite state that provides an assemblage with steerability equal to the incompatibility of the measurements on the untrusted party. Finally, we investigate the optimal success probability and rates for transformation protocols (distillation and dilution) in the single-shot scenario together with examples.

quant-ph↗

Temporal correlations in the simplest measurement sequences

We investigate temporal correlations in the simplest measurement scenario, i.e., that of a physical system on which the same measurement is performed at different times, producing a sequence of dichotomic outcomes. The resource for generating such sequences is the internal dimension, or memory, of the system. We characterize the minimum memory requirements for sequences to be obtained deterministically, and numerically investigate the probabilistic behavior below this memory threshold, in both classical and quantum scenarios. A particular class of sequences is found to offer an upper-bound for all other sequences, which suggests a nontrivial universal upper-bound of $1/e$ for the classical probability of realization of any sequence below this memory threshold. We further present evidence that no such nontrivial bound exists in the quantum case.

quant-ph↗

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↗

Ticking-clock performance enhanced by nonclassical temporal correlations

We investigate the role of nonclassical temporal correlations in enhancing the performance of ticking clocks in a discrete-time scenario. We show that the problem of optimal models for ticking clocks is related to the violation of Leggett-Garg-type temporal inequalities formulated in terms of, possibly invasive, sequential measurements, but on a system with a bounded memory capacity. Ticking clocks inspire the derivation of a family of temporal inequalities showing a gap between classical and quantum correlations, despite involving no input. We show that quantum ticking-clock models achieving accuracy beyond the classical bound are also those violating Leggett-Garg-type temporal inequalities for finite sequences and we investigate their continuous-time limit. Interestingly, we show that optimal classical clock models in the discrete-time scenario do not have a well-defined continuous-time limit, a feature that is absent in quantum models.

quant-ph↗

Device-independent quantification of measurement incompatibility

Incompatible measurements, i.e., measurements that cannot be simultaneously performed, are necessary to observe nonlocal correlations. It is natural to ask, e.g., how incompatible the measurements have to be to achieve a certain violation of a Bell inequality. In this work, we provide the direct link between Bell nonlocality and the quantification of measurement incompatibility. This includes quantifiers for both incompatible and genuine-multipartite incompatible measurements. Our method straightforwardly generalizes to include constraints on the system's dimension (semi-device-independent approach) and on projective measurements, providing improved bounds on incompatibility quantifiers, and to include the prepare-and-measure scenario.

quant-ph↗

Quantum Temporal Superposition: the case of QFT

Quantum field theory is completely characterized by the field correlations between spacetime points. In turn, some of these can be accessed by locally coupling to the field simple quantum systems, a.k.a. particle detectors. In this work, we consider what happens when a quantum-controlled superposition of detectors at different space-time points is used to probe the correlations of the field. We show that, due to quantum interference effects, two detectors can gain information on field correlations which would not be otherwise accessible. This has relevant consequences for information theoretic quantities, like entanglement and mutual information harvested from the field. In particular, the quantum control allows for extraction of entanglement in scenarios where this is otherwise provably impossible.

quant-ph↗