Related papers: Self-Testing Graph States Permitting Bounded Class…
As quantum technologies continue to advance rapidly, the device-independent testing of the functioning of a quantum device has become increasingly important. Self-testing, a correlation based protocol, enables such certification of a…
A homomorphism from a graph $X$ to a graph $Y$ is an adjacency preserving mapping $f:V(X) \rightarrow V(Y)$. We consider a nonlocal game in which Alice and Bob are trying to convince a verifier with certainty that a graph $X$ admits a…
Deciding if a given family of quantum states is topologically ordered is an important but nontrivial problem in condensed matter physics and quantum information theory. We derive necessary and sufficient conditions for a family of graph…
Entanglement allows for the nonlocality of quantum theory, which is the resource behind device-independent quantum information protocols. However, not all entangled quantum states display nonlocality, and a central question is to determine…
Quantum computing promises exponential speed-ups for important simulation and optimization problems. It also poses new CAD problems that are similar to, but more challenging, than the related problems in classical (non-quantum) CAD, such as…
Graph states are special entangled states advantageous for many quantum technologies, including quantum error correction, multiparty quantum communication and measurement-based quantum computation. Yet, their fidelity is often disrupted by…
Non-classical correlations arising in complex quantum networks are attracting growing interest, both from a fundamental perspective and for potential applications in information processing. In particular, in an entanglement swapping…
An experimental scheme is proposed for building massively multipartite entangled states using both the spatial and the frequency modes of an optical parametric oscillator. We provide analytical forms of the entangled states using the…
We consider three broad classes of quantum secret sharing with and without eavesdropping and show how a graph state formalism unifies otherwise disparate quantum secret sharing models. In addition to the elegant unification provided by…
Quantum information processing shows advantages in many tasks, including quantum communication and computation, comparing to its classical counterpart. The essence of quantum processing lies on the fundamental difference between classical…
Self-testing is a powerful certification of quantum systems relying on measured, classical statistics. This paper considers self-testing in bipartite Bell scenarios with small number of inputs and outputs, but with quantum states and…
Classical and quantum physics provide fundamentally different predictions about experiments with separate observers that do not communicate, a phenomenon known as quantum nonlocality. This insight is a key element of our present…
Self-testing is a powerful device-independent technique that enables one to deduce the forms of both the quantum state and the measurements involved in a physical experiment based solely on observed correlations. Although numerous schemes…
Like a silver thread, quantum entanglement [1] runs through the foundations and breakthrough applications of quantum information theory. It cannot arise from local operations and classical communication (LOCC) and therefore represents a…
Recent advances have led towards first prototypes of quantum networks in which entanglement is distributed by sources producing bipartite entangled states. This raises the question of which states can be generated in quantum networks based…
Graph states form a large family of quantum states that are in one-to-one correspondence with mathematical graphs. Graph states are used in many applications, such as measurement-based quantum computation, as multipartite entangled…
We establish limitations and bounds on the transmission of quantum states between gravitationally interacting mechanical oscillators under different models of gravity. This provides benchmarks that can enable tests for quantum features of…
We consider a distributed quantum hypothesis testing problem with communication constraints, in which the two hypotheses correspond to two different states of a bipartite quantum system, multiple identical copies of which are shared between…
The most efficient automated way to construct a large class of quantum photonic experiments is via abstract representation of graphs with certain properties. While new directions were explored using Artificial intelligence and SAT solvers…
We show a surprising link between experimental setups to realize high-dimensional multipartite quantum states and Graph Theory. In these setups, the paths of photons are identified such that the photon-source information is never created.…