809 citations · 1.7k across the 22 of their papers we have counts for
30 papers
Quantum interaction can superactivate cheating under parallel repetition
Archishna Bhattacharyya, Laura Mančinska, Yuming Zhao
We study interactive multiprover games and many-round protocols in which the communication between the verifier and the provers is quantum. Parallel repetition is known to suppress…
Quantum Perfect Matchings
David Cui, Laura Mančinska, Seyed Sajjad Nezhadi +1
We investigate quantum and nonsignaling generalizations of perfect matchings in graphs using nonlocal games. Specifically, we introduce nonlocal games that test for -perfect mat…
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…
An Operational Environment for Quantum Self-Testing
Matthias Christandl, Nicholas Gauguin Houghton-Larsen, Laura Mancinska
Observed quantum correlations are known to determine in certain cases the underlying quantum state and measurements. This phenomenon is known as (quantum) self-testing. Self-testin…
The geometry of Bloch space in the context of quantum random access codes
Laura Mančinska, Sigurd A. L. Storgaard
We study the communication protocol known as a Quantum Random Access Code (QRAC) which encodes classical bits into qubits () with a probability of recovering any of th…
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…
Oddities of quantum colorings
Laura Mančinska, David E. Roberson
We study quantum analogs of graph colorings and chromatic number. Initially defined via an interactive protocol, quantum colorings can also be viewed as a natural operator relaxati…
Nonlocal Games and Quantum Permutation Groups
Martino Lupini, Laura Mančinska, David E. Roberson
We present a strong connection between quantum information and quantum permutation groups. Specifically, we define a notion of quantum isomorphisms of graphs based on quantum autom…
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…
Deciding the existence of perfect entangled strategies for nonlocal games
Laura Mančinska, David E. Roberson, Antonios Varvitsiotis
First, we consider the problem of deciding whether a nonlocal game admits a perfect entangled strategy that uses projective measurements on a maximally entangled shared state. Via…
A unified view on Hardy's paradox and the CHSH inequality
Laura Mančinska, Stephanie Wehner
Bell's inequality fundamentally changed our understanding of quantum mechanics. Bell's insight that non-local correlations between quantum systems cannot be explained classically c…
Limits to catalysis in quantum thermodynamics
Nelly Huei Ying Ng, Laura Mančinska, Cristina Cirstoiu +2
Quantum thermodynamics is a research field that aims at fleshing out the ultimate limits of thermodynamic processes in the deep quantum regime. A complete picture of quantum thermo…
Graph-theoretical Bounds on the Entangled Value of Non-local Games
André Chailloux, Laura Mančinska, Giannicola Scarpa +1
We introduce a novel technique to give bounds to the entangled value of non-local games. The technique is based on a class of graphs used by Cabello, Severini and Winter in 2010. T…
Unbounded entanglement in nonlocal games
Laura Mančinska, Thomas Vidick
Quantum entanglement is known to provide a strong advantage in many two-party distributed tasks. We investigate the question of how much entanglement is needed to reach optimal per…
When asymptotic LOCC offers no advantage over finite LOCC
Honghao Fu, Debbie Leung, Laura Mancinska
We consider bipartite LOCC, the class of operations implementable by local quantum operations and classical communication between two parties. Surprisingly, there are operations th…
Bounds on entanglement assisted source-channel coding via the Lovasz theta number and its variants
Toby Cubitt, Laura Mancinska, David Roberson +3
We study zero-error entanglement assisted source-channel coding (communication in the presence of side information). Adapting a technique of Beigi, we show that such coding require…
Interpolatability distinguishes LOCC from separable von Neumann measurements
Andrew M. Childs, Debbie Leung, Laura Mancinska +1
Local operations with classical communication (LOCC) and separable operations are two classes of quantum operations that play key roles in the study of quantum entanglement. Separa…
Graph Homomorphisms for Quantum Players
Laura Mančinska, David E. Roberson
A homomorphism from a graph to a graph is an adjacency preserving mapping . We consider a nonlocal game in which Alice and Bob are trying to convin…