Optimal Controlled Teleportation

We give the analytic expressions of maximal probabilities of successfully controlled teleportating an unknown qubit via every kind of tripartite states. Besides, another kind of localizable entanglement is also determined. Furthermore, we give the sufficient and necessary condition that a three-qubit state can be collapsed to an EPR pair by a measurement on one qubit, and characterize the three-qubit states that can be used as quantum channel for controlled teleporting a qubit of unknown information with unit probability and with unit fidelity.Comment: 4 page

Probabilistic teleportation of unknown two-particle state via POVM

We propose a scheme for probabilistic teleportation of unknown two-particle state with partly entangled four-particle state via POVM. In this scheme the teleportation of unknown two-particle state can be realized with certain probability by performing two Bell state measurements, a proper POVM and a unitary transformation.Comment: 5 pages, no figur

A Simultaneous Quantum Secure Direct Communication Scheme between the Central Party and Other M Parties

We propose a simultaneous quantum secure direct communication scheme between one party and other three parties via four-particle GHZ states and swapping quantum entanglement. In the scheme, three spatially separated senders, Alice, Bob and Charlie, transmit their secret messages to a remote receiver Diana by performing a series local operations on their respective particles according to the quadripartite stipulation. From Alice, Bob, Charlie and Diana's Bell measurement results, Diana can infer the secret messages. If a perfect quantum channel is used, the secret messages are faithfully transmitted from Alice, Bob and Charlie to Diana via initially shared pairs of four-particle GHZ states without revealing any information to a potential eavesdropper. As there is no transmission of the qubits carrying the secret message in the public channel, it is completely secure for the direct secret communication. This scheme can be considered as a network of communication parties where each party wants to communicate secretly with a central party or server.Comment: 4 pages, no figur

Controlled quantum teleportation and secure direct communication

We present a controlled quantum teleportation protocol. In the protocol, quantum information of an unknown state of a 2-level particle is faithfully transmitted from a sender (Alice) to a remote receiver (Bob) via an initially shared triplet of entangled particles under the control of the supervisor Charlie. The distributed entangled particles shared by Alice, Bob and Charlie function as a quantum information channel for faithful transmission. We also propose a controlled and secure direct communication scheme by means of this teleportation. After insuring the security of the quantum channel, Alice encodes the secret message directly on a sequence of particle states and transmits them to Bob supervised by Charlie using this controlled quantum teleportation. Bob can read out the encoded message directly by the measurement on his qubit. In this scheme, the controlled quantum teleportation transmits Alice's message without revealing any information to a potential eavesdropper. Because there is not a transmission of the qubit carrying the secret message between Alice and Bob in the public channel, it is completely secure for controlled and direct secret communication if perfect quantum channel is used. The feature of this scheme is that the communication between two sides depends on the agreement of the third side.Comment: 4 page

Improving the security of secure direct communication based on secret transmitting order of particles

We analyzed the security of the secure direct communication protocol based on secret transmitting order of particles recently proposed by Zhu, Xia, Fan, and Zhang [Phys. Rev. A 73, 022338 (2006)], and found that this scheme is insecure if an eavesdropper, say Eve, wants to steal the secret message with Trojan horse attack strategies. The vital loophole in this scheme is that the two authorized users check the security of their quantum channel only once. Eve can insert another spy photon, an invisible photon or a delay one in each photon which the sender Alice sends to the receiver Bob, and capture the spy photon when it returns from Bob to Alice. After the authorized users check the security, Eve can obtain the secret message according to the information about the transmitting order published by Bob. Finally, we present a possible improvement of this protocol.Comment: 4 pages, no figur

Simulating California reservoir operation using the classification and regression-tree algorithm combined with a shuffled cross-validation scheme

The controlled outflows from a reservoir or dam are highly dependent on the decisions made by the reservoir operators, instead of a natural hydrological process. Difference exists between the natural upstream inflows to reservoirs and the controlled outflows from reservoirs that supply the downstream users. With the decision maker's awareness of changing climate, reservoir management requires adaptable means to incorporate more information into decision making, such as water delivery requirement, environmental constraints, dry/wet conditions, etc. In this paper, a robust reservoir outflow simulation model is presented, which incorporates one of the well-developed data-mining models (Classification and Regression Tree) to predict the complicated human-controlled reservoir outflows and extract the reservoir operation patterns. A shuffled cross-validation approach is further implemented to improve CART's predictive performance. An application study of nine major reservoirs in California is carried out. Results produced by the enhanced CART, original CART, and random forest are compared with observation. The statistical measurements show that the enhanced CART and random forest overperform the CART control run in general, and the enhanced CART algorithm gives a better predictive performance over random forest in simulating the peak flows. The results also show that the proposed model is able to consistently and reasonably predict the expert release decisions. Experiments indicate that the release operation in the Oroville Lake is significantly dominated by SWP allocation amount and reservoirs with low elevation are more sensitive to inflow amount than others

On the Triality Theory for a Quartic Polynomial Optimization Problem

This paper presents a detailed proof of the triality theorem for a class of fourth-order polynomial optimization problems. The method is based on linear algebra but it solves an open problem on the double-min duality left in 2003. Results show that the triality theory holds strongly in a tri-duality form if the primal problem and its canonical dual have the same dimension; otherwise, both the canonical min-max duality and the double-max duality still hold strongly, but the double-min duality holds weakly in a symmetrical form. Four numerical examples are presented to illustrate that this theory can be used to identify not only the global minimum, but also the largest local minimum and local maximum.Comment: 16 pages, 1 figure; J. Industrial and Management Optimization, 2011. arXiv admin note: substantial text overlap with arXiv:1104.297