A family of sure-success quantum algorithms for solving a generalized Grover search problem

This work considers a generalization of Grover's search problem, viz., to find any one element in a set of acceptable choices which constitute a fraction f of the total number of choices in an unsorted data base. An infinite family of sure-success quantum algorithms are introduced here to solve this problem, each member for a different range of f. The nth member of this family involves n queries of the data base, and so the lowest few members of this family should be very convenient algorithms within their ranges of validity. The even member {A}_{2n} of the family covers ever larger range of f for larger n, which is expected to become the full range 0 infinity.Comment: 8 pages, including 4 figures in 4 page

Finding Optimal Flows Efficiently

Among the models of quantum computation, the One-way Quantum Computer is one of the most promising proposals of physical realization, and opens new perspectives for parallelization by taking advantage of quantum entanglement. Since a one-way quantum computation is based on quantum measurement, which is a fundamentally nondeterministic evolution, a sufficient condition of global determinism has been introduced as the existence of a causal flow in a graph that underlies the computation. A O(n^3)-algorithm has been introduced for finding such a causal flow when the numbers of output and input vertices in the graph are equal, otherwise no polynomial time algorithm was known for deciding whether a graph has a causal flow or not. Our main contribution is to introduce a O(n^2)-algorithm for finding a causal flow, if any, whatever the numbers of input and output vertices are. This answers the open question stated by Danos and Kashefi and by de Beaudrap. Moreover, we prove that our algorithm produces an optimal flow (flow of minimal depth.) Whereas the existence of a causal flow is a sufficient condition for determinism, it is not a necessary condition. A weaker version of the causal flow, called gflow (generalized flow) has been introduced and has been proved to be a necessary and sufficient condition for a family of deterministic computations. Moreover the depth of the quantum computation is upper bounded by the depth of the gflow. However, the existence of a polynomial time algorithm that finds a gflow has been stated as an open question. In this paper we answer this positively with a polynomial time algorithm that outputs an optimal gflow of a given graph and thus finds an optimal correction strategy to the nondeterministic evolution due to measurements.Comment: 10 pages, 3 figure

Coloured Petri Nets - a Pragmatic Formal Method for Designing and Analysing Distributed Systems

The thesis consists of six individual papers, where the present paper contains the mandatory overview, while the remaining five papers are found separately from the overview. The five papers can roughly be divided into three areas of research, namely case studies, education, and extensions to the CPN method.The primary purpose of the PhD thesis is to study the pragmatics, practical aspects, and intuition of CP-nets viewed as a formal method for describing and reasoning about concurrent systems. The perspective of pragmatics is our leitmotif, but at the same time in the context of CP-nets it is a kind of hypothesis of this thesis. This overview paper summarises the research conducted as an investigation of the hypothesis in the three areas of case studies, education, and extensions.The provoking claim of pragmatics should not be underestimated. In the present overview of the thesis, the CPN method is compared with a representative selection of formal methods. The graphics and simplicity of semantics, yet generality and expressiveness of the language constructs, essentially makes CP-nets a viable and attractive alternative to other formal methods. Similar graphical formal methods, such as SDL and Statecharts, typically have significantly more complicated semantics, or are domain-specific languages.research conducted in this thesis, opens a new complex of problems. Firstly, to get wider acceptance of CP-nets in industry, it is important to identify fruitful areas for the effective introduction of the CPN method. Secondly, it would be useful to identify a few extensions to the CPN method inspired by specific domains for easier adaption in industry. Thirdly, which analysis methods do future systems make use of

Characterisation and quantification of regional diurnal SST cycles from SEVIRI

Hourly SST (sea surface temperature) fields from the geostationary Spinning Enhanced Visible and Infrared Imager (SEVIRI) offer a unique opportunity for the characterisation and quantification of the diurnal cycle of SST in the Atlantic Ocean, the Mediterranean Sea and the northern European shelf seas. Six years of SST fields from SEVIRI are validated against the Advanced Along-Track Scanning Radiometer (AATSR) Reprocessed for Climate (ARC) data set. The overall SEVIRI–AATSR bias is −0.07 K, and the standard deviation is 0.51 K, based on more than 53 × 106 match-ups. Identification of the diurnal signal requires an SST foundation temperature field representative of well-mixed conditions which typically occur at night-time or under moderate and strong winds. Such fields are generated from the SEVIRI archive and are validated against pre-dawn SEVIRI SSTs and night-time SSTs from drifting buoys. The different methodologies tested for the foundation temperature fields reveal variability introduced by averaging night-time SSTs over many days compared to single-day, pre-dawn values. Diurnal warming is most pronounced in the Mediterranean and Baltic seas while weaker diurnal signals are found in the tropics. Longer diurnal warming duration is identified in the high latitudes compared to the tropics. The maximum monthly mean diurnal signal can be up to 0.5 K in specific regions

The battle of hearts and minds : an analysis of the Iraq War discourse in politics and newspapers

The most controversial and divisive political issue in Britain in the last decade was the decision to go to war in Iraq. The legitimisation and justification for making this decision was argued through a carefully considered discourse constructed by Prime Minister Tony Blair and his associates. A key role in mediating and manifesting the discourse of Blair was played out by the media. If Blair was to succeed in a legitimisation of war he was in need of an acceptance of the important implications of his discourse. Accordingly, this thesis not only explores the discourse of Blair, but also its relation and acceptance in the discourse of British newspapers. The theoretical approach is two-fold, taking both the perspective of Critical Discourse Analysis (CDA) and metaphor theory. Although theoretically different, both frameworks share a similar aim, namely to uncover the ideological implications of language and discourse. The analysis suggests that Blair’s careful construction of an Iraq discourse was central in framing the newspaper debate before the start of the war. Thus, newspapers largely accepted the important themes in the government discourse. While the events of the war did have implications on how the Iraq discourse was continued, the analyses of the discourse of both government rhetoric and the newspapers a year after the war started, show that many of the familiar characteristics of the discourse of Iraq were maintained

Quantum Searching via Entanglement and Partial Diffusion

In this paper, we will define a quantum operator that performs the inversion about the mean only on a subspace of the system (Partial Diffusion Operator). This operator is used in a quantum search algorithm that runs in O(sqrt{N/M}) for searching an unstructured list of size N with M matches such that 1<= M<=N. We will show that the performance of the algorithm is more reliable than known {fixed operators quantum search algorithms} especially for multiple matches where we can get a solution after a single iteration with probability over 90% if the number of matches is approximately more than one-third of the search space. We will show that the algorithm will be able to handle the case where the number of matches M is unknown in advance such that 1<=M<=N in O(sqrt{N/M}). A performance comparison with Grover's algorithm will be provided.Comment: 19 pages. Submitted to IJQI. Please forward comments/enquires for the first author to [email protected]