Related papers: Transforming graph states via Bell state measureme…
Graph translation is very promising research direction and has a wide range of potential real-world applications. Graph is a natural structure for representing relationship and interactions, and its translation can encode the intrinsic…
Braunstein et. al. have started the study of entanglement properties of the quantum states through graph theoretical approach. Their idea was to start from a simple unweighted graph $G$ and then they have defined the quantum state from the…
Graph states, which include for example Bell states, GHZ states and cluster states, form a well-known class of quantum states with applications ranging from quantum networks to error-correction. Deciding whether two graph states are…
Graph states are a central resource in measurement-based quantum information processing. In the photonic qubit architecture based on Gottesman-Kitaev-Preskill (GKP) encoding, the generation of high-fidelity graph states composed of…
We propose a simple scheme for complete Bell-state measurement of photons using hyperentangled states - entangled in multiple degrees of freedom. In addition to hyperentanglement, our scheme requires only linear optics and single photon…
Graph states form a large family of quantum states that are in one-to-one correspondence with mathematical graphs. Graph states are used in many applications, such as measurement-based quantum computation, as multipartite entangled…
Measurement-based quantum computing is one of the most promising quantum computing models. Although various universal resource states have been proposed so far, it was open whether only two Pauli bases are enough for both of universal…
We introduce a new family of models for measurement-based quantum computation which are deterministic and approximately universal. The resource states which play the role of graph states are prepared via 2-qubit gates of the form…
We consider the problem of learning $N$ identical copies of an unknown $n$-qubit quantum graph state with product measurements. These graph states have corresponding graphs where every vertex has exactly $d$ neighboring vertices. Here, we…
In this paper, we study the multipartite entanglement properties of graph states up to seven qubits. Our analysis shows that the generalized concurrence measure is more efficient than geometric entanglement measure for measuring…
The most efficient automated way to construct a large class of quantum photonic experiments is via abstract representation of graphs with certain properties. While new directions were explored using Artificial intelligence and SAT solvers…
Computationally feasible multipartite entanglement measures are needed to advance our understanding of complex quantum systems. An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and…
It is well-known that maximally entangled states such as the Greenberger-Horne-Zeilinger (GHZ) states, with the Bell states as the simplest examples, are widely exploited in quantum information and computation. We study the application of…
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…
We combine the concept of Bell measurements, in which two systems are projected into a maximally entangled state, with the concept of continuous measurements, which concerns the evolution of a continuously monitored quantum system. For such…
Multipartite entangled states are great resources for quantum networks. In this work we study the distribution, or routing, of entangled states over fixed, but arbitrary, physical networks. Our simplified model represents each use of a…
The aim of this paper is to introduce a new graphic representation of quantum states by means of a specific application: the analysis of two models of quantum copying machines. The graphic representation by diagrams of states offers a clear…
We construct a scheme for the preparation, pairwise entanglement via exchange interaction, manipulation, and measurement of individual group-II-like neutral atoms (Yb, Sr, etc.). Group-II-like atoms proffer important advantages over alkali…
Measurement-based quantum computation (MBQC) is a strong contender for realizing quantum computers. A critical question for MBQC is the identification of resource graph states that can enable universal quantum computation. Any such…
Many systems comprising entities in interactions can be represented as graphs, whose structure gives significant insights about how these systems work. Network theory has undergone further developments, in particular in relation to…