Computation in generalised probabilisitic theories
- Submitting institution
-
University of Oxford
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1993
- Type
- D - Journal article
- DOI
-
10.1088/1367-2630/17/8/083001
- Title of journal
- NEW JOURNAL OF PHYSICS
- Article number
- ARTN 083001
- First page
- 083001
- Volume
- 17
- Issue
- 8
- ISSN
- 1367-2630
- Open access status
- Out of scope for open access requirements
- Month of publication
- August
- Year of publication
- 2015
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 21
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper initiates the study of computation, and of complexity theory, in theories that are not necessarily constrained by the rules of quantum theory, but which make consistent predictions and good operational sense. The main result is that efficient computation in any such theory is contained in the classical complexity class AWPP. In addition to the journal publication, the paper was accepted following peer review for talks at QPL 2015 and TQC 2015, and was the topic of an invited plenary presentation at QIPC 2015 (along with QIP one of the two most important conferences of the field).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -