Computation with multiple CTCs of fixed length and width (Q256423)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computation with multiple CTCs of fixed length and width |
scientific article; zbMATH DE number 6552906
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computation with multiple CTCs of fixed length and width |
scientific article; zbMATH DE number 6552906 |
Statements
Computation with multiple CTCs of fixed length and width (English)
0 references
9 March 2016
0 references
closed timelike curve (CTC)
0 references
CTC-based computation
0 references
postselection
0 references
polynomial-time probabilistic and quantum algorithms
0 references
probabilistic automata
0 references
quantum automata
0 references
deterministic pushdown automata
0 references
limited nondeterminism
0 references
0 references
0.912992298603058
0 references
0.8457409143447876
0 references
0.8305513858795166
0 references
0.8096375465393066
0 references
0.7995569109916687
0 references
