Related papers: Studies of properties of bipartite graphs with qua…
Coherent manipulation of an increasing number of qubits for the generation of entangled states has been an important goal and benchmark in the emerging field of quantum information science. The multiparticle entangled states serve as…
A signed bipartite graph G(U, V) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V) is the number of positive edges incident with x less the number of negative edges…
Random local measurements have recently been proposed to construct entanglement witnesses and thereby detect the presence of bipartite entanglement. We experimentally demonstrate the efficacy of one such scheme on a two-qubit NMR quantum…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
Genuine entanglement is the strongest form of multipartite entanglement. Genuinely entangled pure states contain entanglement in every bipartition and as such can be regarded as a valuable resource in the protocols of quantum information…
We consider the problem of constructing a bipartite graph whose degrees lie in prescribed intervals. Necessary and sufficient conditions for the existence of such graphs are well-known. However, existing realization algorithms suffer from…
Indistinguishability of identical particles is a resource for quantum information processing and has been utilized to generate entanglement from independent particles that spatially overlap only at the detection stage. Here we provide a…
We propose a technique to investigate multipartite entanglement in the symmetric subspace. Our approach is to map an $N$-qubit symmetric state onto a bipartite symmetric state of higher local dimension. We show that this mapping preserves…
The name graph state is used to describe a certain class of pure quantum state which models a physical structure on which one can perform measurement-based quantum computing, and which has a natural graphical description. We present the…
We study the problem of determining whether a given graph~$G=(V,E)$ admits a matching~$M$ whose removal destroys all odd cycles of~$G$ (or equivalently whether~$G-M$ is bipartite). This problem is equivalent to determine whether~$G$ admits…
We present a protocol for generating multiqubit quantum states with translationally invariant pairwise entanglement. Our approach is tailored for digital quantum computers with restricted qubit connectivity, a common limitation in…
Highly entangled multipartite states such as k-uniform (k-UNI) and absolutely maximally entangled (AME) states serve as critical resources in quantum networking and other quantum information applications. However, there does not yet exist a…
Multipartite entangled states are fundamental resources for multi-user quantum cryptographic tasks. Despite significant advancements in generating large-scale continuous-variable (CV) cluster states, particularly the dual-rail cluster state…
We consider a collection of bosonic modes corresponding to the vertices of a graph $\Gamma.$ Quantum tunneling can occur only along the edges of $\Gamma$ and a local self-interaction term is present. Quantum entanglement of one vertex with…
Strong nonlocality based on local distinguishability is a stronger form of quantum nonlocality recently introduced in multipartite quantum systems: an orthogonal set of multipartite quantum states is said to be of strong nonlocality if it…
We study space and time efficient quantum algorithms for two graph problems -- deciding whether an $n$-vertex graph is a forest, and whether it is bipartite. Via a reduction to the s-t connectivity problem, we describe quantum algorithms…
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…
The concept of entanglement splitting is introduced by asking whether it is possible for a party possessing half of a pure bipartite quantum state to transfer some of his entanglement with the other party to a third party. We describe the…
We investigate the generation of multipartite entangled SU(k+1) coherent states using a quantum network involving a sequence of k beam splitters. We particularly investigate the entanglement in multipartite SU(2) coherent states (k = 1). We…
This work is at the interface of graph theory and quantum mechanics. Quantum correlations epitomize the usefulness of quantum mechanics. Quantum discord is an interesting facet of bipartite quantum correlations. Earlier, it was shown that…