Fetching the paper…
Reading the bibliography…
A set of $n$ pure quantum states is called antidististinguishable if there exists an $n$-outcome measurement that never outputs the outcome `$k$' on the $k$-th quantum state.
Résultats sur l’empilement de calottes égales sur une périsphère de ℝ n \mathbb{R}^{n} et correction à un travail antérieur
C. Chabauty · 1953
Earlier work this paper cites.
Probability of error for optimal codes in a gaussian channel
C. E. Shannon · 1959
Earlier work this paper cites.
Capabilities of bounded discrepancy decoding
A. D. Wyner · 1965
Earlier work this paper cites.
Lower bounds on the maximum cross correlation of signals
L. Welch · 1974
Earlier work this paper cites.
On bounds for packings on a sphere and in space
V. I. Levenshtein and G. A. Kabatiansky · 1978
Earlier work this paper cites.
Some complexity questions related to distributive computing(preliminary report)
A. Chi-Chih Yao · 1979
Earlier work this paper cites.
Bounds for packings of metric spaces and some of their applications
V. I. Levenshtein · 1983
Earlier work this paper cites.
Forbidden intersections
P. Frankl and V. Rödl · 1987
Earlier work this paper cites.
Optimal state-determination by mutually unbiased measurements
W. K. Wootters and B. D. Fields · 1989
Earlier work this paper cites.
Quantum circuit complexity
A. Chi-Chih Yao · 1993
Earlier work this paper cites.
Communication Complexity
E. Kushilevitz and N. Nisan · 1997
Earlier work this paper cites.
Quantum vs. classical communication and computation
H. Buhrman, R. Cleve, and A. Wigderson · 1998
Earlier work this paper cites.
Cost of Exactly Simulating Quantum Entanglement with Classical Communication
G. Brassard, R. Cleve, and A. Tapp · 1999
Earlier work this paper cites.
Exponential separation of quantum and classical communication complexity
R. Raz · 1999
Earlier work this paper cites.
On a bound in borsuk's problem
A M Raigorodskii · 1999
Earlier work this paper cites.
Classical Teleportation of a Quantum Bit
N. J. Cerf, N. Gisin, and S. Massar · 2000
Earlier work this paper cites.
Quantum Fingerprinting
H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf · 2001
Earlier work this paper cites.
Conditions for Compatibility of Quantum-State Assignments
C. M. Caves, C. A. Fuchs, and R. Schack · 2002
Earlier work this paper cites.
Communication Cost of Simulating Bell Correlations
B. F. Toner and D. Bacon · 2003
Cited alongside, same era.
The quantum communication complexity of sampling
A. Ambainis, L. J. Schulman, A. Ta-Shma, U. V. Vazirani, and A. Wigderson · 2003
Cited alongside, same era.
Quantum Ontological Excess Baggage
L. Hardy · 2004
Cited alongside, same era.
Frames, designs, and spherical codes in quantum information theory
J. M. Renes · 2004
Cited alongside, same era.
Symmetric informationally complete quantum measurements
J. M. Renes, R. Blume-Kohout, A. J. Scott, and Carlton M. Caves · 2004
Cited alongside, same era.
Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function
D. Gavinsky, J. Kempe, and R. de Wolf · 2006
Cited alongside, same era.
Epistemic View of Quantum States and Communication Complexity of Quantum Channels
A. Montina · 2012
Later among the works it cites.
Is the Quantum State Real? An Extended Review of ψ \psi -ontology Theorems
M. Leifer · 2014
Later among the works it cites.
No ψ \psi -Epistemic Model Can Fully Explain the Indistinguishability of Quantum States
J. Barrett, E. G. Cavalcanti, R. Lal, and O. J. E. Maroney · 2014
Later among the works it cites.
Complex spherical designs and codes
A. Roy and S. Suda · 2014
Later among the works it cites.
SIC-POVMs and Compatibility among Quantum States
Blake C. Stacey · 2014
Later among the works it cites.
Conclusive exclusion of quantum states
S. Bandyopadhyay, R. Jain, J. Oppenheim, and C. Perry · 2014
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
The one-way communication complexity of the Boolean Hidden Matching Problem
I. Kerenidis and R. Raz · 2006
Cited alongside, same era.
Exponential separations for one-way quantum communication complexity, with applications to cryptography
D. Gavinsky, J. Kempe, I. Kerenidis, R. Raz, and R. de Wolf · 2007
Cited alongside, same era.
Exponential separation of quantum and classical one-way communication complexity
Z. Bar-Yossef, T. S. Jayram, and I. Kerenidis · 2008
Cited alongside, same era.
Classical interaction cannot replace a quantum message
D. Gavinsky · 2008
Cited alongside, same era.
Introduction to Algorithms, Third Edition
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein · 2009
Cited alongside, same era.
SIC-POVMs: A new computer study
A. J. Scott and M. Grassl · 2009
Cited alongside, same era.
Later among the works it cites.
Communication Tasks with Infinite Quantum-Classical Separation
C. Perry, R. Jain, and J. Oppenheim · 2015
Later among the works it cites.
Coherence Optimization and Best Complex Antipodal Spherical Codes
H. Zorlein and M. Bossert · 2015
Later among the works it cites.
Doubly infinite separation of quantum information and communication
Z. Liu, C. Perry, Y. Zhu, D. E. Koh, and S Aaronson · 2016
Later among the works it cites.
The Probabilistic Method
N. Alon and J. H. Spencer · 2016
Later among the works it cites.
Fast Approximate Construction of Best Complex Antipodal Spherical Codes
M. Heredia Conde and O. Loffeld · 2017
Later among the works it cites.
SICs: Extending the list of solutions
A. J. Scott · 2017
Later among the works it cites.
Antidistinguishability of Pure Quantum States
T. Heinosaari and O. Kerppo · 2018
Later among the works it cites.
Contextuality bounds the efficiency of classical simulation of quantum processes
A. Karanjai, J. J. Wallman, and S. D. Bartlett · 2018
Later among the works it cites.
On kissing numbers and spherical codes in high dimensions
M. Jenssen, F. Joos, and W. Perkins · 2018
Later among the works it cites.
Quantum states cannot be transmitted efficiently classically
A. Montanaro · 2019
Closest in time.
Communication of partial ignorance with qubits
T. Heinosaari and O. Kerppo · 2019
Closest in time.
Communication Complexity and Applications
A. Rao and A. Yehudayoff · 2019
Closest in time.