Related papers: Studies of properties of bipartite graphs with qua…
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…
We study the entanglement between a certain qubit and the remaining system in rank- 2 mixed states prepared on the quantum computer. The protocol, which we propose for this purpose, is based on the relation of geometric measure of…
Measuring entanglement is a demanding task in the field of quantum computation and quantum information theory. Recently, some authors experimentally demonstrated an embedding quantum simulator, using it to efficiently measure two-qubit…
For Bernoulli percolation on a given graph $G = (V,E)$ we consider the cluster of some fixed vertex $o \in V$. We aim at comparing the number of vertices of this cluster in the set $V_+$ and in the set $V_-$, where $V_+,V_- \subset V$ have…
We study entanglement properties of hypergraph states in arbitrary finite dimension. We compute multipartite entanglement of elementary qudit hypergraph states, namely those endowed with a single maximum-cardinality hyperedge. We show that,…
The detection and classification of entanglement properties in a two-qubit and a multi-qubit system is a topic of great interest. This topic has been extensively studied, and as a result, we discovered various approaches for detecting and…
The unambiguous detection and quantification of entanglement is a hot topic of scientific research, though it is limited to low dimensions or specific classes of states. Here we identify an additional class of quantum states, for which…
We undertake a study of the notion of a quantum graph over arbitrary finite-dimensional $C^*$-algebras $B$ equipped with arbitrary faithful states. Quantum graphs are realised principally as either certain operators on $L^2(B)$, the quantum…
Starting from arbitrary Hilbert spaces, we reduce the problem to verify entanglement of any bipartite quantum state to finite dimensional subspaces. Hence, entanglement is a finite dimensional property. A generalization for multipartite…
Inspired by a concept in comparative genomics, we investigate properties of randomly chosen members of G_1(m,n,t), the set of bipartite graphs with $m$ left vertices, n right vertices, t edges, and each vertex of degree at least one. We…
Hypergraph states are multi-qubit states that form a subset of the locally maximally entangleable states and a generalization of the well--established notion of graph states. Mathematically, they can conveniently be described by a…
A genuinely $N$-partite entangled state may display vanishing $N$-partite correlations measured for arbitrary local observables. In such states the genuine entanglement is noticeable solely in correlations between subsets of particles. A…
The aim of the paper is to propose geometric descriptions of multipartite entangled states using algebraic geometry. In the context of this paper, geometric means each stratum of the Hilbert space, corresponding to an entangled state, is an…
Quantum entanglement plays an irreplaceable role in various remote quantum information processing tasks. Here we present protocols for generating deterministic and heralded $N$-qubit entangled states across multiple network nodes. By…
We build a machine learning model to detect correlations in a three-qubit system using a neural network trained in an unsupervised manner on randomly generated states. The network is forced to recognize separable states, and correlated…
We present a review of the problem of finding out whether a quantum state of two or more parties is entangled or separable. After a formal definition of entangled states, we present a few criteria for identifying entangled states and…
Distributing entanglement among multiple users is a fundamental problem in quantum networks, requiring an efficient solution. In this work, a protocol is proposed for extracting maximally entangled (GHZn) states for any number of parties in…
In this paper, we present schemes for a type of one-parameter bipartite quantum states to probe the quantum entanglement, the quantum discord, the classical correlation and the quantum state based on the cavity QED. It is shown that our…
This work studies how a suitably-designed classical system generates with a quantum-like (QL) state space mediated by a graph. The graph plays a special dual role by directing the topology of the classical network and defining a state space…
We propose a quantum computation architecture based on geometries with nearest-neighbor interactions, including e.g. planar structures. We show how to efficiently split the role of qubits into data and entanglement-generation qubits.…