Tangle machines

Daniel Moskovich; Avishy Y. Carmi

doi:10.1098/rspa.2015.0111

Tangle machines

Daniel Moskovich, Avishy Y. Carmi

Department of Mechanical Engineering

Research output: Contribution to journal › Article › peer-review

10 Scopus citations

Abstract

Tangle machines are topologically inspired diagrammatic models. Their novel feature is their natural notion of equivalence. Equivalent tangle machines may differ locally, but globally they share the same information content. The goal of tangle machine equivalence is to provide a context-independent method to select, from among many ways to perform a task, the 'best' way to perform the task. The concept of equivalent tangle machines is illustrated through examples in which tangle machines represent networks for distributed information processing, networks of adiabatic quantum computations, and iterative computations.

Original language	English
Article number	20150111
Journal	Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
Volume	471
Issue number	2179
DOIs	https://doi.org/10.1098/rspa.2015.0111
State	Published - 8 Jul 2015

Keywords

Adiabatic quantum computation
Computation
Diagrammatic algebra
Information processing
Low-dimensional topology
Markov chains

ASJC Scopus subject areas

General Mathematics
General Engineering
General Physics and Astronomy

Access to Document

10.1098/rspa.2015.0111

Cite this

@article{96f7360be774406795d199dea7787db9,

title = "Tangle machines",

abstract = "Tangle machines are topologically inspired diagrammatic models. Their novel feature is their natural notion of equivalence. Equivalent tangle machines may differ locally, but globally they share the same information content. The goal of tangle machine equivalence is to provide a context-independent method to select, from among many ways to perform a task, the 'best' way to perform the task. The concept of equivalent tangle machines is illustrated through examples in which tangle machines represent networks for distributed information processing, networks of adiabatic quantum computations, and iterative computations.",

keywords = "Adiabatic quantum computation, Computation, Diagrammatic algebra, Information processing, Low-dimensional topology, Markov chains",

author = "Daniel Moskovich and Carmi, {Avishy Y.}",

year = "2015",

month = jul,

day = "8",

doi = "10.1098/rspa.2015.0111",

language = "English",

volume = "471",

journal = "Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences",

issn = "1364-5021",

publisher = "Royal Society Publishing",

number = "2179",

}

TY - JOUR

T1 - Tangle machines

AU - Moskovich, Daniel

AU - Carmi, Avishy Y.

PY - 2015/7/8

Y1 - 2015/7/8

N2 - Tangle machines are topologically inspired diagrammatic models. Their novel feature is their natural notion of equivalence. Equivalent tangle machines may differ locally, but globally they share the same information content. The goal of tangle machine equivalence is to provide a context-independent method to select, from among many ways to perform a task, the 'best' way to perform the task. The concept of equivalent tangle machines is illustrated through examples in which tangle machines represent networks for distributed information processing, networks of adiabatic quantum computations, and iterative computations.

AB - Tangle machines are topologically inspired diagrammatic models. Their novel feature is their natural notion of equivalence. Equivalent tangle machines may differ locally, but globally they share the same information content. The goal of tangle machine equivalence is to provide a context-independent method to select, from among many ways to perform a task, the 'best' way to perform the task. The concept of equivalent tangle machines is illustrated through examples in which tangle machines represent networks for distributed information processing, networks of adiabatic quantum computations, and iterative computations.

KW - Adiabatic quantum computation

KW - Computation

KW - Diagrammatic algebra

KW - Information processing

KW - Low-dimensional topology

KW - Markov chains

UR - http://www.scopus.com/inward/record.url?scp=84937133629&partnerID=8YFLogxK

U2 - 10.1098/rspa.2015.0111

DO - 10.1098/rspa.2015.0111

M3 - Article

AN - SCOPUS:84937133629

SN - 1364-5021

VL - 471

JO - Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences

JF - Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences

IS - 2179

M1 - 20150111

ER -

Tangle machines

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this