scholarly journals No Quantum Ramsey Theorem for Stabilizer Codes

2021 ◽  
Vol 67 (1) ◽  
pp. 408-415
Author(s):  
Yannis Bousba ◽  
Travis Russell
Keyword(s):  
Ramsey Theorem ◽  
Stabilizer Codes

scholarly journals A Canonical Ramsey Theorem for Exactly m-Coloured Complete Subgraphs

2013 ◽  
Vol 23 (1) ◽  
pp. 102-115 ◽  
Author(s):  
TEERADEJ KITTIPASSORN ◽  
BHARGAV P. NARAYANAN
Keyword(s):  
Natural Number ◽  
Complete Graph ◽  
Infinite Subset ◽  
Complete Subgraph ◽  
Ramsey Theorem ◽  
Distinguished Vertex ◽  
Edge Colourings ◽  
Distinct Colour

Given an edge colouring of a graph with a set of m colours, we say that the graph is exactly m-coloured if each of the colours is used. We consider edge colourings of the complete graph on $\mathbb{N}$ with infinitely many colours and show that either one can find an exactly m-coloured complete subgraph for every natural number m or there exists an infinite subset X ⊂ $\mathbb{N}$ coloured in one of two canonical ways: either the colouring is injective on X or there exists a distinguished vertex v in X such that X\{v} is 1-coloured and each edge between v and X\{v} has a distinct colour (all different to the colour used on X\{v}). This answers a question posed by Stacey and Weidl in 1999. The techniques that we develop also enable us to resolve some further questions about finding exactly m-coloured complete subgraphs in colourings with finitely many colours.

A Quasi Ramsey Theorem

2013 ◽  
pp. 111-118
Author(s):  
Hans Jürgen Prömel
Keyword(s):  
Ramsey Theorem

scholarly journals On the relation between a graph code and a graph state

2016 ◽  
Vol 16 (3&4) ◽  
pp. 237-250
Author(s):  
Yongsoo Hwang ◽  
Jun Heo
Keyword(s):  
Simple Graph ◽  
Graph State ◽  
Stabilizer Codes ◽  
Logical Qubits ◽  
Related Graph ◽  
Local Complementation ◽  
Stabilizer Group

A graph state and a graph code respectively are defined based on a mathematical simple graph. In this work, we examine a relation between a graph state and a graph code both obtained from the same graph, and show that a graph state is a superposition of logical qubits of the related graph code. By using the relation, we first discuss that a local complementation which has been used for a graph state can be useful for searching locally equivalent stabilizer codes, and second provide a method to find a stabilizer group of a graph code.

scholarly journals Detection of Emergent Situations in Complex Systems by Structural Invariant (MB, M)

MENDEL ◽  
2017 ◽  
Vol 23 (1) ◽  
pp. 163-170 ◽  
Author(s):  
Jiri Bila ◽  
Martin Novak
Keyword(s):  
Complex System ◽  
Complex Systems ◽  
Detection Method ◽  
Water Cycle ◽  
Ramsey Theorem ◽  
Structural Invariant

The paper introduces complete description of the detection method that uses structural invariant Matroid and its Bases (MB, M). There are recapitulated essential concepts from the used knowledge field as “complex system, emergent situations (A, B, C)”, Ramsey theorem and principal computation variables “power” and “complexity” of emergence phenomenon. The method is explained in details and the demonstration of its application is done by the detection of emergent situation – violation of Short Water Cycle in an ecosystem.

Sign in / Sign up

Export Citation Format

Share Document