Abstract How much information do we need about a process’ past to faithfully simulate its future? The statistical complexity is a prominent quantifier of structure for stochastic processes. Quantum machines, however, can simulate classical stochastic processes while storing significantly less information than their optimal classical counterparts. This implies qualitative divergences between classical and quantum statistical complexity. Here, we develop error-tolerant techniques to witness such divergences, enabling us to account for the inevitable imperfections in realising quantum stochastic simulators with present-day quantum technology. We apply these tools to experimentally verify the quantum memory advantage in simulating an Ising spin chain, even when accounting for experimental distortion. This then leads us to observe a recently conjectured effect, the ambiguity of simplicity—the notion that the relative complexity of two different processes can depend on whether we model the process using classical or quantum means of information processing.
Abstract How much information do we need about a process’ past to faithfully simulate its future? The statistical complexity is a prominent quantifier of structure for stochastic processes. Quantum machines, however, can simulate classical stochastic processes while storing significantly less information than their optimal classical counterparts. This implies qualitative divergences between classical and quantum statistical complexity. Here, we develop error-tolerant techniques to witness such divergences, enabling us to account for the inevitable imperfections in realising quantum stochastic simulators with present-day quantum technology. We apply these tools to experimentally verify the quantum memory advantage in simulating an Ising spin chain, even when accounting for experimental distortion. This then leads us to observe a recently conjectured effect, the ambiguity of simplicity—the notion that the relative complexity of two different processes can depend on whether we model the process using classical or quantum means of information processing.
The modelling of stochastic processes is ubiquitous throughout the natural and social sciences. An ideal model produces the correct statistical output without any unnecessary complexity. This minimal-complexity criterion is important conceptually, entailing the least number of causes of effects (Occam's razor), and practically, entailing the least stored information in the simulation. Here, we experimentally compare classical and quantum information encodings in simulating an Ising spin chain, showing that quantum encodings perform better and redefine our understanding of what is complex. We experimentally observe a recently conjectured effect, the ambiguity of simplicity. Specifically, we simulate Ising chains at different temperatures, A and B, such that classical encodings require fewer resources to model A than B, while quantum encodings are simpler for B than A. This challenges the perspective that relative complexity is contained solely in the configuration of the system being modelled. Our error-tolerant techniques account for inevitable imperfections in realising quantum simulators, thus providing the technological milestone needed to simulate increasingly complex stochastic processes.
The minimal memory required to model a given stochastic process - known as the statistical complexity - is a widely adopted quantifier of structure in complexity science. Here, we ask if quantum mechanics can fundamentally change the qualitative behaviour of this measure. We study this question in the context of the classical Ising spin chain. In this system, the statistical complexity is known to grow monotonically with temperature. We evaluate the spin chain's quantum mechanical statistical complexity by explicitly constructing its provably simplest quantum model, and demonstrate that this measure exhibits drastically different behaviour: it rises to a maximum at some finite temperature then tends back towards zero for higher temperatures. This demonstrates how complexity, as captured by the amount of memory required to model a process, can exhibit radically different behaviour when quantum processing is allowed.
Isolating past information relevant for future prediction is central to quantitative science. Quantum models offer a promising approach, enabling statistically faithful modeling while using less past information than any classical counterpart. Here we introduce a class of phase-enhanced quantum models, representing the most general means of simulating a stochastic process unitarily in causal order. The resulting constructions surpass previous state-of-art methods---both in reducing the information they need to store about the past and in the minimal memory dimension they require to store this information. Moreover, these two features are generally competing factors in optimization---leading to an ambiguity in optimal modeling that is unique to the quantum regime. Our results simultaneously offer quantum advantages for stochastic simulation and illustrate further qualitative differences between classical and quantum notions of complexity.
Abstract Continuous-time stochastic processes pervade everyday experience, and the simulation of models of these processes is of great utility. Classical models of systems operating in continuous-time must typically track an unbounded amount of information about past behaviour, even for relatively simple models, enforcing limits on precision due to the finite memory of the machine. However, quantum machines can require less information about the past than even their optimal classical counterparts to simulate the future of discrete-time processes, and we demonstrate that this advantage extends to the continuous-time regime. Moreover, we show that this reduction in the memory requirement can be unboundedly large, allowing for arbitrary precision even with a finite quantum memory. We provide a systematic method for finding superior quantum constructions, and a protocol for analogue simulation of continuous-time renewal processes with a quantum machine.
Since its inception, quantum information processing (QIP) has been branched into many new directions. As well as well-known applications such as teleportation and metrology, researchers are beginning to investigate interdisciplinary areas such as quantum machine learning. One of the interesting areas is where quantum information science meets stochastic modelling, from the field of complexity science. Recently, it has been shown theoretically that, for simulating classical systems, quantumassisted models and simulators are more efficient in terms of memory storage they require to do simulations, compared with classical computers. That is, for most systems, classical simulators demand an excessive amount of memory storage, while quantum simulators can do the same simulation with less memory. The main focus of this thesis is on experimental realisation of quantum simulators that are capable of simulating stochastic processes with a reduced amount of memory. To implement the (nearly) exact simulation of stochastic processes using quantum simulators, it is essential to have low-noise state preparation, robust unitary operations, and high-precision read-out. These requirements, and the flexibility and precision of photonic quantum optics, make photonics the ideal system for developing the science of this new quantum advantage and for making strides towards its technological realisation. In the context of stochastic simulation, I have experimentally studied three key problems that serve as stepping stones in advancing this new field. In the first experiment, an error-tolerant quantum simulator was designed, and realised to simulate a 1D Ising spin chain, using internal states that store less information than the corresponding classical approach. Furthermore, an interesting and fundamental phenomenon named the ambiguity of simplicity is witnessed. This is the inconsistency that we observe in the order of relative complexity of two systems when we change the simulators from classical to quantum. In the second experiment, a quantum simulator was built that can simulate classical processes for more than one step of the simulation at a time, storing the information from multiple steps coherently. In the third experiment, a new type of quantum memory advantage, which is based on the dimensionality of the memory register, rather than on information entropy measure, is demonstrated. This advantage is realisable in a single simulator, in contrast to previous works. Realising the dimensionality memory advantage in practical applications does not rely on running multiple simulators in parallel.In the field of optical QIP, realising an ideal single-photon source has been a longstanding challenge. In another part of my PhD, I have worked on a source that aims to tackle some of the existing issues in this context. We built a source of high-quality entangled photons with a high heralding efficiency, which has the potential to be used in multi-photon experiments. This source was also essential to demonstrate a fundamental task in quantum non-locality, one-way steering, which was performed conclusively for the first time.
A growing body of work has established the modeling of stochastic processes as a promising area of application for quantum technologies; it has been shown that quantum models are able to replicate the future statistics of a stochastic process while retaining less information about the past than any classical model must, even for a purely classical process. Such memory-efficient models open a potential future route to study complex systems in greater detail than ever before and suggest profound consequences for our notions of structure in their dynamics. Yet, to date methods for constructing these quantum models are based on having a prior knowledge of the optimal classical model. Here, we introduce a protocol for blind inference of the memory structure of quantum models---tailored to take advantage of quantum features---direct from time-series data, in the process highlighting the robustness of their structure to noise. This in turn provides a way to construct memory-efficient quantum models of stochastic processes while circumventing certain drawbacks that manifest solely as a result of classical information processing in classical inference protocols.