141,309 research outputs found
Cluster state preparation using gates operating at arbitrary success probabilities
Several physical architectures allow for measurement-based quantum computing
using sequential preparation of cluster states by means of probabilistic
quantum gates. In such an approach, the order in which partial resources are
combined to form the final cluster state turns out to be crucially important.
We determine the influence of this classical decision process on the expected
size of the final cluster. Extending earlier work, we consider different
quantum gates operating at various probabilites of success. For finite
resources, we employ a computer algebra system to obtain the provably optimal
classical control strategy and derive symbolic results for the expected final
size of the cluster. We identify two regimes: When the success probability of
the elementary gates is high, the influence of the classical control strategy
is found to be negligible. In that case, other figures of merit become more
relevant. In contrast, for small probabilities of success, the choice of an
appropriate strategy is crucial.Comment: 7 pages, 9 figures, contribution to special issue of New J. Phys. on
"Measurement-Based Quantum Information Processing". Replaced with published
versio
Recommended from our members
A general theory of action languages
We present a general theory of action-based languages as a paradigm, for the description, of those computational
systems which include elements of concurrency and networking, and extend this approach
to describe dist.ributed systems and also t,o describe the interaction of a system, with an environment.
As part of this approach we introduce the Action Language as a common model for the class of nondeterministic
concurrent programming languages and define its intensional and interaction semantics
in terrors of continuous transformation of environment behavior. This semantics i.s specialized for
programs with stores, and extended to describe distributed computations
Behavioural hybrid process calculus
Process algebra is a theoretical framework for the modelling and analysis of the behaviour of concurrent discrete event systems that has been developed within computer science in past quarter century. It has generated a deeper nderstanding of the nature of concepts such as observable behaviour in the presence of nondeterminism, system composition by interconnection of concurrent component systems, and notions of behavioural equivalence of such systems. It has contributed fundamental concepts such as bisimulation, and has been successfully used in a wide range of problems and practical applications in concurrent systems. We believe that the basic tenets of process algebra are highly compatible with the behavioural approach to dynamical systems. In our contribution we present an extension of classical process algebra that is suitable for the modelling and analysis of continuous and hybrid dynamical systems. It provides a natural framework for the concurrent composition of such systems, and can deal with nondeterministic behaviour that may arise from the occurrence of internal switching events. Standard process algebraic techniques lead to the characterisation of the observable behaviour of such systems as equivalence classes under some suitably adapted notion of bisimulation
- âŚ