Summary Computing methodologies with rapid proliferation and need for greater concurrency have evolved over the years from parallel and distributed computing to latest technologies like cloud computing. A paradigm shift in computing methodologies has been witnessed in the form of exponential speed up, optimization of problem solutions, and solvability of few classically unsolvable problems with emergence of quantum computing. The study in this article presents observations on executing basic quantum operations that play a vital role in quantum computing. The results and analysis demonstrate how parameters of time, deviation, and shots have a significant effect on outcomes of quantum circuits executed which can be a reference point for the community in general engaged in designing of quantum circuits, protocols, algorithms, and quantum hardware to leverage quantum characteristics and properties. The study by means of experimental use cases provides a rigorous review of qubit behavior, standard, and entangled qubit measurement with practical results over a simulator and real quantum hardware for variable qubit configurations using a selected platform of IBM Q Experience. With the paradigm shift from classical to quantum computing, this article provides basic but very vital observations which can be brought to use by anyone intending to build quantum applications.

Research efforts in trust evaluation has evolved to provide security in Wireless Sensor Networks (WSNs), while being dependent on external parameters and network topology. Existing node level trust evaluation in WSNs evaluate trust over 1-hop assuring trustworthiness of an immediate node. This paper proposes trust evaluation using the intrinsic property of a node memory over a multihop scenario which also evaluates the route. The work proposes a multihop trust evaluation protocol using TEAM and TEAP algorithms. Two proposed trust evaluation models each are proposed using normative and empirical methods in multihop algorithms. The proposed methodology establishes a trusted destination node along with trusted nodes in the route. The efficacy of the proposed work and its implementation is demonstrated using extensive experiments and the results illustrate consistency and resilience against node memory tampering.

The following topics are dealt with: learning (artificial intelligence); cloud computing; Internet of Things; traffic engineering computing; wireless LAN; wireless sensor networks; optimisation; radio spectrum management; road traffic; image classification.

Traditional cryptographic methods do not cater to the limitations of wireless sensor networks (WSNs) primarily concerning code size, processing time, and power consumption. The study in this paper enumerates the security primitives in WSNs and accentuates the strength of trust evaluation as a security solution within the WSN precincts. This paper proposes a trust evaluation methodology that evaluates a node-level trust by using an internal resource of a node. It is a completely mediating technique which is independent of network topology and second-hand information. The challenge response method enables a node to evaluate trust for itself; and with its peer-node/s with which it intends to interact using the proposed self-scrutiny and self-attestation algorithms, respectively. The efficacy of the proposed software-based methodology and the algorithms is demonstrated with the actual implementation on sensor nodes. The ability to counter attack-scenarios along with the analysis exhibits the merit of the proposed work. The average values of the observed results illustrate the consistency and robust performance of the proposed trust evaluation algorithms.