Related papers: Confusability graphs for symmetric sets of quantum…
Graph states provide a powerful framework for describing multipartite entanglement in quantum information science. In their standard formulation, graph states are generated by controlled-$Z$ interactions and naturally encode symmetric…
We introduce a new approach to confusability in a quantum channel, namely quantum confusability multigraph, which incorporates the output information into the graphical structure. By``counting" the edges between two vertices of this…
Quantum discord refers to an important aspect of quantum correlations for bipartite quantum systems. In our earlier works we have shown that corresponding to every graph (combinatorial) there are quantum states whose properties are…
Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph,…
We investigate the undetermined sets consisting of two-level, multi-partite pure quantum states, whose reduced density matrices give absolutely no information of their original states. Two approached of finding these quantum states are…
Graph states are a large class of multipartite entangled quantum states that form the basis of schemes for quantum computation, communication, error correction, metrology, and more. In this work, we consider verification of graph states…
Quantum networks are promising tools for the implementation of long-range quantum communication. The characterization of quantum correlations in networks and their usefulness for information processing is therefore central for the progress…
We develop the theory of quantum (a.k.a. noncommutative) relations and quantum (a.k.a. noncommutative) graphs in the finite-dimensional covariant setting, where all systems (finite-dimensional $C^*$-algebras) carry an action of a compact…
A fundamental problem in quantum information is to describe efficiently multipartite quantum states. An efficient representation in terms of graphs exists for several families of quantum states (graph, cluster, stabilizer states),…
Entanglement is a fundamental resource for many applications in quantum information processing. Here, we investigate how quantum transport in simple quantum graphs, modeled as controlled two-level quantum systems, can be utilized to…
In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for…
Quantum networks are important for quantum communication, enabling tasks such as quantum teleportation, quantum key distribution, quantum sensing, and quantum error correction, often utilizing graph states, a specific class of multipartite…
An analysis is made of a moving disturbance using a directed cyclic graph. A statistical approach is used to calculate the alternative positions in space and state of the disturbance with a defined observed time. The probability for a…
We summarize different approaches to the theory of quantum graphs and provide several ways to construct concrete examples. First, we classify all undirected quantum graphs on the quantum space $M_2$. Secondly, we apply the theory of…
When an observer wants to identify a quantum state, which is known to be one of a given set of non-orthogonal states, the act of observation causes a disturbance to that state. We investigate the tradeoff between the information gain and…
We formulate a notion of the quantum automorphism group of a $2$-graph. After some preliminary computations, we define quantum isomorphism between a pair of $2$-graphs. We produce a `non-trivial' example of a pair of $2$-graphs that are not…
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…
We present a construction of genuinely entangled multipartite quantum states based on the group theory. Analyzed states resemble the Dicke states, whereas the interactions occur only between specific subsystems related by the action of the…
The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…
The indistinguishability of quantum particles is widely used as a resource for the generation of entanglement. Linear quantum networks (LQNs), in which identical particles linearly evolve to arrive at multimode detectors, exploit the…