Sufficient conditions for quantum advantage in random access code protocols with two-qubit states by Kanjilal, Som, Jebarathinam, Chellasamy, Paterek, Tomasz, Home, Dipankar

Subjects: Get full text

Cryptography in coherent optical information networks using dissipative metamaterial gates by Xomalis, Angelos, Demirtzioglou, Iosif, Jung, Yongmin, Plum, Eric, Lacava, Cosimo, Petropoulos, Periklis, Richardson, David J., Zheludev, Nikolay I.

“…Here, we introduce an optical layer secure communication protocol that does not rely on nonlinear optical processes but instead uses energy redistribution of coherent optical waves interacting on a plasmonic metamaterial absorber. …”
Get full text
Get full text

Amorphous metal-sulphide microfibers enable photonic synapses for brain-like computing by Khan, Khouler, Gholipour, Behrad, Bastock, Paul, Craig, Chris, Hewak, Dan, Soci, Cesare

“…This gives rise to an all-optical implementation of a number of interneuronal and intraneuronal communication protocols that underlie learning and cognition in the brain.…”
Get full text
Get full text

Setting a disordered password on a photonic memory by Su, Shih-Wei, Gou, Shih-Chuan, Chew, Lock Yue, Chang, Yu-Yen, Yu, Ite A., Kalachev, Alexey, Liao, Wen-Te

“…Our results pave ways to significantly reduce the exposure of memories, required for long-distance communication, to eavesdropping and therefore restrict the optimal attack on communication protocols. The present scheme also increases the sensitivity of detecting any eavesdropper and so raises the security level of photonic information technology.…”
Get full text
Get full text

Correlation in hard distributions in communication complexity by Klauck, Hartmut, Bottesch, Ralph Christian, Gavinsky, Dmitry

“…. - We study the same question in the distributional quantum setting, and show a lower bound of Omega((n(k+1))^{1/4}), and an upper bound (via constructing communication protocols), matching up to a logarithmic factor. - We show that there are total Boolean functions f_d that have distributional communication complexity O(log(n)) under all distributions of information up to o(n), while the (interactive) distributional complexity maximised over all distributions is Theta(log(d)) for n <= d <= 2^{n/100}. …”
Get full text
Get full text