We establish the entangling power of a unitary operator on a general finite-dimensional bipartite quantum system with and without ancillas, and give relations between the entangling power based on the von Neumann entropy and the entangling power based on the linear entropy. Significantly, we demonstrate that the entangling power of a general controlled unitary operator acting on two equal-dimen...

The main idea of this paper is to introduce Tradeable Measures of Risk as an objective and model independent way of measuring risk. The present methods of risk measurement, such as the standard Value-at-Risk supported by Basel II, are based on subjective assumptions of future returns. In order to achieve an objective measurement of risk, we introduce a concept of Realized Risk which we define a...

As processor speeds plateau, chip manufacturers are turning to multi-processor and multi-core designs to increase performance. As the number of simultaneous threads grows, Amdahl’s Law [6] means the performance of programs becomes limited by the cost that does not scale: communication, via the memory subsystem. Algorithm design is critical in minimizing these costs. In this dissertation, I firs...

computer algorithms require an 'oracle' as an integral part. An oracle is a reversible quantum Boolean circuit, where the inputs are kept unchanged at the outputs and the functional outputs are realized along ancillary input constants (0 or 1). Recently, a nearest neighbour template based synthesis method of quantum Boolean circuits has been proposed to overcome the adjacency requirement of the...

Verification of concurrent algorithms has been the focus of much research over a considerable period of time, and a variety of techniques have been developed that are suited to particular classes of algorithm, for example algorithms based on message passing or mutual exclusion. The development of nonblocking or lock-free algorithms, which rely only on hardware primitives such as Compare And Swa...

Inspired by the proliferation of cloud-based services, this paper studies consensus, one of the most fundamental distributed computing problems, in a hybrid model of computation. In this model, processes (or nodes) exchange information by passing messages or by accessing a reliable and highly-available register hosted in the cloud. The paper presents a formal definition of the model and problem...

Softening and dropping point determination are established analytical tests that provide quality control for petrochemical products such as bitumen (asphalt). However, to be accurate, manual/semi-automated quality tests prescribed in ASTM standards must be performed in a standardized fashion. Unfortunately, manual processing bears inherent process risks that affect repeatability, which in turn ...

Side-channel attacks are an important class of attacks against cryptographic devices and profiled side-channel attacks are the most powerful type of side-channel attacks. In this scenario, an adversary first uses a device under his control in order to build a good leakage model. Then, he takes advantage of this leakage model to exploit the actual leakages of a similar target device and perform ...

Centrality measures have been defined to quantify the importance of a node in complex networks. The relative importance of a node can be measured using its centrality rank based on the centrality value. In the present work, we predict the degree centrality rank of a node without having the entire network. The proposed method uses degree of the node and some network parameters to predict its ran...

Compare-by-hash is the now-common practice used by systems designers who assume that when the digest of a cryptographic hash function is equal on two distinct files, then those files are identical. This approach has been used in both real projects and in research efforts (for example rysnc [16] and LBFS [12]). A recent paper by Henson criticized this practice [8]. The present paper revisits the...