7 citations · 7 across the 2 of their papers we have counts for
10 papers
Quantum majority vote
Harry Buhrman, Noah Linden, Laura Mančinska +2
Majority vote is a basic method for amplifying correct outcomes that is widely used in computer science and beyond. While it can amplify the correctness of a quantum device with cl…
Graph isomorphism: Physical resources, optimization models, and algebraic characterizations
Laura Mančinska, David E. Roberson, Antonios Varvitsiotis
In the -isomorphism game, a verifier interacts with two non-communicating players (called provers) by privately sending each of them a random vertex from either or ,…
Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs
Laura Mančinska, David E. Roberson
Over 50 years ago, Lovász proved that two graphs are isomorphic if and only if they admit the same number of homomorphisms from any graph [Acta Math. Hungar. 18 (1967), pp. 321--32…
Cores of Cubelike Graphs
Laura Mančinska, Irene Pivotto, David E. Roberson +1
A graph is if it is a Cayley graph for some elementary abelian -group . The core of a graph is its smallest subgraph to which it admits a hom…
Perfect strategies for non-signalling games
M. Lupini, L. Mancinska, V. I. Paulsen +5
We unify and consolidate various results about non-signall-ing games, a subclass of non-local two-player one-round games, by introducing and studying several new families of games…
Multidimensional quantum entanglement with large-scale integrated optics
Jianwei Wang, Stefano Paesani, Yunhong Ding +16
The ability to control multidimensional quantum systems is key for the investigation of fundamental science and for the development of advanced quantum technologies. Here we demons…