Quantum Computing with Continuous-Variable Clusters

Continuous-variable cluster states offer a potentially promising method of implementing a quantum computer. This paper extends and further refines theoretical foundations and protocols for experimental implementation. We give a cluster-state implementation of the cubic phase gate through photon detection, which, together with homodyne detection, facilitates universal quantum computation. In addition, we characterize the offline squeezed resources required to generate an arbitrary graph state through passive linear optics. Most significantly, we prove that there are universal states for which the offline squeezing per mode does not increase with the size of the cluster. Simple representations of continuous-variable graph states are introduced to analyze graph state transformations under measurement and the existence of universal continuous-variable resource states.Comment: 17 pages, 5 figure

Hybridation of Bayesian networks and evolutionary algorithms for multi-objective optimization in an integrated product design and project management context

A better integration of preliminary product design and project management processes at early steps of system design is nowadays a key industrial issue. Therefore, the aim is to make firms evolve from classical sequential approach (first product design the project design and management) to new integrated approaches. In this paper, a model for integrated product/project optimization is first proposed which allows taking into account simultaneously decisions coming from the product and project managers. However, the resulting model has an important underlying complexity, and a multi-objective optimization technique is required to provide managers with appropriate scenarios in a reasonable amount of time. The proposed approach is based on an original evolutionary algorithm called evolutionary algorithm oriented by knowledge (EAOK). This algorithm is based on the interaction between an adapted evolutionary algorithm and a model of knowledge (MoK) used for giving relevant orientations during the search process. The evolutionary operators of the EA are modified in order to take into account these orientations. The MoK is based on the Bayesian Network formalism and is built both from expert knowledge and from individuals generated by the EA. A learning process permits to update probabilities of the BN from a set of selected individuals. At each cycle of the EA, probabilities contained into the MoK are used to give some bias to the new evolutionary operators. This method ensures both a faster and effective optimization, but it also provides the decision maker with a graphic and interactive model of knowledge linked to the studied project. An experimental platform has been developed to experiment the algorithm and a large campaign of tests permits to compare different strategies as well as the benefits of this novel approach in comparison with a classical EA

Event generation with SHERPA 1.1

In this paper the current release of the Monte Carlo event generator Sherpa, version 1.1, is presented. Sherpa is a general-purpose tool for the simulation of particle collisions at high-energy colliders. It contains a very flexible tree-level matrix-element generator for the calculation of hard scattering processes within the Standard Model and various new physics models. The emission of additional QCD partons off the initial and final states is described through a parton-shower model. To consistently combine multi-parton matrix elements with the QCD parton cascades the approach of Catani, Krauss, Kuhn and Webber is employed. A simple model of multiple interactions is used to account for underlying events in hadron--hadron collisions. The fragmentation of partons into primary hadrons is described using a phenomenological cluster-hadronisation model. A comprehensive library for simulating tau-lepton and hadron decays is provided. Where available form-factor models and matrix elements are used, allowing for the inclusion of spin correlations; effects of virtual and real QED corrections are included using the approach of Yennie, Frautschi and Suura.Comment: 47 pages, 21 figure

Rich Interfaces for Dependability: Compositional Methods for Dynamic Fault Trees and Arcade models

This paper discusses two behavioural interfaces for reliability analysis: dynamic fault trees, which model the system reliability in terms of the reliability of its components and Arcade, which models the system reliability at an architectural level. For both formalisms, the reliability is analyzed by transforming the DFT or Arcade model to a set of input-output Markov Chains. By using compositional aggregation techniques based on weak bisimilarity, significant reductions in the state space can be obtained

New Developments in MadGraph/MadEvent

We here present some recent developments of MadGraph/MadEvent since the latest published version, 4.0. These developments include: Jet matching with Pythia parton showers for both Standard Model and Beyond the Standard Model processes, decay chain functionality, decay width calculation and decay simulation, process generation for the Grid, a package for calculation of quarkonium amplitudes, calculation of Matrix Element weights for experimental events, automatic dipole subtraction for next-to-leading order calculations, and an interface to FeynRules, a package for automatic calculation of Feynman rules and model files from the Lagrangian of any New Physics model.Comment: 6 pages, 3 figures. Plenary talk given at SUSY08, Seoul, South Korea, June 2008. To appear in the proceeding

Formal Model Engineering for Embedded Systems Using Real-Time Maude

This paper motivates why Real-Time Maude should be well suited to provide a formal semantics and formal analysis capabilities to modeling languages for embedded systems. One can then use the code generation facilities of the tools for the modeling languages to automatically synthesize Real-Time Maude verification models from design models, enabling a formal model engineering process that combines the convenience of modeling using an informal but intuitive modeling language with formal verification. We give a brief overview six fairly different modeling formalisms for which Real-Time Maude has provided the formal semantics and (possibly) formal analysis. These models include behavioral subsets of the avionics modeling standard AADL, Ptolemy II discrete-event models, two EMF-based timed model transformation systems, and a modeling language for handset software.Comment: In Proceedings AMMSE 2011, arXiv:1106.596

Three neutrons from Lattice QCD

We present a study on ab-initio calculations of three-neutron correlators from Lattice QCD. We extend the method of baryon blocks to systems of three spacially displaced baryons. This allows the measurement of three-neutron $p$-wave correlators with total spin $S=1/2$ and $3/2$. In addition, we use automatic code generation that has high flexibility and allows for easy inclusion of additional channels in the future while optimizing the evaluation of contractions. Our measurements were performed on a newly generated $96\times 48^3$ Clover-Wilson gauge field ensemble with $m_{\pi} \approx 370\,\text{MeV}$. We present preliminary results of our calculations of one pion and nucleon as well as two nucleon ($2N$) and three neutron ($3n$) correlators.Comment: Proceedings from Lattice2018, 7 pages, 4 figure