Searcharxiv⌕ Search

arXiv subjects

Tobias J. Osborne

Publications and source records attributed to Tobias J. Osborne.

At least 37 records · Page 2Linked to original sources

Conformal field theory from lattice fermions

We provide a rigorous lattice approximation of conformal field theories given in terms of lattice fermions in 1+1-dimensions, focussing on free fermion models and Wess-Zumino-Witten models. To this end, we utilize a recently introduced operator-algebraic framework for Wilson-Kadanoff renormalization. In this setting, we prove the convergence of the approximation of the Virasoro generators by the Koo-Saleur formula. From this, we deduce the convergence of lattice approximations of conformal correlation functions to their continuum limit. In addition, we show how these results lead to explicit error estimates pertaining to the quantum simulation of conformal field theories.

math-ph↗

Quantum Simulation of Conformal Field Theory

Conformal field theory, describing systems with scaling symmetry, plays a crucial role throughout physics. We describe a quantum algorithm to simulate the dynamics of conformal field theories, including the action of local conformal transformations. A full analysis of the approximation errors suggests near-term applicability of our algorithm: promising results for conformal field theories with central charge c=1/2 are obtained already with 128 logical qubits.

quant-ph↗

Extremal Steering Assemblages

Non-local correlations between a fully characterised quantum system and an untrusted black box device are described by an assemblage of conditional quantum states. These assemblages form a convex set, whose extremal points are relevant in many operational contexts. We give necessary and sufficient conditions for an assemblage to be extremal using linear independence conditions, and an algorithm to decompose a generic assemblage into extremal points. A Matlab implementation of this algorithm is provided in the supplementary material.

quant-ph↗

Training Quantum Neural Networks on NISQ Devices

The advent of noisy intermediate-scale quantum (NISQ) devices offers crucial opportunities for the development of quantum algorithms. Here we evaluate the noise tolerance of two quantum neural network (QNN) architectures on IBM's NISQ devices, namely, dissipative QNN (DQNN) whose building-block perceptron is a completely positive map, and the quantum approximate optimization algorithm (QAOA). We compare these two approaches to learning an unknown unitary. While both networks succeed in this learning task, we find that a DQNN learns an unknown unitary more reliably than QAOA and is less susceptible to gate noise.

quant-ph↗

Quantum machine learning of graph-structured data

Graph structures are ubiquitous throughout the natural sciences. Here we consider graph-structured quantum data and describe how to carry out its quantum machine learning via quantum neural networks. In particular, we consider training data in the form of pairs of input and output quantum states associated with the vertices of a graph, together with edges encoding correlations between the vertices. We explain how to systematically exploit this additional graph structure to improve quantum learning algorithms. These algorithms are numerically simulated and exhibit excellent learning behavior. Scalable quantum implementations of the learning procedures are likely feasible on the next generation of quantum computing devices.

quant-ph↗

Holographic networks for (1+1)-dimensional de Sitter spacetime

Holographic tensor networks associated to tilings of (1+1)-dimensional de Sitter spacetime are introduced. Basic features of these networks are discussed, compared, and contrasted with conjectured properties of quantum gravity in de Sitter spacetime. Notably, we highlight a correspondence between the quantum information capacity of the network and the cosmological constant.

hep-th↗

Quantum fields for unitary representations of Thompson's groups F and T

We describe how to define observables analogous to quantum fields for the semicontinuous limit recently introduced by Jones in the study of unitary representations of Thompson's groups $F$ and $T$. We find that, in terms of correlation functions of these fields, one can deduce quantities resembling the conformal data, i.e., primary fields, scaling dimensions, and the operator product expansion. Examples coming from quantum spin systems and anyon chains built on the trivalent category $\mathit{SO}(3)_q$ are studied.

math-ph↗

Quantum Yang-Mills theory: an overview of a programme

We present an overview of a programme to understand the low-energy physics of quantum Yang-Mills theory from a quantum-information perspective. Our setting is that of the hamiltonian formulation of pure Yang-Mills theory in the temporal gauge on the lattice. Firstly, inspired by recent constructions for $\mathbb{Z}/2\mathbb{Z}$ lattice gauge theory, in particular, Kitaev's toric code, we describe the gauge-invariant sector of hilbert space by introducing a primitive quantum gate: the quantum parallel transporter. We then develop a nonabelian generalisation of laplace interpolation to present an ansatz for the ground state of pure Yang-Mills theory which interpolates between the weak- and strong-coupling RG fixed points. The resulting state acquires the structure of a tensor network, namely, a multiscale entanglement renormalisation ansatz, and allows for the efficient computation of local observables and Wilson loops. Various refinements of the tensor network are discussed leading to several generalisations. Finally, the continuum limit of our ansatz as the lattice regulator is removed is then described. This paper is intended as an abstract for an ongoing programme: there are still many open problems.

quant-ph↗

No Free Lunch for Quantum Machine Learning

The ultimate limits for the quantum machine learning of quantum data are investigated by obtaining a generalisation of the celebrated No Free Lunch (NFL) theorem. We find a lower bound on the quantum risk (the probability that a trained hypothesis is incorrect when presented with a random input) of a quantum learning algorithm trained via pairs of input and output states when averaged over training pairs and unitaries. The bound is illustrated using a recently introduced QNN architecture.

quant-ph↗

Dynamics for holographic codes

We describe how to introduce dynamics for the holographic states and codes introduced by Pastawski, Yoshida, Harlow and Preskill. This task requires the definition of a continuous limit of the kinematical Hilbert space which we argue may be achieved via the semicontinuous limit of Jones. Dynamics is then introduced by building a unitary representation of a group known as Thompson's group T, which is closely related to the conformal group in 1+1 dimensions. The bulk Hilbert space is realised as a special subspace of the semicontinuous limit Hilbert space spanned by a class of distinguished states which can be assigned a discrete bulk geometry. The analogue of the group of large bulk diffeomorphisms is given by a unitary representation of the Ptolemy group Pt, on the bulk Hilbert space thus realising a toy model of the AdS/CFT correspondence which we call the Pt/T correspondence.

quant-ph↗

Tensor-Network Approach for Quantum Metrology in Many-Body Quantum Systems

Identification of the optimal quantum metrological protocols in realistic many particle quantum models is in general a challenge that cannot be efficiently addressed by the state-of-the-art numerical and analytical methods. Here we provide a comprehensive framework exploiting matrix product operators (MPO) type tensor networks for quantum metrological problems. Thanks to the fact that the MPO formalism allows for an efficient description of short-range spatial and temporal noise correlations, the maximal achievable estimation precision in such models, as well as the optimal probe states in previously inaccessible regimes can be identified. Moreover, the application of infinite MPO (iMPO) techniques allows for a direct and efficient determination of the asymptotic precision of optimal protocols in the limit of infinite particle numbers. We illustrate the potential of our framework in terms of an atomic clock stabilization (temporal noise correlation) example as well as for magnetic field sensing in the presence of locally correlated magnetic field fluctuations (spatial noise correlations). As a byproduct, the developed methods for calculating the quantum Fisher information via MPOs may be used to calculate the fidelity susceptibility - a parameter widely used in many-body physics to study phase transitions.

quant-ph↗

Gauging Defects in Quantum Spin Systems

The goal of this work is to build a dynamical theory of defects for quantum spin systems. A kinematic theory for an indefinite number of defects is first introduced exploiting distinguishable Fock space. Dynamics are then incorporated by allowing the defects to become mobile via a microscopic Hamiltonian. This construction is extended to topologically ordered systems by restricting to the ground state eigenspace of Hamiltonians generalizing the golden chain. We illustrate the construction with the example of a spin chain with $\mathbf{Vec}(\mathbb{Z}/2\mathbb{Z})$ fusion rules, employing generalized tube algebra techniques to model the defects in the chain. The resulting dynamical defect model is equivalent to the critical transverse Ising model.

quant-ph↗

The F-Symbols for the H3 Fusion Category

We present a solution for the F-symbols of the H3 fusion category, which is Morita equivalent to the even parts of the Haagerup subfactor. This solution has been computed by solving the pentagon equations and using several properties of trivalent categories.

math.CT↗

Efficient Learning for Deep Quantum Neural Networks

Neural networks enjoy widespread success in both research and industry and, with the imminent advent of quantum technology, it is now a crucial challenge to design quantum neural networks for fully quantum learning tasks. Here we propose the use of quantum neurons as a building block for quantum feed-forward neural networks capable of universal quantum computation. We describe the efficient training of these networks using the fidelity as a cost function and provide both classical and efficient quantum implementations. Our method allows for fast optimisation with reduced memory requirements: the number of qudits required scales with only the width, allowing the optimisation of deep networks. We benchmark our proposal for the quantum task of learning an unknown unitary and find remarkable generalisation behaviour and a striking robustness to noisy training data.

quant-ph↗

Continuum Limits of Quantum Lattice Systems

We describe a general procedure to give effective continuous descriptions of quantum lattice systems in terms of quantum fields. There are two key novelties of our method: firstly, it is framed in the hamiltonian setting and applies equally to distinguishable quantum spins, bosons, and fermions and, secondly, it works for arbitrary variational tensor network states and can easily produce computable non-gaussian quantum field states. Our construction extends the mean-field fluctuation formalism of Hepp and Lieb (developed later by Verbeure and coworkers) to identify emergent continuous large-scale degrees of freedom - the continuous degrees of freedom are not identified beforehand. We apply the construction to to tensor network states, including, matrix product states and projected entangled-pair states, where we recover their recently introduced continuous counterparts, and also for tree tensor networks and the multi-scale entanglement renormalisation ansatz. Finally, extending the continuum limit to include dynamics we obtain a strict light cone for the propagation of information.

quant-ph↗

From categories to anyons: a travelogue

In this paper we provide an overview of category theory, focussing on applications in physics. The route we follow is motivated by the final goal of understanding anyons and topological QFTs using category theory. This entails introducing modular tensor categories and fusion rings. Rather than providing an in-depth mathematical development we concentrate instead on presenting the "highlights for a physicist".

quant-ph↗

Stochastic Integral Representation for the Dynamics of Disordered Systems

The dynamics of interacting quantum systems in the presence of disorder is studied and an exact representation for disorder-averaged quantities via Ito stochastic calculus is obtained. The stochastic integral representation affords many advantages, including amenability to analytic approximation, applicability to interacting systems, and compatibility with existing tensor network methods. The integral may be expanded to produce a series of approximations, the first of which already includes all diffusive corrections and, further, is manifestly completely positive. The addition of fluctuations leads to a convergent series of systematic corrections. As examples, expressions for the density of states, spectral form factor, and out-of-time-order correlators for the Anderson model are obtained.

quant-ph↗

Perfect tangles

We introduce perfect tangles for modular tensor categories. These are intended to generalise the perfect tensors first introduced in the context of a toy model for the AdS/CFT correspondence. We construct perfect tangles for several categories of relevance for topological quantum computation, including the Temperley-Lieb, Fibonacci, Kuperberg spider, and Haagerup planar algebras. A general inductive construction proposed by Vaughan Jones for perfect tangles is also described.

quant-ph↗