As a direct consequence of the no-cloning theorem, the deterministic amplification as in classical communication is impossible for unknown quantum states. This calls for more advanced techniques in a future global quantum network, e.g., for cloud quantum computing. A unique solution is the teleportation of an entangled state, i.e., entanglement swapping, representing the central resource to rel...

A relationship between a recently introduced multipartite entanglement measure, state mixedness, and spinflip symmetry is established for any finite number of qubits. It is also shown that, for those classes of states invariant under the spin-flip transformation, there is a complementarity relation between multipartite entanglement and mixedness. A number of example classes of multiple-qubit sy...

The effects of the properties of casting solution on the surface structure of poly(methyl methacrylate) (PMMA) films were systematically investigated. It was observed that the hydrophobicity of PMMA films increased with increasing viscosity of the corresponding polymer solution regardless of the film-formation techniques that were utilized. The ratio of the C-H symmetric stretching vibrations o...

Quantum entanglement cannot be unlimitedly shared among an arbitrary number of qubits. The degree of bipartite entanglement decreases as the number of entangled pairs in an N-qubit system increases. We analyze a system of N qubits in which an arbitrary pair of particles is entangled. We show that the maximum degree of entanglement ~measured in the concurrence! between any pair of qubits is 2/N ...

Quantum entanglement, the most remarkable feature of quantum physics, is recognized as a resource for quantum information processing. The quest for quantum-computing devices has also produced great interest in entanglement formation in solid-state systems involving quantum effects. Indeed, the functionality of an increasing number of nanodevices is influenced by quantum correlations. In this wo...

Quantum computation, in particular Grover’s algorithm, has aroused a great deal of interest since it allows for a quadratic speedup to be obtained in search procedures. Classical search procedures for an N element database require at most O(N) time complexity. Grover’s algorithm is able to find a solution with high probability in O( √ N ) time through an amplitude amplification scheme. In this ...

The best bound known on 2-locally distillable entanglement is that of Vedral and Plenio, involving a certain measure of entanglement based on relative entropy. It turns out that a related argument can be used to give an even stronger bound; we give this bound, and examine some of its properties. In particular, and in contrast to the earlier bounds, the new bound is not additive in general. We g...