Classical Communication Cost and Remote Preparation of Multi-qubit with Three-Party

We present a scheme for probabilistic remote preparation of multi-qubit with three-party from a sender to either of two receivers. The quantum channel is composed of a partial entangled tripartite GHZ state. We obtain the successful totM probability of the scheme in the general case and special case, respectively. We also calculate total classical communication cost required in the RSP process with three-party in the general case and special case, respectively.

Probabilistic remote preparation of a high-dimensional equatorial multiqubit with four-party and classical communication cost

This paper presents a protocol for probabilistic remote preparation of a high-dimensional equatorial multiqubit with four-party, consisting of a sender and three receivers. The quantum channel is composed of a partial entangled high-dimensional four-particle state. We calculate the successful total probability and the total classical communication cost required for this scheme. It is shown that both the entangled resources and classical communication cost are greatly reduced.

Classical Communication Cost and Probabilistic Remote Preparation of Four-Particle Entangled W State

We present a scheme for probabilistic remote preparation of the four-particle entangled W state by using four partial entangled two-particle states as the quantum channel. In this scheme, if Alice （sender） performs four-particle projective measurements and Bob （receiver） adopts some appropriate unitary operation, the remote state preparation can be successfully realized with certain probability. The classical communication cost is also calculated. However, the success probability of preparation can be increased to 1 for four kinds of special states.

Classical Communication and Entanglement Cost in Preparing a Class of Multi-qubit States

Recently, several similar protocols [J. Opt. B 4 （2002） 380; Phys. Lett. A 316 （2003） 159; Phys. Lett. A 355 （2006） 285; Phys. Lett. A 336 （2005） 317] for remotely preparing a class of multi-qubit states （i.e, α[0...0〉 ＋β[1... 1〉） were proposed, respectively. In this paper, by applying the controlled-not （CNOT） gate, a new simple protocol is proposed for remotely preparing such class of states. Compared to the previous protocols, both classical communication cost and required quantum entanglement in our protocol are remarkably reduced. Moreover, the difficulty of identifying some quantum states in our protocol is also degraded. Hence our protocol is more economical and feasible.

A Partitioning Methodology That Optimizes the Communication Cost for Reconfigurable Computing Systems

This paper focuses on the design process for reconfigurable architecture. Our contribution focuses on introducing a new temporal partitioning algorithm. Our algorithm is based on typical mathematic flow to solve the temporal partitioning problem. This algorithm optimizes the transfer of data required between design partitions and the reconfiguration overhead. Results show that our algorithm considerably decreases the communication cost and the latency compared with other well known algorithms.

Optimization of communication topology for persistent formation in case of communication faults

To address the optimization problem of communication topology for persistent formation in the case of communication faults such as link interruption,transmitter failure,and receiver failure a two-stage model including fast reconstruction of communication topology and re-optimization of communication topology is constructed.Then,a fast reconstruction algorithm of communication topology for persistent formation(FRA-CT-PF),based on optimally rigid graph,arc addition operation,and path reversal operation,is proposed,which can quickly generate a feasible reconstructed communication topology after communication faults,thus ensuring the safety of the agents and maintaining the formation shape of persistent formation.Furthermore,a re-optimization algorithm of communication topology for persistent formation(ROA-CTPF),based on agent position exchange,is proposed,which can further obtain a reoptimized communication topology to minimize the formation communication cost while still maintaining the formation shape of persistent formation.The time complexities of these two algorithms are also analyzed.Finally,the effectiveness of the above algorithms is verified by numerical experiments.Compared with existing algorithms,FRA-CT-PF can always obtain feasible reconstructed communication topology in much less time under all communication fault scenarios,and ROA-CT-PF can obtain a reoptimized communication topology to further reduce the formation communication cost in a shorter time.

Remote preparation of an entangled two-qubit state with three parties

We present a scheme for probabilistic remote preparation of an entangled two-qubit state with three parties from a sender to either of two receivers. The quantum channel is composed of a paxtially entangled two-qubit state and a partially entangled three-qubit state. We calculate the successful total probabilities of the scheme in general and particular cases, respectively. We also calculate total classical communication cost in a general case and two particular cases, respectively.

Energy-balanced on demand clustering improved leach protocol for wireless sensor networks

In wireless sensor networks（WSNs）,appropriate topology control（TC）could efficiently balance the load among sensor nodes and extend network lifespan.Clustering is an effective topology control technique that could reduce energy consumption and provide scalability to WSNs.However,some clustering algorithms,including the traditional low energy adaptive clustering hierarchy（LEACH）,don＇t consider the residual energy and the communication distance.The energy consumption could dramatically increase in the case of long communication distance and high rate of control message exchange.In this paper we propose an energy-balanced clustering algorithm which considers the communication distance and the residual energy.Moreover the cluster head（CH）reselection is relevant to the current CH residual energy in order to reduce overheads.The simulation results demonstrate that the proposed algorithm prolongs the lifetime of the WSN in comparison to the LEACH and a hybrid clustering approach（HCA）.

Remote Preparation of Three-Particle GHZ Class States

We propose a remote state preparation （RSP） scheme of three-particle Greenberger Horne-Zeilinger （GHZ） class states, where quantum channels are composed of two maximally entangled states. With the aid of forward classical bits, the preparation of the original state can be successfully realized with the probability 1/2, the necessary classical communication cost is 0.5 bit on average. If the state to be prepared belongs to some special states, the success probability of preparation can achieve 1 after consuming one extra bit on average. We then generalize this scheme to the case that the quantum channels consist of two non-maximally entangled states.

Teleportation of Three-Level Multi-partite Entangled State by a Partial Three-Level Bipartite Entangled State

We present a scheme for probabilistically teleporting an unknown three-level bipartite entangled state by using a partial entangled three-level bipartite state as quantum channel This scheme can be directly generalized to probabilistically teleport an unknown three-level k-particle entangled state by a partial three-level bipartite entangled state. A11 kinds of unitary transformations are given in detail We calculate the successful total probability and the total classical communication cost required for this scheme.

Controlled Probabilistic Teleportation of an Unknown Multi-Particle High-Dimensional Entangled State

We propose a protocol for controlled probabilistic teleportation of an unknown tripartite qutrit entangled state with two partial tripartite qutrit entangled states as the quantum channel. It is found that teleportation associated with the generalized qutrit Bell-basis measurement, the generalized qutrit π-state measurement and the generalized Hadamard operator in three-dimensional Hilbert space. We generalize the protocol for controlled probabilistic teleportation of an unknown k-particle qudit entangled state with a multi-particle qudit entangled state and a tripartite qudit entangled state as the quantum channel. We also calculate the classical communication cost required in both cases.

Probabilistic Remote Preparation of a Tripartite High-Dimensional Equatorial Entangled State

We present a scheme for probabilistic remote preparation of a tripartite qutrit entangled state with a partial tripartite qutrit entangled state and a partial bipartite qutrit entangled state as the quantum channel. It is found that a bipartite qutrit orthogonal projective measurement, an auxiliary qutrit particle, and the corresponding unitary transformation are required. A scheme for probabilistic remote preparation of a tripartite qudit equatorial entangled state by using a partial tripartite qudit entangled state and a partial bipartite qudit entangled state as the quantum channel is also proposed. We calculate the successful total probability and the total classical communication cost required in the RSP process, respectively.

Remote Preparation of Multipartite Equatorial Entangled States in High Dimensions with Three Parties

A scheme for probabilistic remotely preparing N-particle d-dimensional equatorial entangled states via entangled swapping with three parties is presented. The quantum channel is composed of N - 1 pairs of bipartite d-dimensional non-maximally entangled states and a tripartite d-dimension non-maximally entangled state. It is shown that the sender can help either of the two receivers to remotely prepare the original state, and the N-particle projective measurement and the generalized Hadamard transformation are needed in this scheme. The total success probability and classical communication cost are calculated.

RPK-table based efficient algorithm for join-aggregate query on MapReduce

Join-aggregate is an important and widely used operation in database system. However, it is time-consuming to process join-aggregate query in big data environment, especially on MapReduce framework. The main bottlenecks contain two aspects： lots of I/O caused by temporary data and heavy communication overhead between different data nodes during query processing. To overcome such disadvantages, we design a data structure called Reference Primary Key table （RPK-table） which stores the relationship of primary key and foreign key between tables. Based on this structure, we propose an improved algorithm on MapReduce framework for join-aggregate query. Experi-ments on TPC-H dataset demonstrate that our algorithm outperforms existing methods in terms of communication cost and query response time.

High-Speed EMU TCMS Design and LCC Technology Research

This paper introduces the high-speed electrical multiple unit （EMO） life cycle, including the design, manufacturing, testing, and maintenance stages. It also presents the train control and monitoring system （TCMS） software development platform, the TCMS testing and verification bench, the EMU driving simulation platform, and the EMU remote data transmittal and maintenance platform. All these platforms and benches combined together make up the EMU life cycle cost （LCC） system. Each platform facilitates EMU LCC management and is an important part of the system.

Efficient Scheduling Mapping Algorithm for Row Parallel Coarse-Grained Reconfigurable Architecture

Row Parallel Coarse-Grained Reconfigurable Architecture(RPCGRA)has the advantages of maximum parallelism and programmable flexibility.Designing an efficient algorithm to map the diverse applications onto RPCGRA is difficult due to a number of RPCGRA hardware constraints.To solve this problem,the nodes of the data flow graph must be partitioned and scheduled onto the RPCGRA.In this paper,we present a Depth-First Greedy Mapping(DFGM)algorithm that simultaneously considers the communication costs and the use times of the Reconfigurable Cell Array(RCA).Compared with level breadth mapping,the performance of DFGM is better.The percentage of maximum improvement in the use times of RCA is 33%and the percentage of maximum improvement in non-original input and output times is 64.4%(Given Discrete Cosine Transfor 8(DCT8),and the area of reconfigurable processing unit is 56).Compared with level-based depth mapping,DFGM also obtains the lowest averages of use times of RCA,non-original input and output times,and the reconfigurable time.

Probabilistically Controlled Teleportation of an Arbitrary Two-Qubit State via Positive Operator-Valued Measure

We propose a tripartite scheme for probabilistically teleporting an arbitrary two-qubit state with a fourqubit cluster-class state and a Bell-class state as the quantum channels. In the scheme, the sender and the controller make Bell-state measurements (BSMs) on their respective qubit pairs. With their measurement results, the receiver can reconstruct the original state probabilistically by introducing two auxiliary particles and making appropriate unitary operations and positive operator-valued measure (POVM) instead of usual projective measurement. Moreover, the total success probability and classical communication cost of the present protocol are also worked out.

Probabilistic Teleportation of an Arbitrary Two-Qubit State via Positive Operator-Valued Measurement with Multi Parties

We propose a novel scheme to probabilistically transmit an arbitrary unknown two-qubit quantum state via Positive Operator-Valued Measurement with the help of two partially entangled states. In this scheme, the teleportation with two senders and two receives can be realized when the information of non-maximally entangled states is only available for the senders. Furthermore, the concrete implementation processes of this proposal are presented, meanwhile the classical communication cost and the successful probability of our scheme are calculated.

Probabilistic Remote Preparation of a Four-Particle Entangled W State for the General Case and for All Kinds of the Special Cases

We present a protocol for probabilistic remote preparation of a four-particle entangled W state. The quantum channel is composed of two partial entangled four-particle cluster states. We caiculate the total successful probability and total classical communication cost required for the general case and for all kinds of the special cases, respectively. It is shown that for two maximally entangled four-particle cluster states, such a scheme for the general case has the total successful probability of 25% and only consumes the total classical communication of I bit, while this scheme for the special cases under certain conditions can possess successful probability of 50% or 100%, the required classical communication will only be 2 bits or 4 bits. Meantime, we give in detail all unitary transformations for the general case and for all kinds of the special cases, respectively.

A Combinatorial Auction-Based Collaborative Cloud Services Platform

In this paper, we present a novel, dynamic collaboration cloud platform in which a Combinatorial Auction（CA）-based market model enables the platform to run effectively. The platform can facilitate expense reduction and improve the scalability of the cloud, which is divided into three layers： The user-layer receives requests from end-users, the auction-layer matches the requests with the cloud services provided by the Cloud Service Provider（CSP）, and the CSP-layer forms a coalition to improve serving ability to satisfy complex requirements of users.In fact, the aim of the coalition formation is to find suitable partners for a particular CSP. However, identifying a suitable combination of partners to form the coalition is an NP-hard problem. Hence, we propose approximation algorithms for the coalition formation. The Breadth Traversal Algorithm（BTA） and Revised Ant Colony Algorithm（RACA） are proposed to form a coalition when bidding for a single cloud service in the auction. The experimental results show that RACA outperforms the BTA in bid price. Other experiments were conducted to evaluate the impact of the communication cost on coalition formation and to assess the impact of iteration times for the optimal bidding price. In addition, the performance of the market model was compared to the existing CA-based model in terms of economic efficiency.