Determining the Dependence Structure of Multivariate Extremes

In multivariate extreme value analysis, the nature of the extremal dependence between variables should be considered when selecting appropriate statistical models. Interest often lies with determining which subsets of variables can take their largest values simultaneously, while the others are of smaller order. Our approach to this problem exploits hidden regular variation properties on a collection of non-standard cones and provides a new set of indices that reveal aspects of the extremal dependence structure not available through existing measures of dependence. We derive theoretical properties of these indices, demonstrate their value through a series of examples, and develop methods of inference that also estimate the proportion of extremal mass associated with each cone. We apply the methods to UK river flows, estimating the probabilities of different subsets of sites being large simultaneously

Two-photon interference between disparate sources for quantum networking

Quantum networks involve entanglement sharing between multiple users. Ideally, any two users would be able to connect regardless of the type of photon source they employ, provided they fulfill the requirements for two-photon interference. From a theoretical perspective, photons coming from different origins can interfere with a perfect visibility, provided they are made indistinguishable in all degrees of freedom. Previous experimental demonstrations of such a scenario have been limited to photon wavelengths below 900 nm, unsuitable for long distance communication, and suffered from low interference visibility. We report two-photon interference using two disparate heralded single photon sources, which involve different nonlinear effects, operating in the telecom wavelength range. The measured visibility of the two-photon interference is 80+/-4%, which paves the way to hybrid universal quantum networks

Experimental Realization of a One-way Quantum Computer Algorithm Solving Simon's Problem

We report an experimental demonstration of a one-way implementation of a quantum algorithm solving Simon's Problem - a black box period-finding problem which has an exponential gap between the classical and quantum runtime. Using an all-optical setup and modifying the bases of single-qubit measurements on a five-qubit cluster state, key representative functions of the logical two-qubit version's black box can be queried and solved. To the best of our knowledge, this work represents the first experimental realization of the quantum algorithm solving Simon's Problem. The experimental results are in excellent agreement with the theoretical model, demonstrating the successful performance of the algorithm. With a view to scaling up to larger numbers of qubits, we analyze the resource requirements for an n-qubit version. This work helps highlight how one-way quantum computing provides a practical route to experimentally investigating the quantum-classical gap in the query complexity model.Comment: 9 pages, 5 figure

Experimental demonstration of a graph state quantum error-correction code

Scalable quantum computing and communication requires the protection of quantum information from the detrimental effects of decoherence and noise. Previous work tackling this problem has relied on the original circuit model for quantum computing. However, recently a family of entangled resources known as graph states has emerged as a versatile alternative for protecting quantum information. Depending on the graph's structure, errors can be detected and corrected in an efficient way using measurement-based techniques. In this article we report an experimental demonstration of error correction using a graph state code. We have used an all-optical setup to encode quantum information into photons representing a four-qubit graph state. We are able to reliably detect errors and correct against qubit loss. The graph we have realized is setup independent, thus it could be employed in other physical settings. Our results show that graph state codes are a promising approach for achieving scalable quantum information processing

An All Optical Fibre Quantum Controlled-NOT Gate

We report the first experimental demonstration of an optical controlled-NOT gate constructed entirely in fibre. We operate the gate using two heralded optical fibre single photon sources and find an average logical fidelity of 90% and an average process fidelity of 0.83<F<0.91. On the basis of a simple model we are able to conclude that imperfections are primarily due to the photon sources, meaning that the gate itself works with very high fidelity.Comment: 4 pages, 4 figures, comments welcom

Experimental characterization of universal one-way quantum computing

We report the characterization of a universal set of logic gates for one-way quantum computing using a four-photon 'star' cluster state generated by fusing photons from two independent photonic crystal fibre sources. We obtain a fidelity for the cluster state of 0.66 ± 0.01 with respect to the ideal case. We perform quantum process tomography to completely characterize a controlled-NOT, Hadamard and T gate all on the same compact entangled resource. Together, these operations make up a universal set of gates such that arbitrary quantum logic can be efficiently constructed from combinations of them. We find process fidelities with respect to the ideal cases of 0.64 ± 0.01 for the CNOT, 0.67 ± 0.03 for the Hadamard and 0.76 ± 0.04 for the T gate. The characterization of these gates enables the simulation of larger protocols and algorithms. As a basic example, we simulate a Swap gate consisting of three concatenated CNOT gates. Our work provides some pragmatic insights into the prospects for building up to a fully scalable and fault-tolerant one-way quantum computer with photons in realistic conditions

Very high rotational frequencies and band termination in 73Br

Rotational bands in 73Br have been investigated up to spins of 65/2 using the EUROBALL III spectrometer. One of the negative-parity bands displays the highest rotational frequency 1.85 MeV reported to date in nuclei with mass number greater than 25. At high frequencies, the experimental dynamic moment of inertia for all bands decrease to very low values, indicating a loss of collectivity. The bands are described in the configuration-dependent cranked Nilsson-Strutinsky model. The calculations indicate that one of the negative-parity bands is observed up to its terminating single-particle state at spin 63/2. This result establishes the first band termination case in the A = 70 mass region.Comment: 6 pages, 6 figures, submitted to Phys. Rev. C as a Rapid Communicatio

Maximal Sharing in the Lambda Calculus with letrec

Increasing sharing in programs is desirable to compactify the code, and to avoid duplication of reduction work at run-time, thereby speeding up execution. We show how a maximal degree of sharing can be obtained for programs expressed as terms in the lambda calculus with letrec. We introduce a notion of `maximal compactness' for lambda-letrec-terms among all terms with the same infinite unfolding. Instead of defined purely syntactically, this notion is based on a graph semantics. lambda-letrec-terms are interpreted as first-order term graphs so that unfolding equivalence between terms is preserved and reflected through bisimilarity of the term graph interpretations. Compactness of the term graphs can then be compared via functional bisimulation. We describe practical and efficient methods for the following two problems: transforming a lambda-letrec-term into a maximally compact form; and deciding whether two lambda-letrec-terms are unfolding-equivalent. The transformation of a lambda-letrec-term $L$ into maximally compact form $L_0$ proceeds in three steps: (i) translate L into its term graph $G = [[ L ]]$; (ii) compute the maximally shared form of $G$ as its bisimulation collapse $G_0$; (iii) read back a lambda-letrec-term $L_0$ from the term graph $G_0$ with the property $[[ L_0 ]] = G_0$. This guarantees that $L_0$ and $L$ have the same unfolding, and that $L_0$ exhibits maximal sharing. The procedure for deciding whether two given lambda-letrec-terms $L_1$ and $L_2$ are unfolding-equivalent computes their term graph interpretations $[[ L_1 ]]$ and $[[ L_2 ]]$, and checks whether these term graphs are bisimilar. For illustration, we also provide a readily usable implementation.Comment: 18 pages, plus 19 pages appendi

Disruption of host-seeking behaviour by the salmon louse,Lepeophtheirus salmonis,using botanically derived repellents

The potential for developing botanically derived natural products as novel feed-through repellents for disrupting settlement of the salmon louse, Lepeophtheirus salmonis (Caligidae) upon farmed Atlantic salmon, Salmo salar, was investigated using an established laboratory vertical Y-tube behavioural bioassay for assessing copepodid behaviour. Responses to artificial sea water conditioned with the odour of salmon, or to the known salmon-derived kairomone component, α-isophorone, in admixture with selected botanical materials previously known to interfere with invertebrate arthropod host location were recorded. Materials included oils extracted from garlic, Allium sativum (Amaryllidaceae), rosemary, Rosmarinus officinalis (Lamiaceae), lavender, Lavandula angustifolia (Lamiaceae), and bog myrtle, Myrica gale (Myricaceae), and individual components (diallyl sulphide and diallyl disulphide from garlic; allyl, propyl, butyl, 4-pentenyl and 2-phenylethyl isothiocyanate from plants in the Brassica genus). Removal of attraction to salmon-conditioned water (SCW) or α-isophorone was observed when listed materials were presented at extremely low parts per trillion (ppt), that is picograms per litre or 10−12 level. Significant masking of attraction to SCW was observed at a level of 10 ppt for diallyl disulphide and diallyl sulphide, and allyl isothiocyanate and butyl isothiocyanate. The potential of very low concentrations of masking compounds to disrupt Le. salmonis copepodid settlement on a host fish has been demonstrated in vitro