Cargando…
Oracles and Query Lower Bounds in Generalised Probabilistic Theories
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 four natural physical pri...
Autores principales: | Barnum, Howard, Lee, Ciarán M., Selby, John H. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6191169/ https://www.ncbi.nlm.nih.gov/pubmed/30393388 http://dx.doi.org/10.1007/s10701-018-0198-4 |
Ejemplares similares
-
Bounded queries in recursion theory
por: Gasarch, William I, et al.
Publicado: (1999) -
Pro jQuery in Oracle application express
por: Wesley, Scott
Publicado: (2015) -
Bayesian strategies: probabilistic programs as generalised graphical models
por: Paquet, Hugo
Publicado: (2021) -
PAC-Bayes Unleashed: Generalisation Bounds with Unbounded Losses
por: Haddouche, Maxime, et al.
Publicado: (2021) -
Query processing on probabilistic data: a survey
por: Van den Broeck, Guy, et al.
Publicado: (2017)