Related papers: Entanglement in eight-qubit graph states
Graph states are a fundamental entanglement resource for multipartite quantum applications which are in general challenging to transform efficiently. While fusion operations for merging entangled states are well-developed, no direct…
We show that any pseudoentangled state ensemble with a gap of $t$ bits of entropy requires $\Omega(t)$ non-Clifford gates to prepare. This bound is tight up to polylogarithmic factors if linear-time quantum-secure pseudorandom functions…
We investigate the entanglement properties of quantum states associated with directed graphs. Using a measure derived from the Fubini-Study metric, we quantitatively relate multipartite entanglement to the local connectivity of the graph.…
We present a package of mathematical theorems, which allow to construct multipartite entanglement criteria. Importantly, establishing bounds for certain classes of entanglement does not take an optimization over continuous sets of states.…
The amount of entanglement that exists in a parametric down-converted state is investigated in terms of all the degrees of freedom of the state. We quantify the amount of entanglement by the Schmidt number of the state, represented as a…
Highly entangled quantum states are an ingredient in numerous applications in quantum computing. However, preparing these highly entangled quantum states on currently available quantum computers at high fidelity is limited by ubiquitous…
We investigate the Hamming networks that their nodes are considered as quantum harmonic oscillators. The entanglement of the ground state can be used to quantify the amount of information each part of a network shares with the rest of the…
From both theoretical and experimental points of view symmetric states constitute an important class of multipartite states. Still, entanglement properties of these states, in particular those with positive partial transposition (PPT), lack…
Graph states are an important class of multipartite entangled quantum states. We propose a new approach for distributing graph states across a quantum network. We consider a quantum network consisting of nodes-quantum computers within which…
The phase space for a system of $n$ qubits is a discrete grid of $2^{n} \times 2^{n}$ points, whose axes are labeled in terms of the elements of the finite field $\Gal{2^n}$ to endow it with proper geometrical properties. We analyze the…
In this work, we present a comprehensive exploration of the entanglement and graph connectivity properties of graph states. We quantify the entanglement in pseudo graph states using the entanglement distance, a recently introduced measure…
We propose a new classification scheme for quantum entanglement based on topological links. This is done by identifying a non-rigid ring to a particle, attributing the act of cutting and removing a ring to the operation of tracing out the…
Many-body quantum systems can be characterised using the notions of \emph{k}-separability and entanglement depth. A quantum state is \emph{k}-separable if it can be expressed as a mixture of \emph{k} entangled subsystems, and its…
Hypergraph states form a family of multiparticle quantum states that generalizes cluster states and graph states. We study the action and graphical representation of nonlocal unitary transformations between hypergraph states. This leads to…
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…
In Quantum Information theory, graph states are quantum states defined by graphs. In this work we exhibit a correspondence between graph states and the variety of binary symmetric principal minors, in particular their corresponding orbits…
Entanglement between three or more parties exhibits a realm of properties unknown to two-party states. Bipartite states are easily classified using the Schmidt decomposition. The Schmidt coefficients of a bipartite pure state encompass all…
We first present a generalized criterion for maximally entangled states of 2, 3, 4, 5, 6, 8 and in theory to arbitrary-number qubits. By this criterion, some known highly entangled multi-qubit states are examined and a new genuine…
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 investigate the hypercube networks that their nodes are considered as quantum harmonic oscillators. The entanglement of the ground state can be used to quantify the amount of information each part of a network shares with the rest of the…