Sciweavers

36 search results - page 1 / 8
» On a Random Graph Related to Quantum Theory
Sort
View
CPC
2007
93views more  CPC 2007»
13 years 10 months ago
On a Random Graph Related to Quantum Theory
We show that a random graph studied by Ioffe and Levit is an example of an inhomogeneous random graph of the type studied by Bollob´as, Janson and Riordan, which enables us to gi...
Svante Janson
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
14 years 11 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
14 years 11 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
COMBINATORICS
2007
118views more  COMBINATORICS 2007»
13 years 11 months ago
On the Quantum Chromatic Number of a Graph
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a refe...
Peter J. Cameron, Ashley Montanaro, Michael W. New...
SOFSEM
2009
Springer
14 years 3 months ago
Randomness and Determination, from Physics and Computing towards Biology
In this text we will discuss different forms of randomness in Natural Sciences and present some recent results relating them. In finite processes, randomness differs in various ...
Giuseppe Longo