Sciweavers

36 search results - page 2 / 8
» On a Random Graph Related to Quantum Theory
Sort
View
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
14 years 5 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
STOC
2003
ACM
174views Algorithms» more  STOC 2003»
14 years 5 months ago
Adiabatic quantum state generation and statistical zero knowledge
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
Dorit Aharonov, Amnon Ta-Shma
WCC
2005
Springer
156views Cryptology» more  WCC 2005»
13 years 10 months ago
One and Two-Variable Interlace Polynomials: A Spectral Interpretation
We relate the one- and two-variable interlace polynomials of a graph to the spectra of a quadratic boolean function with respect to a strategic subset of local unitary transforms. ...
Constanza Riera, Matthew G. Parker
RSA
2010
98views more  RSA 2010»
13 years 3 months ago
Merging percolation on Zd and classical random graphs: Phase transition
: We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homoge...
Tatyana S. Turova, Thomas Vallier
TIT
2002
63views more  TIT 2002»
13 years 4 months ago
Compressing quantum mixed-state sources by sending classical information
Abstract--We consider visible compression for discrete memoryless sources of mixed quantum states when only classical information can be sent from Alice to Bob. We assume that Bob ...
Emina Soljanin