Related papers: Self-Testing Graph States Permitting Bounded Class…
This workshop brought together experts in classical graph theory and quantum information science to explore the intersection of these fields, with a focus on quantum graph states and their applications in computing, networking, and sensing.…
We investigate a graph-theoretic approach to the problem of distinguishing quantum product states in the fundamental quantum communication framework called local operations and classical communication (LOCC). We identify chordality as the…
We consider different settings of the task to distinguish pure orthogonal quantum states under local operations and a limited amount of classical communication. In the first setting, the spatially separated parties are allowed to perform…
Scalable quantum computing and communication requires the protection of quantum information from the detrimental effects of decoherence and noise. Previous work tackling this problem has relied on the original circuit model for quantum…
Entanglement and Bell nonlocality are known to be inequivalent: there exist entangled states that admit a local hidden-variable model for all local measurements. Here we show that this gap disappears in a minimal broadcast extension of the…
Quantum theory allows for nonlocality without entanglement. Notably, there exist bipartite quantum measurements consisting of only product eigenstates, yet they cannot be implemented via local quantum operations and classical communication.…
Certifying quantum properties with minimal assumptions is a fundamental problem in quantum information science. Self-testing is a method to infer the underlying physics of a quantum experiment only from the measured statistics. While all…
Quantum entanglement is the key resource for quantum information processing. Device-independent certification of entangled states is a long standing open question, which arouses the concept of self-testing. The central aim of self-testing…
A set of necessary and sufficient conditions are derived for the equivalence of an arbitrary pure state and a graph state on n qubits under stochastic local operations and classical communication (SLOCC), using the stabilizer formalism.…
Using the measurement-based quantum computation model, we construct interactive proofs with non-communicating quantum provers and a classical verifier. Our construction gives interactive proofs for all languages in BQP with a polynomial…
Quantum self-testing is a device-independent way to certify quantum states and measurements using only the input-output statistics, with minimal assumptions about the quantum devices. Because of the high demand on tolerable noise, however,…
Quantum hypergraph states are the natural generalization of graph states. Here we investigate and analytically quantify entanglement and nonlocality for large classes of quantum hypergraph states. More specifically, we connect the geometric…
In this article, we extend a statistical test of graph clusterability, the $\delta$ test, to directed graphs with no self loops. The $\delta$ test, originally designed for undirected graphs, is based on the premise that graphs with a…
Graph states are a class of multi-partite entangled quantum states that are ubiquitous in quantum information. We study equivalence relations between graph states under local unitaries (LU) to obtain distinguishing methods both in local and…
The connection between certain entangled states and graphs has been heavily studied in the context of measurement-based quantum computation as a tool for understanding entanglement. Here we show that this correspondence can be harnessed in…
Bell nonlocality -- the existence of quantum correlations that cannot be explained by classical means -- is certainly one of the most striking features of quantum mechanics. Its range of applications in device-independent protocols is…
Self-tested quantum information processing provides a means for doing useful information processing with untrusted quantum apparatus. Previous work was limited to performing computations and protocols in real Hilbert spaces, which is not a…
Self-testing refers to the possibility of characterizing an unknown quantum device based only on the observed statistics. Here we develop methods for self-testing entangled quantum measurements, a key element for quantum networks. Our…
Hypergraph states are multiqubit states whose combinatorial description and entanglement properties generalize the well-studied class of graph states. Graph states are important in applications such as measurement-based quantum computation…
Quantum hypergraph states extend the well-studied class of graph states by taking into account multi-qubit interactions through hyperedges. They provide a powerful framework to represent a family of quantum states with genuine multipartite…