Quantum Query Complexity, Confining String In An Analytically Solvable 3D Model, Hagedorn Spectrum And Equation Of State Of Yang-Mills Theories, Equation Of State Of G(2) Gauge Theory, Donald Hoffman Uses Evolutionary Game Theory To Show That Our Percepti
K.N.P. Kumar · Advances in physics theories and applications · 2013
Harry Buhrman, Matthias Christandl, Jeroen Zuiddam study nondeterministic multiparty quantum communication with (e&eb) a quantum generalization of broadcasts. Authors show that, with number-in-hand classical inputs, the communication complexity of (e) a Boolean function in this communication model equals (=) the logarithm of (e) the support rank of (e) the corresponding tensor, whereas (e) the approximation complexity in (eb) this model equals (=) the logarithm of the border support rank. This characterisation allow (eb)s us to prove a log-rank conjecture posed by (e) Villagra et al. for (e) nondeterministic multiparty quantum communication with (e&eb) message-passing. The support rank characterization of (e) the communication model connects quantum communication complexity intimately to (e&eb) the theory of asymptotic entanglement transformation and (e&eb) algebraic complexity theory. In this context, authors introduce (eb) the graph wise equality problem. For a cycle graph, the complexity of (e) this communication problem is closely... The full paper: http://www.iiste.org/PDFshare/APTA-PAGENO-501459-505934.pdf