123 resultados para Secure Multiparty Computation


Relevância:

10.00% 10.00%

Publicador:

Resumo:

We consider pure continuous variable entanglement with non-equal correlations between orthogonal quadratures. We introduce a simple protocol which equates these correlations and in the process transforms the entanglement onto a state with the minimum allowed number of photons. As an example we show that our protocol transforms, through unitary local operations, a single squeezed beam split on a beam splitter into the same entanglement that is produced when two squeezed beams are mixed orthogonally. We demonstrate that this technique can in principle facilitate perfect teleportation utilizing only one squeezed beam.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

We introduce a refinement of the standard continuous variable teleportation measurement and displacement strategies. This refinement makes use of prior knowledge about the target state and the partial information carried by the classical channel when entanglement is nonmaximal. This gives an improvement in the output quality of the protocol. The strategies we introduce could be used in current continuous variable teleportation experiments.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In this paper we present a technique for visualising hierarchical and symmetric, multimodal fitness functions that have been investigated in the evolutionary computation literature. The focus of this technique is on landscapes in moderate-dimensional, binary spaces (i.e., fitness functions defined over {0, 1}(n), for n less than or equal to 16). The visualisation approach involves an unfolding of the hyperspace into a two-dimensional graph, whose layout represents the topology of the space using a recursive relationship, and whose shading defines the shape of the cost surface defined on the space. Using this technique we present case-study explorations of three fitness functions: royal road, hierarchical-if-and-only-if (H-IFF), and hierarchically decomposable functions (HDF). The visualisation approach provides an insight into the properties of these functions, particularly with respect to the size and shape of the basins of attraction around each of the local optima.