Related papers: Perfect Cluster States from Imperfect Global Entan…
Quantum networks with bipartite resources and shared randomness present the simplest infrastructure for implementing a future quantum internet. Here, we shall investigate which kinds of entanglement can or cannot be generated from this kind…
To gain an advantage, quantum technologies utilize phenomena particular to quantum mechanics. Two such phenomena are squeezing and entanglement. Having generated states that exhibit these features, verification of their generation with…
Multiparty quantum states are useful for a variety of quantum information and computation protocols. We define a multiparty entanglement measure based on local measurements on a multiparty quantum state, and an entanglement measure averaged…
We propose an experimental scheme that has the potential for large-scale realization of continuous-variable (CV) cluster states for universal quantum computation. We do this by mapping CV cluster-state graphs onto two-mode squeezing graphs,…
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…
Hypergraph states are multiqubit states whose combinatorial description and entanglement properties generalize the well-studied class of graph states. Graph states are important in applications such as measurement-based quantum computation…
Characterizing entanglement in all but the simplest case of a two qubit pure state is a hard problem, even understanding the relevant experimental quantities that are related to entanglement is difficult. It may not be necessary, however,…
We present a scalable method for generation of a cluster state for measurement-based quantum computing using van der Waals or dipole-dipole interactions between neutral atoms or polar molecules in an optical lattice. Nearest neighbor…
The bipartite entanglement of a pure quantum state is known to be characterized by its Schmidt decomposition. In particular the state is maximally entangled when all the Schmidt coefficients are equal. We point out a convenient method which…
We present optimal measuring strategies for the estimation of the entanglement of unknown two-qubit pure states and of the degree of mixing of unknown single-qubit mixed states, of which N identical copies are available. The most general…
Entanglement is a unique nature of quantum theory and has tremendous potential for application. Nevertheless, the complexity of quantum entanglement grows exponentially with an increase in the number of entangled particles. Here we…
The size of the Hilbert space for a multiqubit state scales exponentially with the number of constituent qubits. Often this leads to a similar exponential scaling of the experimental resources required to characterize the state. Contrary to…
Entanglement is one of the key resources of quantum information science which makes identification of entangled states essential to a wide range of quantum technologies and phenomena. This problem is however both computationally and…
In this paper, we estimate the errors of Gaussian transformations implemented using one-way quantum computations on cluster states of various configurations. From all possible cluster state configurations, we choose those that give the…
An experimental verification of the maximally entangled state ensures that the constructed state is close to the maximally entangled state, but it does not guarantee that the state is exactly the same as the maximally entangled state.…
Although the realization of useful quantum computers poses significant challenges, swift progress in emerging quantum technologies is making this goal realistically approachable. In this context, one of the essential resources is quantum…
Given a suitably large and well connected (complex) graph state, any quantum algorithm can be implemented purely through local measurements on the individual qubits. Measurements can also be used to create the graph state: Path erasure…
Two pure orthogonal quantum states can be perfectly distinguished by sequential local action of multiple pairs of parties. However, this process typically leads to the complete dissolution of entanglement in the states being discriminated.…
We propose a entanglement generating set for a general multipartite state based on the of concurrence. In particular, we show that concurrence for general multipartite states can be constructed by different classes of local operators which…
Multipartite entanglement has been widely regarded as key resources in distributed quantum computing, for instance, multi-party cryptography, measurement based quantum computing, quantum algorithms. It also plays a fundamental role in…