Arctic surface temperatures from Metop AVHRR compared to in situ ocean and land data

The ice surface temperature (IST) is an important boundary condition for both atmospheric and ocean and sea ice models and for coupled systems. An operational ice surface temperature product using satellite Metop AVHRR infra-red data was developed for MyOcean. The IST can be mapped in clear sky regions using a split window algorithm specially tuned for sea ice. Clear sky conditions prevail during spring in the Arctic, while persistent cloud cover limits data coverage during summer. The cloud covered regions are detected using the EUMETSAT cloud mask. The Metop IST compares to 2 m temperature at the Greenland ice cap Summit within STD error of 3.14 °C and to Arctic drifting buoy temperature data within STD error of 3.69 °C. A case study reveals that the in situ radiometer data versus satellite IST STD error can be much lower (0.73 °C) and that the different in situ measurements complicate the validation. Differences and variability between Metop IST and in situ data are analysed and discussed. An inter-comparison of Metop IST, numerical weather prediction temperatures and in situ observation indicates large biases between the different quantities. Because of the scarcity of conventional surface temperature or surface air temperature data in the Arctic, the satellite IST data with its relatively good coverage can potentially add valuable information to model analysis for the Arctic atmosphere

Implementation of quantum search algorithm using classical Fourier optics

We report on an experiment on Grover's quantum search algorithm showing that {\em classical waves} can search a $N$-item database as efficiently as quantum mechanics can. The transverse beam profile of a short laser pulse is processed iteratively as the pulse bounces back and forth between two mirrors. We directly observe the sought item being found in $\sim\sqrt{N}$ iterations, in the form of a growing intensity peak on this profile. Although the lack of quantum entanglement limits the {\em size} of our database, our results show that entanglement is neither necessary for the algorithm itself, nor for its efficiency.Comment: 4 pages, 3 figures; minor revisions plus extra referenc

Quantum Algorithms for the Most Frequently String Search, Intersection of Two String Sequences and Sorting of Strings Problems

We study algorithms for solving three problems on strings. The first one is the Most Frequently String Search Problem. The problem is the following. Assume that we have a sequence of $n$ strings of length $k$. The problem is finding the string that occurs in the sequence most often. We propose a quantum algorithm that has a query complexity $\tilde{O}(n \sqrt{k})$. This algorithm shows speed-up comparing with the deterministic algorithm that requires $\Omega(nk)$ queries. The second one is searching intersection of two sequences of strings. All strings have the same length $k$. The size of the first set is $n$ and the size of the second set is $m$. We propose a quantum algorithm that has a query complexity $\tilde{O}((n+m) \sqrt{k})$. This algorithm shows speed-up comparing with the deterministic algorithm that requires $\Omega((n+m)k)$ queries. The third problem is sorting of $n$ strings of length $k$. On the one hand, it is known that quantum algorithms cannot sort objects asymptotically faster than classical ones. On the other hand, we focus on sorting strings that are not arbitrary objects. We propose a quantum algorithm that has a query complexity $O(n (\log n)^2 \sqrt{k})$. This algorithm shows speed-up comparing with the deterministic algorithm (radix sort) that requires $\Omega((n+d)k)$ queries, where $d$ is a size of the alphabet.Comment: THe paper was presented on TPNC 201

On continuous variable quantum algorithms for oracle identification problems

We establish a framework for oracle identification problems in the continuous variable setting, where the stated problem necessarily is the same as in the discrete variable case, and continuous variables are manifested through a continuous representation in an infinite-dimensional Hilbert space. We apply this formalism to the Deutsch-Jozsa problem and show that, due to an uncertainty relation between the continuous representation and its Fourier-transform dual representation, the corresponding Deutsch-Jozsa algorithm is probabilistic hence forbids an exponential speed-up, contrary to a previous claim in the literature.Comment: RevTeX4, 15 pages with 10 figure

Computational depth complexity of measurement-based quantum computation

We prove that one-way quantum computations have the same computational power as quantum circuits with unbounded fan-out. It demonstrates that the one-way model is not only one of the most promising models of physical realisation, but also a very powerful model of quantum computation. It confirms and completes previous results which have pointed out, for some specific problems, a depth separation between the one-way model and the quantum circuit model. Since one-way model has the same computational power as unbounded quantum fan-out circuits, the quantum Fourier transform can be approximated in constant depth in the one-way model, and thus the factorisation can be done by a polytime probabilistic classical algorithm which has access to a constant-depth one-way quantum computer. The extra power of the one-way model, comparing with the quantum circuit model, comes from its classical-quantum hybrid nature. We show that this extra power is reduced to the capability to perform unbounded classical parity gates in constant depth.Comment: 12 page

Assessment of Gastrointestinal Autonomic Dysfunction:Present and Future Perspectives

The autonomic nervous system delicately regulates the function of several target organs, including the gastrointestinal tract. Thus, nerve lesions or other nerve pathologies may cause autonomic dysfunction (AD). Some of the most common causes of AD are diabetes mellitus and α-synucleinopathies such as Parkinson’s disease. Widespread dysmotility throughout the gastrointestinal tract is a common finding in AD, but no commercially available method exists for direct verification of enteric dysfunction. Thus, assessing segmental enteric physiological function is recommended to aid diagnostics and guide treatment. Several established assessment methods exist, but disadvantages such as lack of standardization, exposure to radiation, advanced data interpretation, or high cost, limit their utility. Emerging methods, including high-resolution colonic manometry, 3D-transit, advanced imaging methods, analysis of gut biopsies, and microbiota, may all assist in the evaluation of gastroenteropathy related to AD. This review provides an overview of established and emerging assessment methods of physiological function within the gut and assessment methods of autonomic neuropathy outside the gut, especially in regards to clinical performance, strengths, and limitations for each method

On the Relationship between Convex Bodies Related to Correlation Experiments with Dichotomic Observables

In this paper we explore further the connections between convex bodies related to quantum correlation experiments with dichotomic variables and related bodies studied in combinatorial optimization, especially cut polyhedra. Such a relationship was established in Avis, Imai, Ito and Sasaki (2005 J. Phys. A: Math. Gen. 38 10971-87) with respect to Bell inequalities. We show that several well known bodies related to cut polyhedra are equivalent to bodies such as those defined by Tsirelson (1993 Hadronic J. S. 8 329-45) to represent hidden deterministic behaviors, quantum behaviors, and no-signalling behaviors. Among other things, our results allow a unique representation of these bodies, give a necessary condition for vertices of the no-signalling polytope, and give a method for bounding the quantum violation of Bell inequalities by means of a body that contains the set of quantum behaviors. Optimization over this latter body may be performed efficiently by semidefinite programming. In the second part of the paper we apply these results to the study of classical correlation functions. We provide a complete list of tight inequalities for the two party case with (m,n) dichotomic observables when m=4,n=4 and when min{m,n}<=3, and give a new general family of correlation inequalities.Comment: 17 pages, 2 figure

Accumulated coercion and short-term outcome of inpatient psychiatric care

<p>Abstract</p> <p>Background</p> <p>The knowledge of the impact of coercion on psychiatric treatment outcome is limited. Multiple measures of coercion have been recommended. The aim of the study was to examine the impact of accumulated coercive incidents on short-term outcome of inpatient psychiatric care</p> <p>Methods</p> <p>233 involuntarily and voluntarily admitted patients were interviewed within five days of admission and at discharge or after maximum three weeks of care. Coercion was measured as number of coercive incidents, i.e. subjectively reported and in the medical files recorded coercive incidents, including legal status and perceived coercion at admission, and recorded and reported coercive measures during treatment. Outcome was measured both as subjective improvement of mental health and as improvement in professionally assessed functioning according to GAF. Logistic regression analyses were performed with patient characteristics and coercive incidents as independent and the two outcome measures as dependent variables</p> <p>Results</p> <p>Number of coercive incidents did not predict subjective or assessed improvement. Patients having other diagnoses than psychoses or mood disorders were less likely to be subjectively improved, while a low GAF at admission predicted an improvement in GAF scores</p> <p>Conclusion</p> <p>The results indicate that subjectively and professionally assessed mental health short-term outcome of acute psychiatric hospitalisation are not predicted by the amount of subjectively and recorded coercive incidents. Further studies are needed to examine the short- and long-term effects of coercive interventions in psychiatric care.</p