activity
20212026
most citedOn the Quantum Chromatic Numbers of Small Graphs

1 citations · 1 across the 5 of their papers we have counts for

collaborators

7 papers

quant-ph2026

An exponential separation between entanglement-assisted and unassisted one-way quantum communication

Ryan Anselm, Srijita Kundu, Olivier Lalonde +1

A longstanding question in quantum communication complexity is whether some task can be accomplished with a small amount of communication in the presence of entanglement, yet requi…

quant-ph2026

Non-local games and communication complexity with noisy entanglement

Srijita Kundu, Olivier Lalonde

We study the impact of noise on the theories of quantum nonlocality and entanglement-assisted communication complexity. We consider non-local games and entanglement-assisted commun…

quant-ph2026

Maximally entangled states are not complete for pseudo-telepathy

Olivier Lalonde

One of the longstanding open problems in quantum nonlocality is to determine if maximally entangled states are complete for bipartite pseudo-telepathic games: namely, if every nonl…

quant-ph2026

Quantum Colorings of Spheres

Olivier Lalonde

Cameron, Montanaro, Newman, Severini and Winter gave a construction which shows that, for , any graph which admits a real -dimensional orthogonal representa…

quant-ph2026

Near-optimal entanglement-communication tradeoffs for remote state preparation

Srijita Kundu, Olivier Lalonde

We study the following task: Alice is given a classical description of a rank- projector on , and Alice and Bob want to prepare the quantum state on Bob'…

quant-ph2023★ 1 cited

On the Quantum Chromatic Numbers of Small Graphs

Olivier Lalonde

We make two contributions pertaining to the study of the quantum chromatic numbers of small graphs. Firstly, in an elegant paper, Mančinska and Roberson [\textit{Baltic Journal on…

quant-ph2021

Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error

Olivier Lalonde, Nikhil S. Mande, Ronald de Wolf

We investigate the randomized and quantum communication complexities of the well-studied Equality function with small error probability , getting optimal constant factors in the…