No abstract

Abstract. Among various definitions of quantum correlations, quantum discord has attracted considerable attention. The connection between the quantum discord and the entanglement of formation is described by Koashi-Winter relation. We investigate this relation from the viewpoint of the quantum channel that is isomorphic to the given state. It is shown that in the case of two-qubit states the channel, on the one hand, determines the form of the quantum steering ellipsoid of the given state, and on the other hand, is closely related to the concurrence of the complement state of the given state. We also point out that, for two-qubit rank-two state, von Neumann measurement is the optimal choice to achieve the quantum discord. However, for some two-qubit states with the rank larger than two, the three-element POVM measurement is optimal.

No abstract

We propose an efficient teleportation scheme for an unknown state to either one of two receivers via GHZ-like states. We also discuss the fidelity of the quantum state when the control party is uncooperative.

No abstract

No abstract

To improve the accuracy of lane detection in complex scenarios, an adaptive lane feature learning algorithm which can automatically learn the features of a lane in various scenarios is proposed. First, a two-stage learning network based on the YOLO v3 (You Only Look Once, v3) is constructed. The structural parameters of the YOLO v3 algorithm are modified to make it more suitable for lane detection. To improve the training efficiency, a method for automatic generation of the lane label images in a simple scenario, which provides label data for the training of the first-stage network, is proposed. Then, an adaptive edge detection algorithm based on the Canny operator is used to relocate the lane detected by the first-stage model. Furthermore, the unrecognized lanes are shielded to avoid interference in subsequent model training. Then, the images processed by the above method are used as label data for the training of the second-stage model. The experiment was carried out on the KITTI and Caltech datasets, and the results showed that the accuracy and speed of the second-stage model reached a high level.

Abstract-Truthful spectrum auctions have been extensively studied in recent years. Truthfulness makes bidders bid their true valuations, simplifying greatly the analysis of auctions. However, revealing one's true valuation causes severe privacy disclosure to the auctioneer and other bidders. To make things worse, previous work on secure spectrum auctions does not provide adequate security. In this paper, based on TRUST, we propose PS-TRUST, a provably secure solution for truthful double spectrum auctions. Besides maintaining the properties of truthfulness and special spectrum reuse of TRUST, PS-TRUST achieves provable security against semi-honest adversaries in the sense of cryptography. Specifically, PS-TRUST reveals nothing about the bids to anyone in the auction, except the auction result. To the best of our knowledge, PS-TRUST is the first provably secure solution for spectrum auctions. Furthermore, experimental results show that the computation and communication overhead of PS-TRUST is modest, and its practical applications are feasible.