arXiv subjects

Karoline Wiesner

Publications and source records attributed to Karoline Wiesner.

31 records · Page 2Linked to original sources

arXiv2014

Negative Conditional Entropy of Post-Selected States

We define a quantum entropy conditioned on post-selection which has the von Neumann entropy of pure states as a special case. This conditional entropy can take negative values which is consistent with part of a quantum system containing less information than the whole which can be in a pure state. The definition is based on generalised density operators for postselected ensembles. The corresponding density operators are consistent with the quantum generalisation of classical conditional probabilities following Dirac s formalism of quasiprobability distributions.

quant-ph↗

arXiv2012

Hidden Quantum Markov Models and non-adaptive read-out of many-body states

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.

quant-ph↗

arXiv2012

Using mutual information to measure order in model glass-formers

Whether or not there is growing static order accompanying the dynamical heterogeneity and increasing relaxation times seen in glassy systems is a matter of dispute. An obstacle to resolving this issue is that the order is expected to be amorphous and so not amenable to simple order parameters. We use mutual information to provide a general measurement of order that is sensitive to multi-particle correlations. We apply this to two glass-forming systems (2D binary mixtures of hard disks with different size ratios to give varying amounts of hexatic order) and show that there is little growth of amorphous order in the system without crystalline order. In both cases we measure the dynamical length with a four-point correlation function and find that it increases significantly faster than the static lengths in the system as density is increased. We further show that we can recover the known scaling of the dynamic correlation length in a kinetically constrained model, the 2-TLG.

cond-mat.soft↗

arXiv2012

Occam's Quantum Razor: How Quantum Mechanics can reduce the complexity of classical models

Mathematical models are an essential component of quantitative science. They generate predictions about the future, based on information available in the present. In the spirit of Occam's razor, simpler is better; should two models make identical predictions, the one that requires less input is preferred. Yet, for almost all stochastic processes, even the provably optimal classical models waste information. The amount of input information they demand exceeds the amount of predictive information they output. We systematically construct quantum models that break this classical bound, and show that the system of minimal entropy that simulates such processes must necessarily feature quantum dynamics. This indicates that many observed phenomena could be significantly simpler than classically possible should quantum effects be involved.

quant-ph↗

arXiv2011

Increasing complexity with quantum physics

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.

quant-ph↗

arXiv2011

Information erasure lurking behind measures of complexity

Complex systems are found in most branches of science. It is still argued how to best quantify their complexity and to what end. One prominent measure of complexity (the statistical complexity) has an operational meaning in terms of the amount of resources needed to forecasting a system's behaviour. Another one (the effective measure complexity, aka excess entropy) is a measure of mutual information stored in the system proper. We show that for any given system the two measures differ by the amount of information erased during forecasting. We interpret the difference as inefficiency of a given model. We find a bound to the ratio of the two measures defined as information-processing efficiency, in analogy to the second law of thermodynamics. This new link between two prominent measures of complexity provides a quantitative criterion for good models of complex systems, namely those with little information erasure.

physics.data-an↗

arXiv2011

Information-theoretic bound on the energy cost of stochastic simulation

Physical systems are often simulated using a stochastic computation where different final states result from identical initial states. Here, we derive the minimum energy cost of simulating a complex data set of a general physical system with a stochastic computation. We show that the cost is proportional to the difference between two information-theoretic measures of complexity of the data - the statistical complexity and the predictive information. We derive the difference as the amount of information erased during the computation. Finally, we illustrate the physics of information by implementing the stochastic computation as a Gedankenexperiment of a Szilard-type engine. The results create a new link between thermodynamics, information theory, and complexity.

physics.data-an↗

arXiv2010

Inferring hidden Markov models from noisy time sequences: a method to alleviate degeneracy in molecular dynamics

We present a new method for inferring hidden Markov models from noisy time sequences without the necessity of assuming a model architecture, thus allowing for the detection of degenerate states. This is based on the statistical prediction techniques developed by Crutchfield et al., and generates so called causal state models, equivalent to hidden Markov models. This method is applicable to any continuous data which clusters around discrete values and exhibits multiple transitions between these values such as tethered particle motion data or Fluorescence Resonance Energy Transfer (FRET) spectra. The algorithms developed have been shown to perform well on simulated data, demonstrating the ability to recover the model used to generate the data under high noise, sparse data conditions and the ability to infer the existence of degenerate states. They have also been applied to new experimental FRET data of Holliday Junction dynamics, extracting the expected two state model and providing values for the transition rates in good agreement with previous results and with results obtained using existing maximum likelihood based methods.

q-bio.QM↗

arXiv2008

Computation in Finitary Stochastic and Quantum Processes

We introduce stochastic and quantum finite-state transducers as computation-theoretic models of classical stochastic and quantum finitary processes. Formal process languages, representing the distribution over a process's behaviors, are recognized and generated by suitable specializations. We characterize and compare deterministic and nondeterministic versions, summarizing their relative computational power in a hierarchy of finitary process languages. Quantum finite-state transducers and generators are a first step toward a computation-theoretic analysis of individual, repeatedly measured quantum dynamical systems. They are explored via several physical systems, including an iterated beam splitter, an atom in a magnetic field, and atoms in an ion trap--a special case of which implements the Deutsch quantum algorithm. We show that these systems' behaviors, and so their information processing capacity, depends sensitively on the measurement protocol.

quant-ph↗

arXiv2007

Computation in Sofic Quantum Dynamical Systems

We analyze how measured quantum dynamical systems store and process information, introducing sofic quantum dynamical systems. Using recently introduced information-theoretic measures for quantum processes, we quantify their information storage and processing in terms of entropy rate and excess entropy, giving closed-form expressions where possible. To illustrate the impact of measurement on information storage in quantum processes, we analyze two spin-1 sofic quantum systems that differ only in how they are measured.

quant-ph↗

arXiv2007

Intrinsic Quantum Computation

We introduce ways to measure information storage in quantum systems, using a recently introduced computation-theoretic model that accounts for measurement effects. The first, the quantum excess entropy, quantifies the shared information between a quantum process's past and its future. The second, the quantum transient information, determines the difficulty with which an observer comes to know the internal state of a quantum process through measurements. We contrast these with von Neumann entropy and quantum entropy rate and provide a closed-form expression for the latter for the class of deterministic quantum processes.

quant-ph↗

arXiv2006

Language Diversity of Measured Quantum Processes

The behavior of a quantum system depends on how it is measured. How much of what is observed comes from the structure of the quantum system itself and how much from the observer's choice of measurement? We explore these questions by analyzing the \emph{language diversity} of quantum finite-state generators. One result is a new way to distinguish quantum devices from their classical (stochastic) counterparts. While the diversity of languages generated by these two computational classes is the same in the case of periodic processes, quantum systems generally generate a wider range of languages than classical systems.

quant-ph↗

arXiv2006

Infinite Correlation in Measured Quantum Processes

We show that quantum dynamical systems can exhibit infinite correlations in their behavior when repeatedly measured. We model quantum processes using quantum finite-state generators and take the stochastic language they generate as a representation of their behavior. We analyze two spin-1 quantum systems that differ only in how they are observed. The corresponding language generated has short-range correlation in one case and infinite correlation in the other.

quant-ph↗