Communication Complexity of Functions on Direct Sums

2000 ◽  
pp. 589-602 ◽  
Author(s):  
Ulrich Tamm
Keyword(s):  
Communication Complexity ◽  
Direct Sums

Lower Bounds in Communication Complexity

2007 ◽  
Author(s):  
T. Lee ◽  
A. Shraibman
Keyword(s):  
Lower Bounds ◽  
Communication Complexity

scholarly journals Nonsingular bilinear forms on direct sums of ideals

2013 ◽  
Vol 63 (4) ◽  
Author(s):  
Beata Rothkegel
Keyword(s):  
Bilinear Form ◽  
Dedekind Domain ◽  
Bilinear Forms ◽  
Direct Sums ◽  
Direct Sum

AbstractIn the paper we formulate a criterion for the nonsingularity of a bilinear form on a direct sum of finitely many invertible ideals of a domain. We classify these forms up to isometry and, in the case of a Dedekind domain, up to similarity.

Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity

2021 ◽  
Vol 30 (2) ◽  
Author(s):  
Toniann Pitassi ◽  
Morgan Shirley ◽  
Thomas Watson
Keyword(s):  
Communication Complexity

scholarly journals Symmetrized persistency of Bell correlations for Dicke states and GHZ-based mixtures

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Marcin Wieśniak
Keyword(s):  
Communication Complexity ◽  
Quantum Communication ◽  
Bell Inequality ◽  
Bell Inequalities ◽  
Quantum Correlations ◽  
Complexity Reduction ◽  
Main Difficulty ◽  
Quantum Communication Complexity ◽  
Number Of Particles ◽  
Dicke States

AbstractQuantum correlations, in particular those, which enable to violate a Bell inequality, open a way to advantage in certain communication tasks. However, the main difficulty in harnessing quantumness is its fragility to, e.g, noise or loss of particles. We study the persistency of Bell correlations of GHZ based mixtures and Dicke states. For the former, we consider quantum communication complexity reduction (QCCR) scheme, and propose new Bell inequalities (BIs), which can be used in that scheme for higher persistency in the limit of large number of particles N. In case of Dicke states, we show that persistency can reach 0.482N, significantly more than reported in previous studies.

PERFECTLY BOUNDED CLASSES OF ABELIAN GROUPS

2013 ◽  
Vol 12 (05) ◽  
pp. 1250208 ◽  
Author(s):  
PATRICK W. KEEF
Keyword(s):  
Abelian Groups ◽  
Direct Sums ◽  
Proper Subclass ◽  
Infinite Height ◽  
Reduced Group

Let [Formula: see text] be the class of abelian p-groups. A non-empty proper subclass [Formula: see text] is bounded if it is closed under subgroups, additively bounded if it is also closed under direct sums and perfectly bounded if it is additively bounded and closed under filtrations. If [Formula: see text], we call the partition of [Formula: see text] given by [Formula: see text] a B/U-pair. We state most of our results not in terms of bounded classes, but rather the corresponding B/U-pairs. Any additively bounded class contains a unique maximal perfectly bounded subclass. The idea of the length of a reduced group is generalized to the notion of the length of an additively bounded class. If λ is an ordinal or the symbol ∞, then there is a natural largest and smallest additively bounded class of length λ, as well as a largest and smallest perfectly bounded class of length λ. If λ ≤ ω, then there is a unique perfectly bounded class of length λ, namely the pλ-bounded groups that are direct sums of cyclics; however, this fails when λ > ω. This parallels results of Dugas, Fay and Shelah (1987) and Keef (1995) on the behavior of classes of abelian p-groups with elements of infinite height. It also simplifies, clarifies and generalizes a result of Cutler, Mader and Megibben (1989) which states that the pω + 1-projectives cannot be characterized using filtrations.

scholarly journals Efficient experimental quantum fingerprinting with channel multiplexing and simultaneous detection

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Xiaoqing Zhong ◽  
Feihu Xu ◽  
Hoi-Kwong Lo ◽  
Li Qian
Keyword(s):  
Communication Complexity ◽  
Single Photon ◽  
Simultaneous Detection ◽  
Minimum Amount ◽  
Photon Detectors ◽  
Communication Time ◽  
Quantum Communication Complexity ◽  
Detection Of Signals ◽  
Coherent Quantum ◽  
Quantum Fingerprinting

AbstractQuantum communication complexity explores the minimum amount of communication required to achieve certain tasks using quantum states. One representative example is quantum fingerprinting, in which the minimum amount of communication could be exponentially smaller than the classical fingerprinting. Here, we propose a quantum fingerprinting protocol where coherent states and channel multiplexing are used, with simultaneous detection of signals carried by multiple channels. Compared with an existing coherent quantum fingerprinting protocol, our protocol could consistently reduce communication time and the amount of communication by orders of magnitude by increasing the number of channels. Our proposed protocol can even beat the classical limit without using superconducting-nanowire single photon detectors. We also report a proof-of-concept experimental demonstration with six wavelength channels to validate the advantage of our protocol in the amount of communication. The experimental results clearly prove that our protocol not only surpasses the best-known classical protocol, but also remarkably outperforms the existing coherent quantum fingerprinting protocol.

Sign in / Sign up

Export Citation Format

Share Document