We investigated discrete-time quantum walks with an arbitary unitary coin.Here we discover that the average position x=max（x） sin（α＋γ）,while the initial state is 1/2～（1/2）（｜0L＋i｜0R）.We verify the result...We investigated discrete-time quantum walks with an arbitary unitary coin.Here we discover that the average position x=max（x） sin（α＋γ）,while the initial state is 1/2～（1/2）（｜0L＋i｜0R）.We verify the result,and obtain some symmetry properties of quantum walks with a U（2） coin with ｜0L and ｜0R as the initial state.展开更多
We study the average position and the symmetry of the distribution in the SU（2） open quantum random walk （OQRW）. We show that the average position in the central limit theorem （CLT） is non-uniform compared with ...We study the average position and the symmetry of the distribution in the SU（2） open quantum random walk （OQRW）. We show that the average position in the central limit theorem （CLT） is non-uniform compared with the average position in the non-CLT. The symmetry of distribution is shown to be even in the CLT.展开更多
Node Localization is one of the key technology in the field of wireless sensor network(WSN)that has become a challenging research topic under the lack of distance measurement.In order to solve this problem,a localizat...Node Localization is one of the key technology in the field of wireless sensor network(WSN)that has become a challenging research topic under the lack of distance measurement.In order to solve this problem,a localization algorithm based on concentric circle distance calculation(LACCDC)is proposed.The LA-CCDC takes the beacon as the center of the concentric circle,then divides the task area into concentric circles with the k communication radius of sensor,which forms concentric rings.The node located in the k hops ring intersects the concentric circle with(k−1)r radius that forms an intersection area.This area is used to calculate the distance from the beacon to the unknown node,hyperbola is then adopted to locate the unknown node.In the application scenario with node random distribution,the simulation results show that the LA-CCDC algorithm gets the node location with low error under different node number,different beacons and different communication radius of sensor.展开更多
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 10974192 and 61275122)the National Basic Research Program of China(Grant Nos. 2011CB921200 and 2011CBA00200)K. C. Wong Education Foundation and the Chinese Academy of Sciences
文摘We investigated discrete-time quantum walks with an arbitary unitary coin.Here we discover that the average position x=max（x） sin（α＋γ）,while the initial state is 1/2～（1/2）（｜0L＋i｜0R）.We verify the result,and obtain some symmetry properties of quantum walks with a U（2） coin with ｜0L and ｜0R as the initial state.
文摘We study the average position and the symmetry of the distribution in the SU（2） open quantum random walk （OQRW）. We show that the average position in the central limit theorem （CLT） is non-uniform compared with the average position in the non-CLT. The symmetry of distribution is shown to be even in the CLT.
基金the Yunnan Local Colleges Applied Basic Research Projects(2017FH001-059,2018FH001-010,2018FH001-061)National Natural Science Foundation of China(61962033).
文摘Node Localization is one of the key technology in the field of wireless sensor network(WSN)that has become a challenging research topic under the lack of distance measurement.In order to solve this problem,a localization algorithm based on concentric circle distance calculation(LACCDC)is proposed.The LA-CCDC takes the beacon as the center of the concentric circle,then divides the task area into concentric circles with the k communication radius of sensor,which forms concentric rings.The node located in the k hops ring intersects the concentric circle with(k−1)r radius that forms an intersection area.This area is used to calculate the distance from the beacon to the unknown node,hyperbola is then adopted to locate the unknown node.In the application scenario with node random distribution,the simulation results show that the LA-CCDC algorithm gets the node location with low error under different node number,different beacons and different communication radius of sensor.
