809 citations · 1.7k across the 22 of their papers we have counts for
3 papers · 1 filter
Quantum and non-signalling graph isomorphisms
Albert Atserias, Laura Mančinska, David E. Roberson +3
We introduce a two-player nonlocal game, called the -isomorphism game, where classical players can win with certainty if and only if the graphs and are isomorphic. W…
Shortcuts to quantum network routing
Eddie Schoute, Laura Mancinska, Tanvirul Islam +2
A quantum network promises to enable long distance quantum communication, and assemble small quantum devices into a large quantum computing cluster. Each network node can thereby b…
Complexity classification of two-qubit commuting hamiltonians
Adam Bouland, Laura Mančinska, Xue Zhang
We classify two-qubit commuting Hamiltonians in terms of their computational complexity. Suppose one has a two-qubit commuting Hamiltonian H which one can apply to any pair of qubi…