University of Bristol Quantum Computation & Information Group

Dr Karoline Wiesner
Department of Mathematics
University of Bristol
University Walk
Bristol BS8 1TW, U.K.
Phone: +44(0)117 928-7970
Fax: +44(0)117 928-7999
Email: k.wiesner (at)
Web page
Recent publications:

  • Increasing complexity with quantum physics
    Janet Anders, Karoline Wiesner
    25 October 2011

    We argue that complex systems science and the rules of quantum physics are intricately related. We discuss a range of quantum phenomena, such as cryptography, computation and quantum phases, and the rules responsible for their complexity. We identify correlations as a central concept connecting quantum information and complex systems science. We present two examples for the power of correlations: using quantum resources to simulate the correlations of a stochastic process and to implement a classically impossible computational task.
    (hide abstract)

  • Hidden Quantum Markov Models and non-adaptive read-out of many-body states
    Alex Monras, Almut Beige, Karoline Wiesner
    12 February 2010

    Stochastic finite-state generators are compressed descriptions of infinite time series. Alternatively, compressed descriptions are given by quantum finite- state generators [K. Wiesner and J. P. Crutchfield, Physica D 237, 1173 (2008)]. These are based on repeated von Neumann measurements on a quantum dynamical system. Here we generalise the quantum finite-state generators by replacing the von Neumann pro jections by stochastic quantum operations. In this way we assure that any time series with a stochastic compressed description has a compressed quantum description. Moreover, we establish a link between our stochastic generators and the sequential readout of many-body states with translationally-invariant matrix product state representations. As an example, we consider the non-adaptive read-out of 1D cluster states. This is shown to be equivalent to a Hidden Quantum Model with two internal states, providing insight on the inherent complexity of the process. Finally, it is proven by example that the quantum description can have a higher degree of compression than the classical stochastic one.
    (hide abstract)

  • Quantum Cellular Automata
    K. Wiesner
    06 August 2008

    Quantum cellular automata (QCA) are reviewed, including early and more recent proposals. QCA are a generalization of (classical) cellular automata (CA) and in particular of reversible CA. The latter are reviewed shortly. An overview is given over early attempts by various authors to define one-dimensional QCA. These turned out to have serious shortcomings which are discussed as well. Various proposals subsequently put forward by a number of authors for a general definition of one- and higher-dimensional QCA are reviewed and their properties such as universality and reversibility are discussed.
    (hide abstract)