arXiv subjects

Andrew J. P. Garner

Publications and source records attributed to Andrew J. P. Garner.

At least 19 recordsLinked to original sources

arXiv2026

Non-commutative optimization problems with differential constraints

Non-commutative polynomial optimization (NPO) problems seek to minimize the state average of a polynomial of some operator variables, subject to polynomial constraints, over all states and operators, as well as the Hilbert spaces where those might be defined. Many of these problems are known to admit a complete hierarchy of semidefinite programming (SDP) relaxations. In this work, we consider a variant of NPO problems where a subset of the operator variables satisfies a system of ordinary differential equations. We prove that, under mild conditions of operator boundedness, for every such problem one can construct a standard NPO problem with the same solution. This allows us to define a complete hierarchy of SDPs to tackle the original differential problem. We apply this method to bound averages of local observables in quantum spin systems subject to a Hamiltonian evolution (i.e., a quench). We find that, even in the thermodynamic limit of infinitely many sites, low levels of the hierarchy provide very good approximations for reasonably long evolution times.

quant-ph↗

arXiv2026

First-order optimality conditions for non-commutative optimization problems

We consider the problem of optimizing the state average of a polynomial of non-commuting variables, over all states and operators satisfying a number of polynomial constraints, and over all Hilbert spaces where such states and operators are defined. Such non-commutative polynomial optimization (NPO) problems are routinely solved through hierarchies of semidefinite programming (SDP) relaxations. By formulating the general NPO problem in Lagrangian terms, we heuristically derive first-order optimality conditions via small variations in the problem variables. Although the derivation is not rigorous, it gives rise to two types of optimality conditions -- state and operator -- which are rigorously analyzed in the paper. Both types of conditions can be enforced through additional positive semidefinite constraints in the SDP hierarchies. State optimality conditions are shown to be satisfied by all NPO problems. For NPO problems with optimal solutions (such as, e.g., Archimedean ones) they allow enforcing a new type of constraints: namely, restricting the optimization over states to the set of common ground states of an arbitrary number of operators. Operator optimality conditions are the non-commutative analogs of the Karush--Kuhn--Tucker (KKT) conditions, which are known to hold in many classical optimization problems. In this regard, we prove that a weak form of operator optimality holds for all NPO problems; stronger versions require the problem constraints to satisfy some qualification criterion, just like in the classical case (e.g.: Mangasarian--Fromovitz constraint qualification). We test the power of the new optimality conditions by computing local properties of ground states of many-body spin systems and the maximum quantum violation of Bell inequalities.

quant-ph↗

arXiv2025

Energetic advantages for quantum agents in online execution of complex strategies

Agents often execute complex strategies -- adapting their response to each input stimulus depending on past observations and actions. Here, we derive the minimal energetic cost for classical agents to execute a given strategy, highlighting that they must dissipate a certain amount of heat with each decision beyond Landauer's limit. We then prove that quantum agents can reduce this dissipation below classical limits. We establish the necessary and sufficient conditions for a strategy to guarantee quantum agents have energetic advantage, and illustrate settings where this advantage grows without bound. Our results establish a fundamental energetic advantage for agents utilizing quantum processing to enact complex adaptive behaviour.

quant-ph↗

arXiv2024

Introducing Moment: A toolkit for semi-definite programming with moment matrices

Non-commutative polynomial optimization is a powerful technique with numerous applications in quantum nonlocality, quantum key distribution, causal inference, many-body physics, amongst others. The standard approach is to reduce such optimizations to a hierarchy of semi-definite programs, which can be solved numerically using well-understood interior-point methods. A key, but computationally costly, step is the formulation of moment matrices, whose size (and hence cost) grows exponentially with the depth of the hierarchy. It is therefore essential to have highly-optimized software to construct moment matrices. Here, we introduce Moment: a toolkit that produces moment matrix relaxations from the specification of a non-commutative optimization problem. In order to obtain the absolute best performance, Moment is written in C++, and for convenience of use provides an interface via MATLAB. We benchmark Moment's performance, and see that it can be up to four orders of magnitude faster than current software with similar functionality.

quant-ph↗

arXiv2023

Characterization of the probabilistic models that can be embedded in quantum theory

Quantum bits can be isolated to perform useful information-theoretic tasks, even though physical systems are fundamentally described by very high-dimensional operator algebras. This is because qubits can be consistently embedded into higher-dimensional Hilbert spaces. A similar embedding of classical probability distributions into quantum theory enables the emergence of classical physics via decoherence. Here, we ask which other probabilistic models can similarly be embedded into finite-dimensional quantum theory. We show that the embeddable models are exactly those that correspond to the Euclidean special Jordan algebras: quantum theory over the reals, the complex numbers, or the quaternions, and "spin factors" (qubits with more than three degrees of freedom), and direct sums thereof. Among those, only classical and standard quantum theory with superselection rules can arise from a physical decoherence map. Our results have significant consequences for some experimental tests of quantum theory, by clarifying how they could (or could not) falsify it. Furthermore, they imply that all unrestricted non-classical models must be contextual.

quant-ph↗

arXiv2023

Testing quantum theory by generalizing noncontextuality

It is a fundamental prediction of quantum theory that states of physical systems are described by complex vectors or density operators on a Hilbert space. However, many experiments admit effective descriptions in terms of other state spaces, such as classical probability distributions or quantum systems with superselection rules. Which kind of effective statistics would allow us to experimentally falsify quantum theory as a fundamental description of nature? Here, we address this question by introducing a methodological principle that generalizes Spekkens' notion of noncontextuality: processes that are statistically indistinguishable in an effective theory should not require explanation by multiple distinguishable processes in a more fundamental theory. We formulate this principle in terms of linear embeddings and simulations of one probabilistic theory by another, show how this concept subsumes standard notions of contextuality, and prove a multitude of fundamental results on the exact and approximate embedding of theories (in particular into quantum theory). We prove that only Jordan-algebraic state spaces are exactly embeddable into quantum theory, and show how results on Bell inequalities can be used for the certification of non-approximate embeddability. From this, we propose an experimental test of quantum theory by probing single physical systems without assuming access to a tomographically complete set of procedures or calibration of the devices, arguably avoiding a significant loophole of earlier approaches.

quant-ph↗

arXiv2022

Surveying structural complexity in quantum many-body systems

Quantum many-body systems exhibit a rich and diverse range of exotic behaviours, owing to their underlying non-classical structure. These systems present a deep structure beyond those that can be captured by measures of correlation and entanglement alone. Using tools from complexity science, we characterise such structure. We investigate the structural complexities that can be found within the patterns that manifest from the observational data of these systems. In particular, using two prototypical quantum many-body systems as test cases - the one-dimensional quantum Ising and Bose-Hubbard models - we explore how different information-theoretic measures of complexity are able to identify different features of such patterns. This work furthers the understanding of fully-quantum notions of structure and complexity in quantum systems and dynamics.

quant-ph↗

arXiv2022

Quantum adaptive agents with efficient long-term memories

Central to the success of adaptive systems is their ability to interpret signals from their environment and respond accordingly -- they act as agents interacting with their surroundings. Such agents typically perform better when able to execute increasingly complex strategies. This comes with a cost: the more information the agent must recall from its past experiences, the more memory it will need. Here we investigate the power of agents capable of quantum information processing. We uncover the most general form a quantum agent need adopt to maximise memory compression advantages, and provide a systematic means of encoding their memory states. We show these encodings can exhibit extremely favourable scaling advantages relative to memory-minimal classical agents, particularly when information must be retained about events increasingly far into the past.

quant-ph↗

arXiv2022

Quantum Darwinism and the spreading of classical information in non-classical theories

Quantum Darwinism posits that the emergence of a classical reality relies on the spreading of classical information from a quantum system to many parts of its environment. But what are the essential physical principles of quantum theory that make this mechanism possible? We address this question by formulating the simplest instance of Darwinism - CNOT-like fan-out interactions - in a class of probabilistic theories that contain classical and quantum theory as special cases. We determine necessary and sufficient conditions for any theory to admit such interactions. We find that every theory with non-classical features that admits this idealized spreading of classical information must have both entangled states and entangled measurements. Furthermore, we show that Spekkens' toy theory admits this form of Darwinism, and so do all probabilistic theories that satisfy principles like strong symmetry, or contain a certain type of decoherence processes. Our result suggests the counter-intuitive general principle that in the presence of local non-classicality, a classical world can only emerge if this non-classicality can be "amplified" to a form of entanglement.

quant-ph↗

arXiv2021

The fundamental thermodynamic bounds on finite models

The minimum heat cost of computation is subject to bounds arising from Landauer's principle. Here, I derive bounds on finite modelling -- the production or anticipation of patterns (time-series data) -- by devices that model the pattern in a piecewise manner and are equipped with a finite amount of memory. When producing a pattern, I show that the minimum dissipation is proportional to the information in the model's memory about the pattern's history that never manifests in the device's future behaviour and must be expunged from memory. I provide a general construction of model that allow this dissipation to be reduced to zero. By also considering devices that consume, or effect arbitrary changes on a pattern, I discuss how these finite models can form an information reservoir framework consistent with the second law of thermodynamics.

cond-mat.stat-mech↗

arXiv2021

Resource theories of multi-time processes: A window into quantum non-Markovianity

We investigate the conditions under which an uncontrollable background processes may be harnessed by an agent to perform a task that would otherwise be impossible within their operational framework. This situation can be understood from the perspective of resource theory: rather than harnessing 'useful' quantum states to perform tasks, we propose a resource theory of quantum processes across multiple points in time. Uncontrollable background processes fulfil the role of resources, and a new set of objects called superprocesses, corresponding to operationally implementable control of the system undergoing the process, constitute the transformations between them. After formally introducing a framework for deriving resource theories of multi-time processes, we present a hierarchy of examples induced by restricting quantum or classical communication within the superprocess - corresponding to a client-server scenario. The resulting nine resource theories have different notions of quantum or classical memory as the determinant of their utility. Furthermore, one of these theories has a strict correspondence between non-useful processes and those that are Markovian and, therefore, could be said to be a true 'quantum resource theory of non-Markovianity'.

quant-ph↗

arXiv2020

Extreme dimensionality reduction with quantum modelling

Effective and efficient forecasting relies on identification of the relevant information contained in past observations -- the predictive features -- and isolating it from the rest. When the future of a process bears a strong dependence on its behaviour far into the past, there are many such features to store, necessitating complex models with extensive memories. Here, we highlight a family of stochastic processes whose minimal classical models must devote unboundedly many bits to tracking the past. For this family, we identify quantum models of equal accuracy that can store all relevant information within a single two-dimensional quantum system (qubit). This represents the ultimate limit of quantum compression and highlights an immense practical advantage of quantum technologies for the forecasting and simulation of complex systems.

quant-ph↗

arXiv2020

Semi-device-independent information processing with spatiotemporal degrees of freedom

Nonlocality, as demonstrated by the violation of Bell inequalities, enables device-independent cryptographic tasks that do not require users to trust their apparatus. In this article, we consider devices whose inputs are spatiotemporal degrees of freedom, e.g. orientations or time durations. Without assuming the validity of quantum theory, we prove that the devices' statistical response must respect their input's symmetries, with profound foundational and technological implications. We exactly characterize the bipartite binary quantum correlations in terms of local symmetries, indicating a fundamental relation between spacetime and quantum theory. For Bell experiments characterized by two input angles, we show that the correlations are accounted for by a local hidden variable model if they contain enough noise, but conversely must be nonlocal if they are pure enough. This allows us to construct a "Bell witness" that certifies nonlocality with fewer measurements than possible without such spatiotemporal symmetries, suggesting a new class of semi-device-independent protocols for quantum technologies.

quant-ph↗

arXiv2019

Memory-efficient tracking of complex temporal and symbolic dynamics with quantum simulators

Tracking the behaviour of stochastic systems is a crucial task in the statistical sciences. It has recently been shown that quantum models can faithfully simulate such processes whilst retaining less information about the past behaviour of the system than the optimal classical models. We extend these results to general temporal and symbolic dynamics. Our systematic protocol for quantum model construction relies only on an elementary description of the dynamics of the process. This circumvents restrictions on corresponding classical construction protocols, and allows for a broader range of processes to be modelled efficiently. We illustrate our method with an example exhibiting an apparent unbounded memory advantage of the quantum model compared to its optimal classical counterpart.

quant-ph↗

arXiv2018

On defining the Hamiltonian beyond quantum theory

Energy is a crucial concept within classical and quantum physics. An essential tool to quantify energy is the Hamiltonian. Here, we consider how to define a Hamiltonian in general probabilistic theories, a framework in which quantum theory is a special case. We list desiderata which the definition should meet. For 3-dimensional systems, we provide a fully-defined recipe which satisfies these desiderata. We discuss the higher dimensional case where some freedom of choice is left remaining. We apply the definition to example toy theories, and discuss how the quantum notion of time evolution as a phase between energy eigenstates generalises to other theories.

quant-ph↗

arXiv2018

Causal Asymmetry in a Quantum World

Causal asymmetry is one of the great surprises in predictive modelling: the memory required to predict the future differs from the memory required to retrodict the past. There is a privileged temporal direction for modelling a stochastic process where memory costs are minimal. Models operating in the other direction incur an unavoidable memory overhead. Here we show that this overhead can vanish when quantum models are allowed. Quantum models forced to run in the less natural temporal direction not only surpass their optimal classical counterparts, but also any classical model running in reverse time. This holds even when the memory overhead is unbounded, resulting in quantum models with unbounded memory advantage.

quant-ph↗

arXiv2018

One-shot information-theoretical approaches to fluctuation theorems

Traditional thermodynamics governs the behaviour of large systems that evolve between states of thermal equilibrium. For these large systems, the mean values of thermodynamic quantities (such as work, heat and entropy) provide a good characterisation of the process. Conversely, there is ever-increasing interest in the thermal behaviour of systems that evolve quickly and far from equilibrium, and that are too small for their behaviour to be well-described by mean values. Two major fields of modern thermodynamics seek to tackle such systems: non-equilibrium thermodynamics, and the nascent field of one-shot statistical mechanics. The former provides tools such as fluctuation theorems, whereas the latter applies "one-shot" Rényi entropies to thermal contexts. In this chapter to the upcoming book "Thermodynamics in the quantum regime - Recent progress and outlook" (Springer International Publishing), I provide a gentle introduction to recent research that draws from both fields: the application of one-shot information theory to fluctuation theorems.

cond-mat.stat-mech↗

arXiv2018

Maximum one-shot dissipated work from Renyi divergences

Thermodynamics describes large-scale, slowly evolving systems. Two modern approaches generalize thermodynamics: fluctuation theorems, which concern finite-time nonequilibrium processes, and one-shot statistical mechanics, which concerns small scales and finite numbers of trials. Combining these approaches, we calculate a one-shot analog of the average dissipated work defined in fluctuation contexts: the cost of performing a protocol in finite time instead of quasistatically. The average dissipated work has been shown to be proportional to a relative entropy between phase-space densities, to a relative entropy between quantum states, and to a relative entropy between probability distributions over possible values of work. We derive one-shot analogs of all three equations, demonstrating that the order-infinity Renyi divergence is proportional to the maximum possible dissipated work in each case. These one-shot analogs of fluctuation-theorem results contribute to the unification of these two toolkits for small-scale, nonequilibrium statistical physics.

cond-mat.stat-mech↗