Related papers: Scalable Generation of Graph-State Entanglement th…

We present a procedure for confirming the generation of long strings of photons in an entangled (cluster) state that does not rely on complete state tomography and that works even at low collection efficiencies. The scheme has the added…

Future quantum computers require a scalable architecture on a scalable technology---one that supports millions of high-performance components. Measurement-based protocols, based on graph states, represent the state of the art in…

We present an entanglement generation scheme which allows arbitrary graph states to be efficiently created in a linear quantum register via an auxiliary entangling bus. The dynamics of the entangling bus is described by an effective…

To achieve scalable quantum information processing, great efforts have been devoted to the creation of large-scale entangled states in various physical systems. Ultracold atom in optical lattice is considered as one of the promising…

Deep graph generative modeling has proven capable of learning the distribution of complex, multi-scale structures characterizing real-world graphs. However, one of the main limitations of existing methods is their large output space, which…

Graph states form a rich class of entangled states that exhibit important aspects of multi-partite entanglement. At the same time, they can be described by a number of parameters that grows only moderately with the system size. They have a…

Learning system dynamics directly from observations is a promising direction in machine learning due to its potential to significantly enhance our ability to understand physical systems. However, the dynamics of many real-world systems are…

Quantum states of light with many entangled photons are key resources for photonic quantum computing and quantum communication. In this work, we exploit a highly resource-efficient generation scheme based on a linear optical circuit…

We report a practical non-postselection entanglement concentration scheme in which a maximally entangled Bell-state photon pair is produced from two pairs of partially (or non-maximally) entangled photons. Since this scheme is built only…

We propose a method to generate entanglement measures systematically by using the irreducible decomposition of some copies of a state under the local unitary (LU) transformations. It is applicable to general multipartite systems. We show…

A method for exploring photon-number entangled states with weak nonlinearities is described. We show that it is possible to create and detect such entanglement at various scales, ranging from microscopic to macroscopic systems. In the…

Current photon entangling schemes require resources that grow with the photon number. We present a new approach that generates quantum entanglement between many photons, using only a single source of entangled photon pairs. The different…

Light states composed of multiple entangled photons - such as cluster states - are essential for developing and scaling-up quantum computing networks. Photonic cluster states with discrete variables can be obtained from single-photon…

The proposed approach yields a numerical method that provably executes in linear time with respect to the number of nodes and edges in a graph. The graph, constructed from the power system model, requires only knowledge of the dependencies…

We propose a method to calculate the purity of reduced states of graph states entirely within the stabilizer formalism, using only the stabilizer generators for a given state. We apply this method to find the Concentratable Entanglement of…

We consider the generation of photonic graph states in a linear optics setting where sequential non-deterministic fusion measurements are used to build large graph states out of small linear clusters and develop a framework to optimize the…

Preparation of entangled states of photons are useful for quantum computing and communication. In this paper, we present a simplistic protocol of entanglement generation using beam splitters with suitable reflectivity. The photons in an…

Structural balance modeling for signed graph networks presents how to model the sources of conflicts. The state-of-the-art focuses on computing the frustration index of a signed graph, a critical step toward solving problems in social and…

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…

We present an algorithm that enumerates all the minimal triangulations of a graph in incremental polynomial time. Consequently, we get an algorithm for enumerating all the proper tree decompositions, in incremental polynomial time, where…