Random access codes have provided many examples of quantum advantage in communication, but concern only one kind of information retrieval task. We introduce a related task - the Torpedo Game - and show that it admits greater quantum advantage than the comparable random access code. Perfect quantum strategies involving prepare-and-measure protocols with experimentally accessible three-level systems emerge via analysis in terms of the discrete Wigner function. The example is leveraged to an operational advantage in a pacifist version of the strategy game Battleship. We pinpoint a characteristic of quantum systems that enables quantum advantage in any bounded-memory information retrieval task. While preparation contextuality has previously bee...
We have shown that entanglement assisted stochastic strategies allow access to strategic measures be...
Communication games are one of the widely used tools that are designed to demonstrate quantum suprem...
Zero-knowledge proof (ZKP) is a fundamental cryptographic primitive that allows a prover to convince...
Random access code (RAC) is an important communication task to conditionally access remote $n$-bit s...
International audienceRandom access coding is an information task that has been extensively studied ...
We explore the fundamental origin of the quantum advantage behind random access code. We propose new...
Quantum computing is rapidly becoming one of the largest research areas in quantum physics and yet w...
An increasing number of communication and computational schemes with quantum advantages have recentl...
Random Access Codes is an information task that has been extensively studied and found many applicat...
We show the following hold, unconditionally unless otherwise stated, relative to a random oracle wit...
Quantum advantage is notoriously hard to find and even harder to prove. For example the class of fun...
Random access codes are an intriguing class of communication tasks that reveal an operational and qu...
Despite the conceptual importance of contextuality in quantum mechanics, there is a hitherto limited...
Inspired by the power of abstraction in information theory, we consider quantum rebound protocols as...
Quantum Computing is widely perceived to be one of the ways forward in the future of computation as ...
We have shown that entanglement assisted stochastic strategies allow access to strategic measures be...
Communication games are one of the widely used tools that are designed to demonstrate quantum suprem...
Zero-knowledge proof (ZKP) is a fundamental cryptographic primitive that allows a prover to convince...
Random access code (RAC) is an important communication task to conditionally access remote $n$-bit s...
International audienceRandom access coding is an information task that has been extensively studied ...
We explore the fundamental origin of the quantum advantage behind random access code. We propose new...
Quantum computing is rapidly becoming one of the largest research areas in quantum physics and yet w...
An increasing number of communication and computational schemes with quantum advantages have recentl...
Random Access Codes is an information task that has been extensively studied and found many applicat...
We show the following hold, unconditionally unless otherwise stated, relative to a random oracle wit...
Quantum advantage is notoriously hard to find and even harder to prove. For example the class of fun...
Random access codes are an intriguing class of communication tasks that reveal an operational and qu...
Despite the conceptual importance of contextuality in quantum mechanics, there is a hitherto limited...
Inspired by the power of abstraction in information theory, we consider quantum rebound protocols as...
Quantum Computing is widely perceived to be one of the ways forward in the future of computation as ...
We have shown that entanglement assisted stochastic strategies allow access to strategic measures be...
Communication games are one of the widely used tools that are designed to demonstrate quantum suprem...
Zero-knowledge proof (ZKP) is a fundamental cryptographic primitive that allows a prover to convince...