Related papers: Purification of large bicolorable graph states
We introduce a class of multiparticle entanglement purification protocols that allow us to distill a large class of entangled states. These include cluster states, GHZ states and various error correction codes all of which belong to the…
We investigate multiparticle entanglement purification schemes which allow one to purify all two colorable graph states, a class of states which includes e.g. cluster states, GHZ states and codewords of various error correction codes. The…
We present multiparty entanglement purification protocols that are capable of purifying arbitrary graph states directly. We develop recurrence and breeding protocols and compare our methods with strategies based on bipartite entanglement…
Entanglement purification describes a primitive in quantum information processing, where several copies of noisy quantum states are distilled into few copies of nearly-pure states of high quality via local operations and classical…
We investigate efficient entanglement purification through double selection process. This method works with higher noise thresholds for the communication channels and local operations, and achieves higher fidelity of purified states.…
A method for producing an upper bound for all multipartite purification protocols is devised, based on knowing the optimal protocol for purifying bipartite states. When applied to a range of noise models, both local and correlated, the…
In this paper, a purification protocol is presented and its performance is proven to be optimal when applied to a particular subset of graph states that are subject to local Z-noise. Such mixed states can be produced by bringing a system…
Given a large social or information network, how can we partition the vertices into sets (i.e., colors) such that no two vertices linked by an edge are in the same set while minimizing the number of sets used. Despite the obvious practical…
We consider entanglement purification protocols for multiple copies of qubit states. We use high-dimensional auxiliary entangled systems to learn about number and positions of errors in the noisy ensemble in an explicit and controlled way,…
We propose a fast approximate algorithm for large graph matching. A new projected fixed-point method is defined and a new doubly stochastic projection is adopted to derive the algorithm. Previous graph matching algorithms suffer from high…
Quantum state purification is crucial in quantum communication and computation, aiming to recover a purified state from multiple copies of an unknown noisy state. This work introduces a general state purification framework designed to…
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…
In this paper, we initiate the study of the vertex coloring problem of a graph in the semi streaming model. In this model, the input graph is defined by a stream of edges, arriving in adversarial order and any algorithm must process the…
We study the graph coloring problem over random graphs of finite average connectivity $c$. Given a number $q$ of available colors, we find that graphs with low connectivity admit almost always a proper coloring whereas graphs with high…
We present an improved protocol for entanglement purification of bipartite mixed states using several states at a time rather than two at a time as in the traditional recurrence method. We also present a generalization of the hashing method…
Graph states are a large class of multipartite entangled quantum states that form the basis of schemes for quantum computation, communication, error correction, metrology, and more. In this work, we consider verification of graph states…
Irregular computations on unstructured data are an important class of problems for parallel programming. Graph coloring is often an important preprocessing step, e.g. as a way to perform dependency analysis for safe parallel execution. The…
Recent work on fault-tolerant quantum computation making use of topological error correction shows great potential, with the 2d surface code possessing a threshold error rate approaching 1% (NJoP 9:199, 2007), (arXiv:0905.0531). However,…
Graph coloring problems are a central topic of study in the theory of algorithms. We study the problem of partially coloring partially colorable graphs. For $\alpha \leq 1$ and $k \in \mathbb{Z}^+$, we say that a graph $G=(V,E)$ is…
Uncertain graphs are prevalent in several applications including communications systems, biological databases and social networks. The ever increasing size of the underlying data renders both graph storage and query processing extremely…