2,648 research outputs found

    Experimental demonstration of a graph state quantum error-correction code

    Full text link
    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

    Longitudinal changes in dietary patterns during adult life

    Full text link
    Despite the growing interest in dietary patterns, there have been few longitudinal investigations. The objective of the present study was to extend an earlier method of dietary pattern assessment to longitudinal binary data and to assess changes in patterns over time and in relation to socio-demographic covariates. A prospective national cohort of 1265 participants completed a 5 d food diary at three time-points during their adult life (at age 36 years in 1982, 43 years in 1989 and 53 years in 1999). Factor analysis identified three dietary patterns for women (fruit, vegetables and dairy; ethnic foods and alcohol; meat, potatoes and sweet foods) and two patterns in men (ethnic foods and alcohol; mixed). Trends in dietary pattern scores were calculated using random effects models. Marked changes were found in scores for all patterns between 1989 and 1999, with only the meat, potatoes and sweet foods pattern in women recording a decline. In a multiple variable model that included the three time-points, socio-demographic variables and BMI time-dependent covariates, both non-manual social class and higher education level were also strongly associated with the consumption of more items from the ethnic foods and alcohol pattern and the mixed pattern for men (P&lt;0[middle dot]0001) and the fruit, vegetables and dairy pattern and the ethnic foods and alcohol pattern for women (P&lt;0[middle dot]01). In conclusion, longitudinal changes in dietary patterns and across socio-economic groups can assist with targeting public health initiatives by identifying stages during adult life when interventions to improve diet would be most beneficial to health.<br /

    The GREAT triggerless total data readout method

    Get PDF
    Recoil decay tagging (RDT) is a very powerful method for the spectroscopy of exotic nuclei. RDT is a delayed coincidence technique between detectors usually at the target position and at the focal plane of a spectrometer. Such measurements are often limited by dead time. This paper describes a novel triggerless data acquisition method, which is being developed for the Gamma Recoil Electron Alpha Tagging (GREAT) spectrometer, that overcomes this limitation by virtually eliminating dead time. Our solution is a total data readout (TDR) method where all channels run independently and are associated in software to reconstruct events. The TDR method allows all the data from both target position and focal plane to be collected with practically no dead-time losses. Each data word is associated with a timestamp generated from a global 100-MHz clock. Events are then reconstructed in real time in the event builder using temporal and spatial associations defined by the physics of the experimen

    Photonic mode density effects on single-molecule fluorescence blinking

    Get PDF
    We investigated the influence of the photonic mode density (PMD) on the triplet dynamics of individual chromophores on a dielectric interface by comparing their response in the presence and absence of a nearby gold film. Lifetimes of the excited singlet state were evaluated in ordet to measure directly the PMD at the molecules position. Triplet state lifetimes were simultaneously determined by statistical analysis of the detection time of the fluorescence photons. The observed singlet decay rates are in agreement with the predicted PMD for molecules with different orientations. The triplet decay rate is modified in a fashion correlated to the singlet decay rate. These results show that PMD engineering can lead to an important suppression of the fluorescence, introducing a novel aspect of the physical mechanism to enhance fluorescence intensity in PMD-enhancing systems such as plasmonic devices

    High-Order Discontinuous Galerkin Method for Boltzmann Model Equations

    Get PDF
    High-order Runge-Kutta discontinuous Galerkin (DG) method is applied to the kinetic model equations describing rarefied gas flows. A conservative DG discretization of nonlinear collision relaxation term is formulated for Bhatnagar-Gross-Krook and ellipsoidal statistical models. The numerical solutions using RKDG method of order up to four are obtained for two flow problems: the heat transfer between parallel plates and the normal shock wave. The convergence of RKDG method is compared with the conventional secondorder finite volume method for the heat transfer problem. The normal shock wave solutions obtained using RKDG are compared with the experimental measurements of density and velocity distribution function inside the shock

    Very high rotational frequencies and band termination in 73Br

    Get PDF
    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

    Full text link
    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 LL into maximally compact form L0L_0 proceeds in three steps: (i) translate L into its term graph G=[[L]]G = [[ L ]]; (ii) compute the maximally shared form of GG as its bisimulation collapse G0G_0; (iii) read back a lambda-letrec-term L0L_0 from the term graph G0G_0 with the property [[L0]]=G0[[ L_0 ]] = G_0. This guarantees that L0L_0 and LL have the same unfolding, and that L0L_0 exhibits maximal sharing. The procedure for deciding whether two given lambda-letrec-terms L1L_1 and L2L_2 are unfolding-equivalent computes their term graph interpretations [[L1]][[ L_1 ]] and [[L2]][[ 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
    • …
    corecore