Related papers: Quantum LOSR networks cannot generate graph states…
For two symmetric quantum states one may be interested in maximizing the overlap under local operations applied to one of them. The question arises whether the maximal overlap can be obtained by applying the same local operation to each…
We study the existence of quantum state transfer in $\mathcal{Q}$-graphs in this paper. The $\mathcal{Q}$-graph of a graph $G$, denoted by $\mathcal{Q}(G)$, is the graph derived from $G$ by plugging a new vertex to each edge of $G$ and…
In quantum computing and quantum information processing, graph states are a specific type of quantum states which are commonly used in quantum networking and quantum error correction. A recurring problem is finding a transformation from a…
A quantum network requires information transfer between distant quantum computers, which would enable distributed quantum information processing and quantum communication. One model for such a network is based on the probabilistic…
Borrowing ideas from the relation between simply laced Lie algebras and Dynkin diagrams, a weighted graph theory representation of quantum information is addressed. In this way, the density matrix of a quantum state can be interpreted as a…
Genuine multipartite nonlocality and nonlocality arising in networks composed of several independent sources have been separately investigated. While some genuinely entangled states cannot be verified by violating a single Bell-type…
As quantum theory allows for information processing and computing tasks that otherwise are not possible with classical systems, there is a need and use of quantum Internet beyond existing network systems. At the same time, the realization…
Quantum network states are multipartite states built from distributing pairwise entanglement among parties and underpin the paradigm of quantum networks for quantum information processing. In this work we introduce the problem of partial…
Graph states are generalized from qubits to collections of $n$ qudits of arbitrary dimension $D$, and simple graphical methods are used to construct both additive and nonadditive quantum error correcting codes. Codes of distance 2…
A fundamental problem in Quantum Information Processing is the discrimination amongst a set of quantum states of a system. In this paper, we address this problem on an open quantum system described by a graph, whose evolution is defined by…
The big challenge in quantum computing is to realize scalable multi-qubit systems with cross-talk free addressability and efficient coupling of arbitrarily selected qubits. Quantum networks promise a solution by integrating smaller qubit…
We construct families of graphs from linear groups $\mathrm{SL}(2,q)$, $\mathrm{GL}(2,q)$ and $\mathrm{GU}(2,q^2)$, where $q$ is an odd prime power, with the property that the continuous-time quantum walks on the associated networks of…
We introduce a novel quantum algorithm for determining graph connectedness using a constant number of measurements. The algorithm can be extended to find connected components with a linear number of measurements. It relies on non-unitary…
Multipartite entangled states are great resources for quantum networks. In this work we study the distribution, or routing, of entangled states over fixed, but arbitrary, physical networks. Our simplified model represents each use of a…
The leading approach to fault tolerant quantum computing requires a continual supply of magic states. When a new magic state is first encoded, its initial fidelity will be too poor for use in the computation. This necessitates a…
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…
The information obtained from the operation of a quantum gate on only two complementary sets of input states is sufficient to estimate the quantum process fidelity of the gate. In the case of entangling gates, these conditions can be used…
Graph states, and the entanglement they posses, are central to modern quantum computing and communications architectures. Local complementation---the graph operation that links all local-Clifford equivalent graph states---allows us to…
Armed with quantum correlations, quantum sensors in a network have shown the potential to outclass their classical counterparts in distributed sensing tasks such as clock synchronization and reference frame alignment. On the other hand,…
One of the many interesting features of quantum nonlocality is that the states of a multipartite quantum system cannot always be distinguished as well by local measurements as they can when all quantum measurements are allowed. In this…