Related papers: Calculating Concentratable Entanglement in Graph S…
Graph states (or cluster states) are the entanglement resource that enables one-way quantum computing. They can be grown by projective measurements on the component qubits. Such measurements typically carry a significant failure…
Hypergraph states are multi-qubit states that form a subset of the locally maximally entangleable states and a generalization of the well--established notion of graph states. Mathematically, they can conveniently be described by a…
We describe an entanglement purification protocol to generate maximally entangled states with high efficiencies from two-mode squeezed states or from mixed Gaussian continuous entangled states. The protocol relies on a local quantum…
We investigate a family of quantum states defined by directed graphs, where the oriented edges represent interactions between ordered qubits. As a measure of entanglement, we adopt the Entanglement Distance - a quantity derived from the…
Fathoming out quantum state space is a challenging endeavor due to its exponentially growing dimensionality. At the expense of being bound in its expressiveness, the discrete and finite subspace of graph states is easier to investigate via…
We introduce a class of multiqubit quantum states which generalizes graph states. These states correspond to an underlying mathematical hypergraph, i.e. a graph where edges connecting more than two vertices are considered. We derive a…
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 the key resources for measurement- and fusion-based quantum computing with photons, yet their creation is experimentally challenging. We optimize a hybrid graph-state generation scheme using a single quantum emitter and…
A set of necessary and sufficient conditions are derived for the equivalence of an arbitrary pure state and a graph state on n qubits under stochastic local operations and classical communication (SLOCC), using the stabilizer formalism.…
We propose schemes for entanglement concentration and purification for qubit systems encoded in flying atomic pairs. We use a cavity-quantum electrodynamics setting as the paradigmatic scenario within which our proposals can be implemented.…
We present a closest separable state to cluster states. We start by considering linear cluster chains and extend our method to cluster states that can be used as a universal resource in quantum computation. We reproduce known results for…
We extend the idea of entanglement concentration for pure states(Phys. Rev. Lett. {\bf 88}, 187903) to the case of mixed states. The scheme works only with particle statistics and local operations, without the need of any other…
We study the entanglement properties of quantum hypergraph states of $n$ qubits, focusing on multipartite entanglement. We compute multipartite entanglement for hypergraph states with a single hyperedge of maximum cardinality, for…
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…
Stabilizer states constitute a set of pure states which plays a dominant role in quantum error correction, measurement--based quantum computation, and quantum communication. Central in these applications are the local symmetries of these…
Entanglement of formation quantifies the entanglement of a state in terms of the entropy of entanglement of the least entangled pure state needed to prepare it. An analytical expression for this measure exists only for special cases, and…
The central focus of this work is to make progress towards understanding entanglement as a resource for computation by examining the quantum correlations that can be extracted from stabilizer states. As such, we focus on the stabilizer…
Entanglement is a crucial resource for quantum information processing, and so protocols to generate high fidelity entangled states on various hardware platforms are in demand. While spin chains have been extensively studied to generate…
We present a scheme for rapidly entangling matter qubits in order to create graph states for one-way quantum computing. The qubits can be simple 3-level systems in separate cavities. Coupling involves only local fields and a static…
In this paper, we explore the graphical representation of two-qubit entanglement on two Bloch Spheres via stabilizer formalism. We relate the density matrix to the graphical representation on two Bloch Spheres by showing how both may be…