Fetching the paper…
Reading the bibliography…
Communication complexity is a fundamental aspect of information science, concerned with the amount of communication required to solve a problem distributed among multiple parties.
C. W. Helstrom,
1976
Earlier work this paper cites.
Andrew Chi-Chih Yao, “Some complexity questions related to distributive computing(preliminary report),” (Association for Computing Machinery, New York, NY, USA, 1979)
1979
Earlier work this paper cites.
Peter Frankl and Vojtech Rodl, “Forbidden intersections,”
1987
Earlier work this paper cites.
Artur K. Ekert, “Quantum cryptography based on bell’s theorem,”
1991
Earlier work this paper cites.
Harry Buhrman, Richard Cleve, and Avi Wigderson, “Quantum vs. classical communication and computation,” in
1998
Earlier work this paper cites.
R. Raz, Proceedings of the 31st Annual ACM Symposium on Theory of Computing (ACM, New York, 1999)
1999
Earlier work this paper cites.
Harry Buhrman, Richard Cleve, John Watrous, and Ronald de Wolf, “Quantum fingerprinting,”
2001
Earlier work this paper cites.
Ronald de Wolf, “Quantum communication and complexity,”
2002
Earlier work this paper cites.
Nicolas Gisin, Grégoire Ribordy, Wolfgang Tittel, and Hugo Zbinden, “Quantum cryptography,”
2002
Earlier work this paper cites.
E. Kushilevitz and N. Nisan,
2006
Earlier work this paper cites.
Andrea Casaccino, Ernesto F. Galvão, and Simone Severini, “Extrema of discrete wigner functions and applications,”
2008
Earlier work this paper cites.
Robert W. Spekkens, D. H. Buzacott, A. J. Keehn, Ben Toner, and G. J. Pryde, “Preparation contextuality powers parity-oblivious multiplexing,”
2009
Earlier work this paper cites.
Harry Buhrman, Richard Cleve, Serge Massar, and Ronald de Wolf, “Nonlocality and communication complexity,”
2010
Cited alongside, same era.
Nicolas Brunner, Miguel Navascués, and Tamás Vértesi, “Dimension witnesses and quantum state discrimination,”
2013
Cited alongside, same era.
Nikola Ciganović, Normand J. Beaudry, and Renato Renner, “Smooth max-information as one-shot generalization for mutual information,”
2014
Cited alongside, same era.
Ravishankar Ramanathan and Pawel Horodecki, “Necessary and sufficient condition for state-independent contextual measurement scenarios,”
2014
Cited alongside, same era.
Adán Cabello, Matthias Kleinmann, and Costantino Budroni, “Necessary and sufficient condition for quantum state-independent contextuality,”
2015
Cited alongside, same era.
Debashis Saha and Anubhav Chaturvedi, “Preparation contextuality as an essential feature underlying quantum communication advantage,”
2019
Later among the works it cites.
K. Wright, K.M. Beck, and S. et al. Debnath, “Benchmarking an 11-qubit quantum computer,”
2019
Later among the works it cites.
Debashis Saha, Paweł Horodecki, and Marcin Pawłowski, “State independent contextuality advances one-way communication,”
2019
Later among the works it cites.
Anup Rao and Amir Yehudayoff,
2020
Later among the works it cites.
Anubhav Chaturvedi and Debashis Saha, “Quantum prescriptions are more ontologically distinct than they are operationally distinguishable,”
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Tim Roughgarden, “Communication complexity (for algorithm designers),”
2016
Cited alongside, same era.
Harry Buhrman, Łukasz Czekaj, Andrzej Grudka, Michał Horodecki, Paweł Horodecki, Marcin Markiewicz, Florian Speelman, and Sergii Strelchuk, “Quantum communication complexity advantage implies violation of a bell inequality,”
2016
Cited alongside, same era.
Anubhav Chaturvedi, Marcin Pawlowski, and Karol Horodecki, “Random access codes and nonlocal resources,”
2017
Cited alongside, same era.
Mikołaj Czechlewski, Debashis Saha, Armin Tavakoli, and Marcin Pawłowski, “Device-independent witness of arbitrary-dimensional quantum systems employing binary-outcome measurements,”
2018
Cited alongside, same era.
Edgar A. Aguilar, Jakub J. Borkała, Piotr Mironowicz, and Marcin Pawłowski, “Connections between mutually unbiased bases and quantum random access codes,”
2018
Cited alongside, same era.
Nicolai Friis, Oliver Marty, Christine Maier, Cornelius Hempel, Milan Holzäpfel, Petar Jurcevic, Martin B. Plenio, Marcus Huber, Christian Roos, Rainer Blatt, and Ben Lanyon, “Observation of entangled states of a fully controlled 20-qubit system,”
2018
Cited alongside, same era.
Y. Wang, Y. Li, and Zq. et al. Yin, “16-qubit ibm universal quantum computer can be fully entangled,”
2018
Cited alongside, same era.
2020
Later among the works it cites.
Armin Tavakoli, Emmanuel Zambrini Cruzeiro, Erik Woodhead, and Stefano Pironio, “Informationally restricted correlations: a general framework for classical and quantum systems,”
2022
Later among the works it cites.
Manuel S. Rudolph, Ntwali Bashige Toussaint, Amara Katabarwa, Sonika Johri, Borja Peropadre, and Alejandro Perdomo-Ortiz, “Generation of high-resolution handwritten digits with an ion-trap quantum computer,”
2022
Later among the works it cites.
Shashank Gupta, Debashis Saha, Zhen-Peng Xu, Adán Cabello, and A. S. Majumdar, “Quantum contextuality provides communication complexity advantage,”
2023
Later among the works it cites.
Debashis Saha, Debarshi Das, Arun Kumar Das, Bihalan Bhattacharya, and A. S. Majumdar, “Measurement incompatibility and quantum advantage in communication,”
2023
Later among the works it cites.
Massy Khoshbin, Lorenzo Catani, and Matthew Leifer, “Alternative robust ways of witnessing nonclassicality in the simplest scenario,”
2024
Closest in time.
Jef Pauwels, Stefano Pironio, and Armin Tavakoli,
2024
Closest in time.