10,341 research outputs found

    Nonlinear quantum input-output analysis using Volterra series

    Full text link
    Quantum input-output theory plays a very important role for analyzing the dynamics of quantum systems, especially large-scale quantum networks. As an extension of the input-output formalism of Gardiner and Collet, we develop a new approach based on the quantum version of the Volterra series which can be used to analyze nonlinear quantum input-output dynamics. By this approach, we can ignore the internal dynamics of the quantum input-output system and represent the system dynamics by a series of kernel functions. This approach has the great advantage of modelling weak-nonlinear quantum networks. In our approach, the number of parameters, represented by the kernel functions, used to describe the input-output response of a weak-nonlinear quantum network, increases linearly with the scale of the quantum network, not exponentially as usual. Additionally, our approach can be used to formulate the quantum network with both nonlinear and nonconservative components, e.g., quantum amplifiers, which cannot be modelled by the existing methods, such as the Hudson-Parthasarathy model and the quantum transfer function model. We apply our general method to several examples, including Kerr cavities, optomechanical transducers, and a particular coherent feedback system with a nonlinear component and a quantum amplifier in the feedback loop. This approach provides a powerful way to the modelling and control of nonlinear quantum networks.Comment: 12 pages, 7 figure

    Synthesis of Quantum Logic Circuits

    Full text link
    We discuss efficient quantum logic circuits which perform two tasks: (i) implementing generic quantum computations and (ii) initializing quantum registers. In contrast to conventional computing, the latter task is nontrivial because the state-space of an n-qubit register is not finite and contains exponential superpositions of classical bit strings. Our proposed circuits are asymptotically optimal for respective tasks and improve published results by at least a factor of two. The circuits for generic quantum computation constructed by our algorithms are the most efficient known today in terms of the number of expensive gates (quantum controlled-NOTs). They are based on an analogue of the Shannon decomposition of Boolean functions and a new circuit block, quantum multiplexor, that generalizes several known constructions. A theoretical lower bound implies that our circuits cannot be improved by more than a factor of two. We additionally show how to accommodate the severe architectural limitation of using only nearest-neighbor gates that is representative of current implementation technologies. This increases the number of gates by almost an order of magnitude, but preserves the asymptotic optimality of gate counts.Comment: 18 pages; v5 fixes minor bugs; v4 is a complete rewrite of v3, with 6x more content, a theory of quantum multiplexors and Quantum Shannon Decomposition. A key result on generic circuit synthesis has been improved to ~23/48*4^n CNOTs for n qubit

    A distributed knowledge-based approach to flexible automation : the contract-net framework

    Get PDF
    Includes bibliographical references (p. 26-29)

    A heuristic-based approach to code-smell detection

    Get PDF
    Encapsulation and data hiding are central tenets of the object oriented paradigm. Deciding what data and behaviour to form into a class and where to draw the line between its public and private details can make the difference between a class that is an understandable, flexible and reusable abstraction and one which is not. This decision is a difficult one and may easily result in poor encapsulation which can then have serious implications for a number of system qualities. It is often hard to identify such encapsulation problems within large software systems until they cause a maintenance problem (which is usually too late) and attempting to perform such analysis manually can also be tedious and error prone. Two of the common encapsulation problems that can arise as a consequence of this decomposition process are data classes and god classes. Typically, these two problems occur together – data classes are lacking in functionality that has typically been sucked into an over-complicated and domineering god class. This paper describes the architecture of a tool which automatically detects data and god classes that has been developed as a plug-in for the Eclipse IDE. The technique has been evaluated in a controlled study on two large open source systems which compare the tool results to similar work by Marinescu, who employs a metrics-based approach to detecting such features. The study provides some valuable insights into the strengths and weaknesses of the two approache
    • …
    corecore