318,737 research outputs found
Interaction in Quantum Communication
In some scenarios there are ways of conveying information with many fewer,
even exponentially fewer, qubits than possible classically. Moreover, some of
these methods have a very simple structure--they involve only few message
exchanges between the communicating parties. It is therefore natural to ask
whether every classical protocol may be transformed to a ``simpler'' quantum
protocol--one that has similar efficiency, but uses fewer message exchanges.
We show that for any constant k, there is a problem such that its k+1 message
classical communication complexity is exponentially smaller than its k message
quantum communication complexity. This, in particular, proves a round hierarchy
theorem for quantum communication complexity, and implies, via a simple
reduction, an Omega(N^{1/k}) lower bound for k message quantum protocols for
Set Disjointness for constant k.
Enroute, we prove information-theoretic lemmas, and define a related measure
of correlation, the informational distance, that we believe may be of
significance in other contexts as well.Comment: 35 pages. Uses IEEEtran.cls, IEEEbib.bst. Submitted to IEEE
Transactions on Information Theory. Strengthens results in quant-ph/0005106,
quant-ph/0004100 and an earlier version presented in STOC 200
Unreduced Dynamic Complexity: Towards the Unified Science of Intelligent Communication Networks and Software
Operation of autonomic communication networks with complicated user-oriented functions should be described as unreduced many-body interaction process. The latter gives rise to complex-dynamic behaviour including fractally structured hierarchy of chaotically changing realisations. We recall the main results of the universal science of complexity (http://cogprints.org/4471/) based on the unreduced interaction problem solution and its application to various real systems, from nanobiosystems (http://cogprints.org/4527/) and quantum devices to intelligent networks (http://cogprints.org/4114/) and emerging consciousness (http://cogprints.org/3857/). We concentrate then on applications to autonomic communication leading to fundamentally substantiated, exact science of intelligent communication and software. It aims at unification of the whole diversity of complex information system behaviour, similar to the conventional, "Newtonian" science order for sequential, regular models of system dynamics. Basic principles and first applications of the unified science of complex-dynamic communication networks and software are outlined to demonstrate its advantages and emerging practical perspectives
Equality Alone Does not Simulate Randomness
The canonical problem that gives an exponential separation between deterministic and randomized communication complexity in the classical two-party communication model is "Equality". In this work we show that even allowing access to an "Equality" oracle, deterministic protocols remain exponentially weaker than randomized ones. More precisely, we exhibit a total function on n bits with randomized one-sided communication complexity O(log n), but such that every deterministic protocol with access to "Equality" oracle needs Omega(n) cost to compute it.
Additionally we exhibit a natural and strict infinite hierarchy within BPP, starting with the class P^{EQ} at its bottom
A note on a problem in communication complexity
In this note, we prove a version of Tarui's Theorem in communication
complexity, namely . Consequently, every
measure for leads to a measure for , subsuming a result of
Linial and Shraibman that problems with high mc-rigidity lie outside the
polynomial hierarchy. By slightly changing the definition of mc-rigidity
(arbitrary instead of uniform distribution), it is then evident that the class
of problems with low mc-rigidity equals . As , this rules out the possibility, that had been
left open, that even polynomial space is contained in
Landscapes of Inequality? A Critique of Monumental Hierarchy in the Mongolian Bronze Age
Khirigsuurs are stone monuments of variable scale and complexity that dominate the archaeological landscape of the Mongolian Bronze Age. Though there are countless typical-sized monuments, there are a few very large structures suggesting that a chiefly hierarchy directed their construction. Using measurements of size and formal complexity to compare these mega-monuments and khirigsuurs within fully surveyed areas this article argues that these monuments are not primarily tombs built to represent the social hierarchy of early nomadic pastoralists. Instead, they are monumental places created for living communities to communicate their organization and enduring nature to others and themselves. This communication was essential for early pastoralist communities to become established and survive
- âŠ