Tales told by coloured tangles

Daniel Moskovich, Avishy Y. Carmi

Research output: Contribution to journalArticlepeer-review

Abstract

Tangle machines are a topologically inspired diagrammatic formalism to describe information flow in networks. This paper begins with an expository account of tangle machines, motivated by the problem of describing how Gaussian estimators with unknown error correlations can be fused in networks. Tangle machines may be used to describe classical computations and quantum computations. Invariants of tangle machines provide ‘intrinsic’ information about the computations that they describe. Two examples are presented in which tangle machines tell stories of adiabatic quantum computations. The paper concludes with a preliminary discussion of how tangle machines may be learned from data by adapting existing causality-detection algorithms.

Original languageEnglish
Pages (from-to)71-105
Number of pages35
JournalInternational Journal of Unconventional Computing
Volume12
Issue number1
StatePublished - 1 Jan 2016

Keywords

  • Adiabatic quantum computation
  • Causality detection
  • Computation
  • Covariance intersection
  • Diagrammatic algebra
  • Information processing
  • Low dimensional topology

ASJC Scopus subject areas

  • General Computer Science

Fingerprint

Dive into the research topics of 'Tales told by coloured tangles'. Together they form a unique fingerprint.

Cite this