Related papers: Graph state extraction from two-dimensional cluste…

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…

Realizing photonic graph states, crucial in various quantum protocols, is challenging due to the absence of deterministic entangling gates in linear optics. To address this, emitter qubits have been leveraged to establish and transfer the…

Effective routing of entanglements over a quantum network is a fundamental problem in quantum communication. Due to the fragility of quantum states, it is difficult to route entanglements at long distances. Graph states can be utilized for…

We describe a procedure for graph state quantum computing that is tailored to fully exploit the physics of optically active multi-level systems. Leveraging ideas from the literature on distributed computation together with the recent work…

We exactly evaluate a number of multipartite entanglement measures for a class of graph states, including d-dimensional cluster states (d = 1,2,3), the Greenberger-Horne-Zeilinger states, and some related mixed states. The entanglement…

Graph states are a powerful class of entangled states with numerous applications in quantum communication and quantum computation. Local Clifford (LC) operations that map one graph state to another can alter the structure of the…

We propose a protocol to generate a stream of mobile qubits in a graph state through a single stationary parent qubit and discuss two types of its physical implementation, namely, the generation of photonic graph states through an atom-like…

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…

With the increased complexity of power systems due to the integration of smart grid technologies and renewable energy resources, more frequent changes have been introduced to system status, and the traditional serial mode of state…

Cluster states can be used to perform measurement-based quantum computation. The cluster state is a useful resource, because once it has been generated only local operations and measurements are needed to perform universal quantum…

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),…

Graph-based clustering methods like spectral clustering and SpectralNet are very efficient in detecting clusters of non-convex shapes. Unlike the popular $k$-means, graph-based clustering methods do not assume that each cluster has a single…

Graph states are multi-particle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of…

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 propose a method to efficiently generate cluster states in charge qubits, both semiconducting and superconducting, as well as flux qubits. We show that highly-entangled cluster states can be realized by a `one-touch' entanglement…

Local sets, a graph structure invariant under local complementation, have been originally introduced in the context of quantum computing for the study of quantum entanglement within the so-called graph state formalism. A local set in a…

We discuss quantum state tomography via a stepwise reconstruction of the eigenstates of the mixed states produced in experiments. Our method is tailored to the experimentally relevant class of nearly pure states or simple mixed states,…

Sampling technique has become one of the recent research focuses in the graph-related fields. Most of the existing graph sampling algorithms tend to sample the high degree or low degree nodes in the complex networks because of the…

Graph states are a class of multi-partite entangled quantum states that are ubiquitous in quantum information. We study equivalence relations between graph states under local unitaries (LU) to obtain distinguishing methods both in local and…

Bi-partite entanglement in multi-qubit systems cannot be shared freely. The rules of quantum mechanics impose bounds on how multi-qubit systems can be correlated. In this paper we utilize a concept of entangled graphs with weighted edges in…