Fetching the paper…
Reading the bibliography…
Random access codes are a type of communication task that is widely used in quantum information science.
“Broadcast channels with confidential messages”
Imre Csiszár and János Körner · 1978
Earlier work this paper cites.
“Optimal lower bounds for quantum automata and random access codes”
Ashwin Nayak · 1999
Earlier work this paper cites.
“Dense quantum coding and a lower bound for 1-way quantum automata”
Andris Ambainis, Ashwin Nayak, Ammon Ta-Shma, and Umesh Vazirani · 1999
Earlier work this paper cites.
“Dense quantum coding and quantum finite automata”
Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, and Umesh Vazirani · 2002
Earlier work this paper cites.
“Geometric phases in classical and quantum mechanics”
Dariusz Chruściński and Andrzej Jamiołkowski · 2004
Earlier work this paper cites.
“(4,1)-quantum random access coding does not exist—one qubit is not enough to recover one of four bits”
Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, and Shigeru Yamashita · 2006
Earlier work this paper cites.
“Norm estimations for finite sums of positive operators”
Dan Popovici and Zoltán Sebestyén · 2006
Earlier work this paper cites.
“Preparation contextuality powers parity-oblivious multiplexing”
Robert W. Spekkens, D. H. Buzacott, A. J. Keehn, Ben Toner, and G. J. Pryde · 2009
Earlier work this paper cites.
“Information causality as a physical principle”
Marcin Pawłowski, Tomasz Paterek, Dagomir Kaszlikowski, Valerio Scarani, Andreas Winter, and Marek Żukowski · 2009
Earlier work this paper cites.
“Quantum random access codes with shared randomness” (2009)
Andris Ambainis, Debbie Leung, Laura Mancinska, and Maris Ozols · 2009
Earlier work this paper cites.
“Entanglement-assisted random access codes”
Marcin Pawłowski and Marek Żukowski · 2010
Earlier work this paper cites.
“Semi-device-independent security of one-way quantum key distribution”
Marcin Pawłowski and Nicolas Brunner · 2011
Earlier work this paper cites.
“Dimension witnesses and quantum state discrimination”
Nicolas Brunner, Miguel Navascués, and Tamás Vértesi · 2013
Earlier work this paper cites.
“Quantum bidding in bridge”
Sadiq Muhammad, Armin Tavakoli, Maciej Kurant, Marcin Pawłowski, Marek Żukowski, and Mohamed Bourennane · 2014
Earlier work this paper cites.
“Quantum cryptography: Public key distribution and coin tossing”
Charles H. Bennett and Gilles Brassard · 2014
Cited alongside, same era.
“Quantum random access codes using single d d -level systems”
Armin Tavakoli, Alley Hameedi, Breno Marques, and Mohamed Bourennane · 2015
Cited alongside, same era.
“Secrecy in prepare-and-measure clauser-horne-shimony-holt tests with a qubit bound”
Erik Woodhead and Stefano Pironio · 2015
Cited alongside, same era.
“Characterizing finite-dimensional quantum behavior”
Miguel Navascués, Adrien Feix, Mateus Araújo, and Tamás Vértesi · 2015
Cited alongside, same era.
“Spatial versus sequential correlations for random access coding”
Armin Tavakoli, Breno Marques, Marcin Pawłowski, and Mohamed Bourennane · 2016
Cited alongside, same era.
“Improved classical and quantum random access codes”
Ola Liabøtrø · 2017
“Self-testing nonprojective quantum measurements in prepare-and-measure experiments”
Armin Tavakoli, Massimiliano Smania, Tamás Vértesi, Nicolas Brunner, and Mohamed Bourennane · 2020
Later among the works it cites.
“Quantum random access codes and incompatibility of measurements”
Claudio Carmeli, Teiko Heinosaari, and Alessandro Toigo · 2020
Later among the works it cites.
“Semi-device-independent self-testing of unsharp measurements”
Nikolai Miklin, Jakub J. Borkała, and Marcin Pawłowski · 2020
Later among the works it cites.
“Experimental demonstration of sequential quantum random access codes”
Giulio Foletto, Luca Calderaro, Giuseppe Vallone, and Paolo Villoresi · 2020
Later among the works it cites.
“Experimental characterization of unsharp qubit observables and sequential measurement incompatibility via quantum random access codes”
Hammad Anwer, Sadiq Muhammad, Walid Cherifi, Nikolai Miklin, Armin Tavakoli, and Mohamed Bourennane · 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…
Cited alongside, same era.
“ n n -fold unbiased bases: an extension of the MUB condition” (2017)
Máté Farkas · 2017
Cited alongside, same era.
“Connections between mutually unbiased bases and quantum random access codes”
Edgar A. Aguilar, Jakub J. Borkała, Piotr Mironowicz, and Marcin Pawłowski · 2018
Cited alongside, same era.
“Self-testing quantum states and measurements in the prepare-and-measure scenario”
Armin Tavakoli, Jędrzej Kaniewski, Tamás Vértesi, Denis Rosset, and Nicolas Brunner · 2018
Cited alongside, same era.
“Experimentally feasible semi-device-independent certification of four-outcome positive-operator-valued measurements”
Piotr Mironowicz and Marcin Pawłowski · 2019
Cited alongside, same era.
“Sequential random access codes and self-testing of quantum measurement instruments”
Karthik Mohan, Armin Tavakoli, and Nicolas Brunner · 2019
Cited alongside, same era.
“Self-testing mutually unbiased bases in the prepare-and-measure scenario”
Máté Farkas and Jędrzej Kaniewski · 2019
Cited alongside, same era.
“Quantum Random Access Codes for Boolean Functions”
João F. Doriguello and Ashley Montanaro · 2021
Later among the works it cites.
“Correlations in entanglement-assisted prepare-and-measure scenarios”
Armin Tavakoli, Jef Pauwels, Erik Woodhead, and Stefano Pironio · 2021
Later among the works it cites.
“Widening the sharpness modulation region of an entanglement-assisted sequential quantum random access code: Theory, experiment, and application”
Ya Xiao, Xin-Hong Han, Xuan Fan, Hui-Chao Qu, and Yong-Jian Gu · 2021
Later among the works it cites.
“High-dimensional multi-input quantum random access codes and mutually unbiased bases”
Rui-Heng Miao, Zhao-Di Liu, Yong-Nan Sun, Chen-Xi Ning, Chuan-Feng Li, and Guang-Can Guo · 2022
Later among the works it cites.
“Almost qudits in the prepare-and-measure scenario”
Jef Pauwels, Stefano Pironio, Erik Woodhead, and Armin Tavakoli · 2022
Later among the works it cites.
“Semidefinite-programming-based optimization of quantum random access codes over noisy channels”
Rafael A. da Silva and Breno Marques · 2023
Closest in time.
“Measurement incompatibility and quantum advantage in communication”
Debashis Saha, Debarshi Das, Arun Kumar Das, Bihalan Bhattacharya, and A. S. Majumdar · 2023
Closest in time.
“Quantum advantages in ( n , d ) ↦ 1 (n,d)\mapsto 1 random access codes”
Andris Ambainis, Dmitry Kravchenko, Sk Sazim, Joonwoo Bae, and Ashutosh Rai · 2024
Closest in time.
“Semidefinite programming relaxations for quantum correlations”
Armin Tavakoli, Alejandro Pozas-Kerstjens, Peter Brown, and Mateus Araújo · 2024
Closest in time.