Isaq Shikalgar | Mumbai University (original) (raw)
Uploads
Papers by Isaq Shikalgar
2015 International Conference on Electrical, Electronics, Signals, Communication and Optimization (EESCO), 2015
I consider the tradeoff between the information gained about an initially unknown quantum state, ... more I consider the tradeoff between the information gained about an initially unknown quantum state, and the disturbance caused to that state by the measurement process. I show that for any distribution of initial states, the information-disturbance frontier is convex, and disturbance is nondecreasing with information gain. I consider the most general model of quantum measurements, and all post-measurement dynamics compatible with a given measurement. For the uniform initial distribution over states, I show that an optimal information-disturbance combination may always be achieved by a measurement procedure which satisfies a generalization of the projection postulate, the "square-root dynamics." I use this to show that the information-disturbance frontier for the uniform ensemble may be achieved with "isotropic" (unitarily covariant) dynamics. This results in a significant simplification of the optimization problem for calculating the tradeoff in this case, giving hope for a closed-form solution. I also show that the discrete ensembles uniform on the d(d + 1) vectors of a certain set of d + 1 "mutually unbiased" or conjugate bases in d dimensions form spherical 2-designs in CP d−1 when d is a power of an odd prime. This implies that many of the results of the paper apply also to these discrete ensembles.
IEEE, 2015
The energy supply of nodes will be limited strictly in the wireless sensor networks (WSN). Many a... more The energy supply of nodes will be limited strictly in the wireless sensor networks (WSN). Many algorithms propose to increase the efficiency of Sensor Networks. Many Clustering protocols have been proposed to improve system throughput and system delay, and increase energy saving. Based on the LEACH (Low Energy Adaptive Clustering Hierarchy), this paper uses a deterministic approach. It takes into consideration of many factors such as current energy of sensor node, percentage of nodes that not have been selected as Cluster Heads (CHs) in each round due to location reason. The proposed protocol is simulated and the results show a significant reduction in network energy consumption compared to LEACH and other algorithms.
2015 International Conference on Electrical, Electronics, Signals, Communication and Optimization (EESCO), 2015
I consider the tradeoff between the information gained about an initially unknown quantum state, ... more I consider the tradeoff between the information gained about an initially unknown quantum state, and the disturbance caused to that state by the measurement process. I show that for any distribution of initial states, the information-disturbance frontier is convex, and disturbance is nondecreasing with information gain. I consider the most general model of quantum measurements, and all post-measurement dynamics compatible with a given measurement. For the uniform initial distribution over states, I show that an optimal information-disturbance combination may always be achieved by a measurement procedure which satisfies a generalization of the projection postulate, the "square-root dynamics." I use this to show that the information-disturbance frontier for the uniform ensemble may be achieved with "isotropic" (unitarily covariant) dynamics. This results in a significant simplification of the optimization problem for calculating the tradeoff in this case, giving hope for a closed-form solution. I also show that the discrete ensembles uniform on the d(d + 1) vectors of a certain set of d + 1 "mutually unbiased" or conjugate bases in d dimensions form spherical 2-designs in CP d−1 when d is a power of an odd prime. This implies that many of the results of the paper apply also to these discrete ensembles.
IEEE, 2015
The energy supply of nodes will be limited strictly in the wireless sensor networks (WSN). Many a... more The energy supply of nodes will be limited strictly in the wireless sensor networks (WSN). Many algorithms propose to increase the efficiency of Sensor Networks. Many Clustering protocols have been proposed to improve system throughput and system delay, and increase energy saving. Based on the LEACH (Low Energy Adaptive Clustering Hierarchy), this paper uses a deterministic approach. It takes into consideration of many factors such as current energy of sensor node, percentage of nodes that not have been selected as Cluster Heads (CHs) in each round due to location reason. The proposed protocol is simulated and the results show a significant reduction in network energy consumption compared to LEACH and other algorithms.