Oracles and Query Lower Bounds in Generalised Probabilistic Theories
Autor: | Howard Barnum, Ciarán M. Lee, John H. Selby |
---|---|
Jazyk: | angličtina |
Rok vydání: | 2018 |
Předmět: |
Discrete mathematics
Generalised probabilistic theories Oracles Quantum Physics Hierarchy (mathematics) Probabilistic logic FOS: Physical sciences General Physics and Astronomy State (functional analysis) Computational resource 01 natural sciences Upper and lower bounds Oracle Article 010305 fluids & plasmas Causality (physics) Query complexity 0103 physical sciences Higher order interference Quantum Physics (quant-ph) 010306 general physics Mathematics Quantum computer |
Zdroj: | Foundations of Physics Barnum, H, Lee, C M & Selby, J H 2018, ' Oracles and Query Lower Bounds in Generalised Probabilistic Theories ', Foundations of Physics, vol. 48, no. 8, pp. 954-981 . https://doi.org/10.1007/s10701-018-0198-4 |
ISSN: | 1572-9516 0015-9018 |
DOI: | 10.1007/s10701-018-0198-4 |
Popis: | We investigate the connection between interference and computational power within the operationally defined framework of generalised probabilistic theories. To compare the computational abilities of different theories within this framework we show that any theory satisfying three natural physical principles possess a well-defined oracle model. Indeed, we prove a subroutine theorem for oracles in such theories which is a necessary condition for the oracle to be well-defined. The three principles are: causality (roughly, no signalling from the future), purification (each mixed state arises as the marginal of a pure state of a larger system), and strong symmetry existence of non-trivial reversible transformations). Sorkin has defined a hierarchy of conceivable interference behaviours, where the order in the hierarchy corresponds to the number of paths that have an irreducible interaction in a multi-slit experiment. Given our oracle model, we show that if a classical computer requires at least n queries to solve a learning problem, then the corresponding lower bound in theories lying at the kth level of Sorkin's hierarchy is n/k. Hence, lower bounds on the number of queries to a quantum oracle needed to solve certain problems are not optimal in the space of all generalised probabilistic theories, although it is not yet known whether the optimal bounds are achievable in general. Hence searches for higher-order interference are not only foundationally motivated, but constitute a search for a computational resource beyond that offered by quantum computation. Comment: 17+7 pages. Comments Welcome. Published in special issue "Foundational Aspects of Quantum Information" in Foundations of Physics |
Databáze: | OpenAIRE |
Externí odkaz: | |
Nepřihlášeným uživatelům se plný text nezobrazuje | K zobrazení výsledku je třeba se přihlásit. |