186,252 research outputs found

    Cellular automata in operational probabilistic theories

    No full text
    The theory of cellular automata in operational probabilistic theories is developed. We start introducing the composition of infinitely many elementary systems, and then use this notion to define update rules for such infinite composite systems. The notion of causal influence is introduced, and its relation with the usual property of signalling is discussed. We then introduce homogeneity, namely the property of an update rule to evolve every system in the same way, and prove that systems evolving by a homogeneous rule always correspond to vertices of a Cayley graph. Next, we define the notion of locality for update rules. Cellular automata are then defined as homogeneous and local update rules. Finally, we prove a general version of the wrapping lemma, that connects CA on different Cayley graphs sharing some small-scale structure of neighbourhoods

    Theoretical framework for higher-order quantum theory

    No full text
    Higher-order quantum theory is an extension of quantum theory where one introduces transformations whose input and output are transformations, thus generalizing the notion of channels and quantum operations. The generalization then goes recursively, with the construction of a full hierarchy of maps of increasingly higher order. The analysis of special cases already showed that higher-order quantum functions exhibit features that cannot be tracked down to the usual circuits, such as indefinite causal structures, providing provable advantages over circuital maps. The present treatment provides a general framework where this kind of analysis can be carried out in full generality. The hierarchy of higher-order quantum maps is introduced axiomatically with a formulation based on the language of types of transformations. Complete positivity of higher-order maps is derived from the general admissibility conditions instead of being postulated as in previous approaches. The recursive characterization of convex sets of maps of a given type is used to prove equivalence relations between different types. The axioms of the framework do not refer to the specific mathematical structure of quantum theory, and can therefore be exported in the context of any operational probabilistic theory

    Quantum Information and Foundations

    No full text
    Quantum information has dramatically changed information science and technology, looking at the quantum nature of the information carrier as a resource for building new information protocols, designing radically new communication and computation algorithms, and ultra-sensitive measurements in metrology, with a wealth of applications. From a fundamental perspective, this new discipline has led us to regard quantum theory itself as a special theory of information, and has opened routes for exploring solutions to the tension with general relativity, based, for example, on the holographic principle, on non-causal variations of the theory, or else on the powerful algorithm of the quantum cellular automaton, which has revealed new routes for exploring quantum fields theory, both as a new microscopic mechanism on the fundamental side, and as a tool for efficient physical quantum simulations for practical purposes. In this golden age of foundations, an astonishing number of new ideas, frameworks, and results, spawned by the quantum information theory experience, have revolutionized the way we think about the subject, with a new research community emerging worldwide, including scientists from computer science and mathematics

    Scattering and Perturbation Theory for Discrete-Time Dynamics

    No full text
    We present a systematic treatment of scattering processes for quantum systems whose time evolution is discrete. We define and show some general properties of the scattering operator, in particular the conservation of quasienergy which is defined only modulo 2π. Then we develop two perturbative techniques for the power series expansion of the scattering operator, the first one analogous to the iterative solution of the Lippmann-Schwinger equation, the second one to the Dyson series of perturbative quantum field theory. We use this formalism to compare the scattering amplitudes of a continuous-time model and of the corresponding discretized one. We give a rigorous assessment of the comparison for the case of bounded free Hamiltonian, as in a lattice theory with a bounded number of particles. Our framework can be applied to a wide class of quantum simulators, like quantum walks and quantum cellular automata. As a case study, we analyze the scattering properties of a one-dimensional cellular automaton with locally interacting fermions

    Optimal estimation of quantum observables

    No full text
    We consider the problem of estimating the ensemble average of an observable on an ensemble of equally prepared identical quantum systems. We show that, among all kinds of measurements performed jointly on the copies, the optimal unbiased estimation is achieved by the usual procedure that consists in performing independent measurements of the observable on each system and averaging the measurement outcomes

    Classical theories with entanglement

    No full text
    We investigate operational probabilistic theories where the pure states of every system are the vertices of a simplex. A special case of such theories is that of classical theories, i.e., simplicial theories whose pure states are jointly perfectly discriminable. The usual classical theory satisfies also local discriminability. However, simplicial theories - including the classical ones - can violate local discriminability, thus admitting entangled states. First, we prove sufficient conditions for the presence of entangled states in arbitrary probabilistic theories. Then we prove that simplicial theories are necessarily causal, and this represents a no-go theorem for conceiving noncausal classical theories. We then provide necessary and sufficient conditions for simplicial theories to exhibit entanglement and classify their system-composition rules. We conclude by proving that, in simplicial theories, an operational formulation of the superposition principle cannot be satisfied, and that - under the hypothesis of n-local discriminability - no mixed state admits a purification. Our results hold also in the general case where the sets of states fail to be convex

    Unambiguous discrimination of fermionic states through local operations and classical communication

    No full text
    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

    Shannon theory beyond quantum: information content of a source

    No full text
    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.Comment: 14 page

    Fermionic State Discrimination by Local Operations and Classical Communication

    No full text
    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

    Chirality from quantum walks without a quantum coin

    No full text
    Quantum walks (QWs) describe the evolution of quantum systems on graphs. An intrinsic degree of freedom—called the coin and represented by a finite-dimensional Hilbert space—is associated with each node. Scalar quantum walks are QWs with a one-dimensional coin. We propose a general strategy allowing one to construct scalar QWs on a broad variety of graphs, which admit embedding in Eulidean spaces, thus having a direct geometric interpretation. After reviewing the technique that allows one to regroup cells of nodes into new nodes, transforming finite spatial blocks into internal degrees of freedom, we prove that no QW with a two-dimensional coin can be derived from an isotropic scalar QW in this way. Finally, we show that the Weyl and Dirac QWs can be derived from scalar QWs in spaces of dimension up to three, via our construction
    corecore