arXiv subjects
Publications and source records attributed to Alessandro Tosini.
We propose an operational definition of complementarity, pinning down the concept originally introduced by Bohr. Two properties of a system are considered complementary if they cannot be simultaneously well defined. We further show that, within quantum theory, this notion is equivalent to the incompatibility of operations -- that is, their inability to be performed simultaneously.
The causal effects activated by a quantum interaction are studied, modelling the last one as a bipartite unitary channel. The two parties, say Alice and Bob, can use the channel to exchange messages -- i.e. to signal. On the other hand, the most general form of causal influence includes also the possibility for Alice, via a local operation on her system, to modify Bob's correlations and viceversa. The presence or absence of these two effects are equivalent, but when they both occur, they can differ in their magnitude. We study the properties of two functions that quantify the amount of signalling and causal influence conveyed by an arbitrary unitary channel. The functions are proved to be continuous and monotonically increasing with respect to the tensor product of channels. Monotonicity is instead disproved in the case of sequential composition. Signalling and causal influence are analytically computed for the quantum SWAP and CNOT gates, in the single use scenario, in the $n$-parallel uses scenario, and in the asymptotic regime. A finite gap is found between signalling and causal influence for the quantum CNOT, thus proving the existence of extra causal effects that cannot be explained in terms of communication only. However, the gap disappears in the asymptotic limit of an infinite number of parallel uses, leaving room for asymptotic equivalence between signalling and causal influence.
We consider quantum cellular automata for one-dimensional chains of Fermionic modes and study their implementability as finite depth quantum circuits. Fermionic automata have been classified in terms of an index modulo circuits and the addition of ancillary systems. We strengthen this result removing the ancilla degrees of freedom in defining the equivalence classes. A complete characterization of nearest-neighbours automata is given. A class of Fermionic automata is found which cannot be expressed in terms of single mode and controlled-phase gates composed with shifts, as is the case for qubit cellular automata.
We introduce a class of probabilistic theories, termed Minimal Strongly Causal Operational Probabilistic Theories, where system dynamics are constrained to the minimal set of operations consistent with the set of states and permitting conditional tests. Specifically, the allowed instruments are limited to those derived from compositions of preparations, measurements, swap transformations, and conditional operations. We demonstrate that minimal theories with conditioning and a spanning set of non-separable states satisfy two quantum no-go theorems: no-information without disturbance and no-broadcasting. As a key example, we construct Minimal Strongly Causal Bilocal Classical Theory, a classical toy-theory that lacks incompatible measurements, preparation uncertainty relations, and is noncontextual (both Kochen-Specker and generalised), yet exhibits irreversibility of measurement disturbance, no-information without disturbance, and no-broadcasting. Therefore, the latter three properties cannot be understood $\textit{per se}$ as signatures of non-classicality. We further explore distinctions between a theory and its minimal strongly causal counterpart, showing that while the minimal strongly causal version of quantum theory diverges from full quantum theory, the same does not hold for classical theory. Additionally, we establish the pairwise independence of the properties of simpliciality, strong causality, and local discriminability.
The signaling dimension of a given physical system quantifies the minimum dimension of a classical system required to reproduce all input/output correlations of the given system. Thus, unlike other dimension measures - such as the dimension of the linear space or the maximum number of (jointly or pairwise) perfectly discriminable states - which examine the correlation space only along a single direction, the signaling dimension does not depend on the arbitrary choice of a specific operational task. In this sense, the signaling dimension summarizes the structure of the entire set of input/output correlations consistent with a given system in a single scalar quantity. For quantum theory, it was recently proved by Frenkel and Weiner in a seminal result that the signaling dimension coincides with the Hilbert space dimension. Here, we derive analytical and algorithmic techniques to compute the signaling dimension for any given system of any given generalized probabilistic theory. We prove that it suffices to consider extremal measurements with ray-extremal effects, and we bound the number of elements of any such measurement in terms of the linear dimension. For systems with a finite number of extremal effects, we recast the problem of characterizing the extremal measurements with ray-extremal effects as the problem of deriving the vertex description of a polytope given its face description, which can be conveniently solved by standard techniques. For each such measurement, we recast the computation of the signaling dimension as a linear program, and we propose a combinatorial branch and bound algorithm to reduce its size. We apply our results to derive the extremal measurements with ray-extremal effects of a composition of two square bits (or squits) and prove that their signaling dimension is five, even though each squit has a signaling dimension equal to two.
A causal relation between quantum agents, say Alice and Bob, is necessarily mediated by an interaction. Modelling the last one as a reversible quantum channel, an intervention of Alice can have causal influence on Bob's system, modifying correlations between Alice and Bob's systems. Causal influence between quantum systems necessarily allows for signalling. Here we prove a mismatch between causal influence and signalling via direct computation of the two quantities for the Cnot gate. Finally we show a continuity theorem for causal effects of unitary channels: a channel has small causal influence iff it allows for small signalling.
While there is general consensus on the definition of incompatible POVMs, moving up to the level of instruments one finds a much less clear situation, with mathematically different and logically independent definitions of incompatibility. Here we close this gap by introducing the notion of q-compatibility, which unifies different notions of POVMs, channels, and instruments incompatibility into one hierarchy of resource theories of communication between separated parties. The resource theories that we obtain are complete, in the sense that they contain complete families of free operations and monotones providing necessary and sufficient conditions for the existence of a transformation. Furthermore, our framework is fully operational, in the sense that free transformations are characterized explicitly, in terms of local operations aided by causally-constrained directed classical communication, and all monotones possess a game-theoretic interpretation making them experimentally measurable in principle. We are thus able to pinpoint exactly what each notion of incompatibility consists of, in terms of information-theoretic resources.
The core of Heisenberg's heuristic argument for the uncertainty principle, involving the famous $\gamma$-ray microscope $\textit{Gedankenexperiment}$, hinges upon the existence of measurements that irreversibly alter the state of the system on which they are acting, causing an irreducible disturbance on subsequent measurements. The argument was put forward to justify measurement incompatibility in quantum theory, namely, the existence of measurements that cannot be performed jointly$-$a feature that is now understood to be different from irreversibility of measurement disturbance, though related to it. In this article, on the one hand, we provide a compelling argument showing that measurement incompatibility is indeed a sufficient condition for irreversibility of measurement disturbance; while, on the other hand, we exhibit a toy theory, termed the minimal classical theory (MCT), that is a counterexample for the converse implication. This theory is classical, hence it does not have complementarity nor preparation uncertainty relations, and it is both Kochen-Specker and generalised noncontextual. However, MCT satisfies not only irreversibility of measurement disturbance, but also the properties of no-information without disturbance and no-broadcasting, implying that these cannot be understood $\textit{per se}$ as signatures of nonclassicality.
We address the problem of quantifying the information content of a source for an arbitrary information theory, where the information content is defined in terms of the asymptotic achievable compression rate. The functions that solve this problem in classical and quantum theory are Shannon's and von Neumann's entropy, respectively. However, in a general information theory there are three different functions that extend the notion of entropy, and this opens the question as to whether any of them can universally play the role of the quantifier for the information content. Here we answer the question in the negative, by evaluating the information content as well as the various entropic functions in a toy theory called Bilocal Classical Theory.
Every theory of information, including classical and quantum, can be studied in the framework of operational probabilistic theories--where the notion of test generalizes that of quantum instrument, namely a collection of quantum operations summing to a channel, and simple rules are given for the composition of tests in parallel and in sequence. Here we study the notion of compatibility for tests of an operational probabilistic theory. Following the quantum literature, we first introduce the notion of strong compatibility, and then we illustrate its ultimate relaxation, that we deem weak compatibility. It is shown that the two notions coincide in the case of observation tests--which are the counterpart of quantum POVMs--while there exist weakly compatible channels that are not strongly compatible. We prove necessary and sufficient conditions for a theory to exhibit incompatible tests. We show that a theory admits of incompatible tests if and only if some information cannot be extracted without disturbance.
The information content of a source is defined in terms of the minimum number of bits needed to store the output of the source in a perfectly recoverable way. A similar definition can be given in the case of quantum sources, with qubits replacing bits. In the mentioned cases the information content can be quantified through Shannon's and von Neumann's entropy, respectively. Here we extend the definition of information content to operational probabilistic theories, and prove relevant properties as the subadditivity, and the relation between purity and information content of a state. We prove the consistency of the present notion of information content when applied to the classical and the quantum case. Finally, the relation with one of the notions of entropy that can be introduced in general probabilistic theories, the maximum accessible information, is given in terms of a lower bound.
We address the task of compression of fermionic quantum information. Due to the parity superselection rule, differently from the case of encoding of quantum information in qubit states, part of the information carried by fermionic systems is encoded in their delocalised correlations. As a consequence, reliability of a compression protocol must be assessed in a way that necessarily accounts also for the preservation of correlations. This implies that input/output fidelity is not a satisfactory figure of merit for fermionic compression schemes. We then discuss various aspects regarding the assessment of reliability of an encoding scheme, and show that entanglement fidelity in the fermionic case is capable of evaluating the preservation of correlations, thus revealing itself strictly stronger than input/output fidelity, unlike the qubit case. We then introduce a fermionic version of the source coding theorem showing that, as in the quantum case, the von Neumann entropy is the minimal rate for which a fermionic compression scheme exists, that is reliable according to the entanglement fidelity criterion.
The paper studies unambiguous discrimination of Fermionic states through local operations and classical communication (LOCC). In the task of unambiguous discrimination, no error is tolerated but an inconclusive result is allowed. We show that contrary to the quantum case, it is not always possible to distinguish two Fermionic states through LOCC unambiguously with the same success probability as if global measurements were allowed. Furthermore, we prove that we can overcome such a limit through an ancillary system made of two Fermionic modes, independently of the dimension of the system, prepared in a maximally entangled state: in this case, LOCC protocols achieve the optimal success probability.
The range of a quantum measurement is the set of outcome probability distributions that can be produced by varying the input state. We introduce data-driven inference as a protocol that, given a set of experimental data as a collection of outcome distributions, infers the quantum measurement which is, i) consistent with the data, in the sense that its range contains all the distributions observed, and, ii) maximally noncommittal, in the sense that its range is of minimum volume in the space of outcome distributions. We show that data-driven inference is able to return a unique measurement for any data set if and only if the inference adopts a (hyper)-spherical state space (for example, the classical or the quantum bit). In analogy to informational completeness for quantum tomography, we define observational completeness as the property of any set of states that, when fed into any given measurement, produces a set of outcome distributions allowing for the correct reconstruction of the measurement via data-driven inference. We show that observational completeness is strictly stronger than informational completeness, in the sense that not all informationally complete sets are also observationally complete. Moreover, we show that for systems with a (hyper)-spherical state space, the only observationally complete simplex is the regular one, namely, the symmetric informationally complete set.
Any measurement is intended to provide information on a system, namely knowledge about its state. However, we learn from quantum theory that it is generally impossible to extract information without disturbing the state of the system or its correlations with other systems. In this paper we address the issue of the interplay between information and disturbance for a general operational probabilistic theory. The traditional notion of disturbance considers the fate of the system state after the measurement. However, the fact that the system state is left untouched ensures that also correlations are preserved only in the presence of local discriminability. Here we provide the definition of disturbance that is appropriate for a general theory. Moreover, since in a theory without causality information can be gathered also on the effect, we generalise the notion of no-information test. We then prove an equivalent condition for no-information without disturbance-atomicity of the identity-namely the impossibility of achieving the trivial evolution-the identity-as the coarse-graining of a set of non trivial ones. We prove a general theorem showing that information that can be retrieved without disturbance corresponds to perfectly repeatable and discriminating tests. Based on this, we prove a structure theorem for operational probabilistic theories, showing that the set of states of any system decomposes as a direct sum of perfectly discriminable sets, and such decomposition is preserved under system composition. As a consequence, a theory is such that any information can be extracted without disturbance only if all its systems are classical. Finally, we show via concrete examples that no-information without disturbance is independent of both local discriminability and purification.
We consider the problem of local operations and classical communication (LOCC) discrimination between two bipartite pure states of fermionic systems. We show that, contrary to the case of quantum systems, for fermionic systems it is generally not possible to achieve the ideal state discrimination performances through LOCC measurements. On the other hand, we show that an ancillary system made of two fermionic modes in a maximally entangled state is a sufficient additional resource to attain the ideal performances via LOCC measurements. The stability of the ideal results is studied when the probability of preparation of the two states is perturbed, and a tight bound on the discrimination error is derived.
A paramount topic in quantum foundations, rooted in the study of the EPR paradox and Bell inequalities, is that of characterizing quantum theory in terms of the space-like correlations it allows. Here we show that to focus only on space-like correlations is not enough: we explicitly construct a toy model theory that, while not contradicting classical and quantum theories at the level of space-like correlations, still displays an anomalous behavior in its time-like correlations. We call this anomaly, quantified in terms of a specific communication game, the "hypersignaling" phenomena. We hence conclude that the "principle of quantumness," if it exists, cannot be found in space-like correlations alone: nontrivial constraints need to be imposed also on time-like correlations, in order to exclude hypersignaling theories.
We study the solutions of the interacting Fermionic cellular automaton introduced in Ref. [Phys Rev A 97, 032132 (2018)]. The automaton is the analogue of the Thirring model with both space and time discrete. We present a derivation of the two-particles solutions of the automaton, which exploits the symmetries of the evolution operator. In the two-particles sector, the evolution operator is given by the sequence of two steps, the first one corresponding to a unitary interaction activated by two-particle excitation at the same site, and the second one to two independent one-dimensional Dirac quantum walks. The interaction step can be regarded as the discrete-time version of the interacting term of some Hamiltonian integrable system, such as the Hubbard or the Thirring model. The present automaton exhibits scattering solutions with nontrivial momentum transfer, jumping between different regions of the Brillouin zone that can be interpreted as Fermion-doubled particles, in stark contrast with the customary momentum-exchange of the one dimensional Hamiltonian systems. A further difference compared to the Hamiltonian model is that there exist bound states for every value of the total momentum, and even for vanishing coupling constant. As a complement to the analytical derivations we show numerical simulations of the interacting evolution.