Searcharxiv⌕ Search

arXiv subjects

Graeme Smith

Publications and source records attributed to Graeme Smith.

At least 55 records · Page 3Linked to original sources
arXiv2021

Linear embedding of nonlinear dynamical systems and prospects for efficient quantum algorithms

The simulation of large nonlinear dynamical systems, including systems generated by discretization of hyperbolic partial differential equations, can be computationally demanding. Such systems are important in both fluid and kinetic computational plasma physics. This motivates exploring whether a future error-corrected quantum computer could perform these simulations more efficiently than any classical computer. We describe a method for mapping any finite nonlinear dynamical system to an infinite linear dynamical system (embedding) and detail three specific cases of this method that correspond to previously-studied mappings. Then we explore an approach for approximating the resulting infinite linear system with finite linear systems (truncation). Using a number of qubits only logarithmic in the number of variables of the nonlinear system, a quantum computer could simulate truncated systems to approximate output quantities if the nonlinearity is sufficiently weak. Other aspects of the computational efficiency of the three detailed embedding strategies are also discussed.

physics.plasm-ph↗
arXiv2021

Better transmission with lower capacity: lossy compression over quantum channels

Shannon's channel coding theorem describes the maximum possible rate of reliable information transfer through a classical noisy communication channel. It, together with the source coding theorem, characterizes lossless channel communication in the classical regime. Lossy compression scenarios require the additional description provided by rate-distortion theory, which characterizes the trade-off between compression rate and the distortion of the compressed signal. Even in this context, the capacity characterizes the usefulness of a channel -- a channel with more capacity will always outperform a channel with less capacity. We show that this is no longer true when sending classical information over a quantum channel. In particular, we find a pair of quantum channels where the channel with the lower capacity causes less distortion than the higher capacity channel when both are used at a fixed rate.

quant-ph↗
arXiv2021

Entropy transfer from a quantum particle to a classical coherent light field

In the field of light-matter interactions, it is often assumed that a classical light field that interacts with a quantum particle remains almost unchanged and thus contains nearly no information about the manipulated particles. To investigate the validity of this assumption, we develop and theoretically analyze a simple Gedankenexperiment which involves the interaction of a coherent state with a quantum particle in an optical cavity. We quantify the resulting alteration of the light field by measuring the fidelity of its initial and equilibrium states. Using Bayesian inference, we demonstrate the information transfer through photon measurements. In addition, we employ the concepts of quantum entropy and mutual information to quantify the entropy transfer from the particle to the light field. In the weak coupling limit, we validate the usually assumed negligible alteration of the light field and entropy transfer. In the strong coupling limit, however, we observe that the information of the initial particle state can be fully encoded in the light field, even for large photon numbers. Nevertheless, we show that spontaneous emission is a sufficient mechanism for removing the entropy initially stored in the particle. Our analysis provides a deeper understanding of the entropy exchange between quantum matter and classical light.

quant-ph↗
arXiv2021

Efficient and Low-Backaction Quantum Measurement Using a Chip-Scale Detector

Superconducting qubits are a leading platform for scalable quantum computing and quantum error correction. One feature of this platform is the ability to perform projective measurements orders of magnitude more quickly than qubit decoherence times. Such measurements are enabled by the use of quantum-limited parametric amplifiers in conjunction with ferrite circulators - magnetic devices which provide isolation from noise and decoherence due to amplifier backaction. Because these non-reciprocal elements have limited performance and are not easily integrated on-chip, it has been a longstanding goal to replace them with a scalable alternative. Here, we demonstrate a solution to this problem by using a superconducting switch to control the coupling between a qubit and amplifier. Doing so, we measure a transmon qubit using a single, chip-scale device to provide both parametric amplification and isolation from the bulk of amplifier backaction. This measurement is also fast, high fidelity, and has 70% efficiency, comparable to the best that has been reported in any superconducting qubit measurement. As such, this work constitutes a high-quality platform for the scalable measurement of superconducting qubits.

quant-ph↗
arXiv2020

Multipartite Optimized Correlation Measures and Holography

We explore ways to quantify multipartite correlations, in quantum information and in holography. We focus on optimized correlation measures, linear combinations of entropies minimized over all possible purifications of a state that satisfy monotonicity conditions. These contain far more information about correlations than entanglement entropy alone. We present a procedure to derive such quantities, and construct a menagerie of symmetric optimized correlation measures on three parties. These include tripartite generalizations of the entanglement of purification, the squashed entanglement, and the recently introduced Q-correlation and R-correlation. Some correlation measures vanish only on product states, and thus quantify both classical and quantum correlations; others vanish on any separable state, capturing quantum correlations alone. We then use a procedure motivated by the surface-state correspondence to construct holographic duals for the correlation measures as linear combinations of bulk surfaces. The geometry of the surfaces can preserve, partially break, or fully break the symmetry of the correlation measure. The optimal purification is encoded in the locations of certain points, whose locations are fixed by constraints on the areas of combinations of surfaces. This gives a new concrete connection between information theoretic quantities evaluated on a boundary state and detailed geometric properties of its dual.

hep-th↗
arXiv2020

Playing Games with Multiple Access Channels

Communication networks have multiple users, each sending and receiving messages. A multiple access channel (MAC) models multiple senders transmitting to a single receiver, such as the uplink from many mobile phones to a single base station. The optimal performance of a MAC is quantified by a capacity region of simultaneously achievable communication rates. We study the two-sender classical MAC, the simplest and best-understood network, and find a surprising richness in both a classical and quantum context. First, we find that quantum entanglement shared between senders can substantially boost the capacity of a classical MAC. Second, we find that optimal performance of a MAC with bounded-size inputs may require unbounded amounts of entanglement. Third, determining whether a perfect communication rate is achievable using finite-dimensional entanglement is undecidable. Finally, we show that evaluating the capacity region of a two-sender classical MAC is in fact NP-hard.

quant-ph↗
arXiv2020

Optimized Measures of Bipartite Quantum Correlation

How can we characterize different types of correlation between quantum systems? Since correlations cannot be generated locally, we take any real function of a multipartite state which cannot increase under local operations to measure a correlation. Correlation measures that can be expressed as an optimization of a linear combination of entropies are particularly useful, since they can often be interpreted operationally. We systematically study such optimized linear entropic functions, and by enforcing monotonicity under local processing we identify four cones of correlation measures for bipartite quantum states. This yields two new optimized measures of bipartite quantum correlation that are particularly simple, which have the additional property of being additive.

quant-ph↗
arXiv2020

Monotonicity Under Local Operations: Linear Entropic Formulas

All correlation measures, classical and quantum, must be monotonic under local operations. In this paper, we characterize monotonic formulas that are linear combinations of the von Neumann entropies associated with the quantum state of a physical system that has n parts. We show that these formulas form a polyhedral convex cone, which we call the monotonicity cone, and enumerate its facets. We illustrate its structure and prove that it is equivalent to the cone of monotonic formulas implied by strong subadditivity. We explicitly compute its extremal rays for n up to 5. We also consider the symmetric monotonicity cone, in which the formulas are required to be invariant under subsystem permutations. We describe this cone fully for all n. In addition, we show that these results hold even when states and operations are constrained to be classical.

quant-ph↗
arXiv2019

Quantum Algorithm for the Vlasov Equation

The Vlasov-Maxwell system of equations, which describes classical plasma physics, is extremely challenging to solve, even by numerical simulation on powerful computers. By linearizing and assuming a Maxwellian background distribution function, we convert the Vlasov-Maxwell system into a Hamiltonian simulation problem. Then for the limiting case of electrostatic Landau damping, we design and verify a quantum algorithm, appropriate for a future error-corrected universal quantum computer. While the classical simulation has costs that scale as $\mathcal{O}(N_v t)$ for a velocity grid with $N_v$ grid points and simulation time $t$, our quantum algorithm scales as $\mathcal{O}(\text{polylog}(N_v) t/δ)$ where $δ$ is the measurement error, and weaker scalings have been dropped. Extensions, including electromagnetics and higher dimensions, are discussed. A quantum computer could efficiently handle a high-resolution, six-dimensional phase-space grid, but the $1/δ$ cost factor to extract an accurate result remains a difficulty. This paper provides insight into the possibility of someday achieving efficient plasma simulation on a quantum computer.

quant-ph↗
arXiv2019

Correlation measures and distillable entanglement in AdS/CFT

Recent developments have exposed close connections between quantum information and holography. In this paper, we explore the geometrical interpretations of the recently introduced $Q$-correlation and $R$-correlation, $E_Q$ and $E_R$. We find that $E_Q$ admits a natural geometric interpretation via the surface-state correspondence: it is a minimal mutual information between a surface region $A$ and a cross-section of $A$'s entanglement wedge with $B$. We note a strict trade-off between this minimal mutual information and the symmetric side-channel assisted distillable entanglement from the environment $E$ to $A$, $I^{ss}(E\rangle A)$. We also show that the $R$-correlation, $E_R$, coincides holographically with the entanglement wedge cross-section. This further elucidates the intricate relationship between entanglement, correlations, and geometry in holographic field theories.

hep-th↗
arXiv2019

Asymptotic performance of port-based teleportation

Quantum teleportation is one of the fundamental building blocks of quantum Shannon theory. While ordinary teleportation is simple and efficient, port-based teleportation (PBT) enables applications such as universal programmable quantum processors, instantaneous non-local quantum computation and attacks on position-based quantum cryptography. In this work, we determine the fundamental limit on the performance of PBT: for arbitrary fixed input dimension and a large number $N$ of ports, the error of the optimal protocol is proportional to the inverse square of $N$. We prove this by deriving an achievability bound, obtained by relating the corresponding optimization problem to the lowest Dirichlet eigenvalue of the Laplacian on the ordered simplex. We also give an improved converse bound of matching order in the number of ports. In addition, we determine the leading-order asymptotics of PBT variants defined in terms of maximally entangled resource states. The proofs of these results rely on connecting recently-derived representation-theoretic formulas to random matrix theory. Along the way, we refine a convergence result for the fluctuations of the Schur-Weyl distribution by Johansson, which might be of independent interest.

quant-ph↗
arXiv2019

A sound and complete definition of linearizability on weak memory models

Linearizability is a widely accepted notion of correctness for concurrent objects. Recent research has investigated redefining linearizability for particular hardware weak memory models, in particular for TSO. In this paper, we provide an overview of this research and show that such redefinitions of linearizability are not required: under an interpretation of specification behaviour which abstracts from weak memory effects, the standard definition of linearizability is sound and complete on all hardware weak memory models. We prove our result with respect to a definition of object refinement which takes a weak memory model as a parameter. The main consequence of our findings is that we can leverage the range of existing techniques and tools for standard linearizability when verifying concurrent objects running on hardware weak memory models.

cs.LO↗
arXiv2019

Unitary-projective entanglement dynamics

Starting from a state of low quantum entanglement, local unitary time evolution increases the entanglement of a quantum many-body system. In contrast, local projective measurements disentangle degrees of freedom and decrease entanglement. We study the interplay of these competing tendencies by considering time evolution combining both unitary and projective dynamics. We begin by constructing a toy model of Bell pair dynamics which demonstrates that measurements can keep a system in a state of low (i.e. area law) entanglement, in contrast with the volume law entanglement produced by generic pure unitary time evolution. While the simplest Bell pair model has area law entanglement for any measurement rate, as seen in certain non-interacting systems, we show that more generic models of entanglement can feature an area-to-volume law transition at a critical value of the measurement rate, in agreement with recent numerical investigations. As a concrete example of these ideas, we analytically investigate Clifford evolution in qubit systems which can exhibit an entanglement transition. We are able to identify stabilizer size distributions characterizing the area law, volume law and critical 'fixed points.' We also discuss Floquet random circuits, where the answers depend on the order of limits - one order of limits yields area law entanglement for any non-zero measurement rate, whereas a different order of limits allows for an area law - volume law transition. Finally, we provide a rigorous argument that a system subjected to projective measurements can only exhibit a volume law entanglement entropy if it also features a subleading correction term, which provides a universal signature of projective dynamics in the high-entanglement phase. Note: The results presented here supersede those of all previous versions of this manuscript, which contained some erroneous claims.

cond-mat.stat-mech↗
arXiv2018

Dephrasure channel and superadditivity of coherent information

The quantum capacity of a quantum channel captures its capability for noiseless quantum communication. It lies at the heart of quantum information theory. Unfortunately, our poor understanding of nonadditivity of coherent information makes it hard to understand the quantum capacity of all but very special channels. In this paper, we consider the dephrasure channel, which is the concatenation of a dephasing channel and an erasure channel. This very simple channel displays remarkably rich and exotic properties: we find nonadditivity of coherent information at the two-letter level, a big gap between single-letter coherent and private informations, and positive quantum capacity for all complementary channels. Its clean form simplifies the evaluation of coherent information substantially and, as such, we hope that the dephrasure channel will provide a much-needed laboratory for the testing of new ideas about nonadditivity.

quant-ph↗
arXiv2018

A high-level operational semantics for hardware weak memory models

Modern processors deploy a variety of weak memory models, which for efficiency reasons may execute instructions in an order different to that specified by the program text. The consequences of instruction reordering can be complex and subtle, and can impact on ensuring correctness. In this paper we build on extensive work elucidating the semantics of assembler-level languages on hardware architectures with weak memory models (specifically TSO, ARM and POWER) and lift the principles to a straightforward operational semantics which allows reasoning at a higher level of abstraction. To this end we introduce a wide-spectrum language that encompasses operations on abstract data types as well as low-level assembler code, define its operational semantics using a novel approach to allowing reordering of instructions, and derive some refinement laws that can be used to explain behaviours of real processors. In this framework memory models are mostly distinguished via a pair-wise static ordering on instruction types that determines when later instructions may be reordered before earlier instructions. In addition, memory models may use different types of storage systems. For instance, non-multicopy atomic systems allow sibling processes to see updates to different variables in different orders. We encode the semantics in the rewriting engine Maude as a model-checking tool, and develop confidence in our framework by validating our semantics against existing sets of \textit{litmus tests} -- small assembler programs -- comparing our results with those observed on hardware and in existing semantics. We also use the tool as a prototype to model check implementations of data structures from the literature against their abstract specifications.

cs.LO↗
arXiv2018

Correctness of Concurrent Objects under Weak Memory Models

In this paper we develop a theory for correctness of concurrent objects under weak memory models. Central to our definitions is the concept of observations which determine when effects of operations become visible, and hence determine the semantics of objects, under a given memory model. The resulting notion of correctness, called object refinement, is generic as it is parameterised by the memory model under consideration. Our theory enforces the minimal constraints on the placing of observations and on the semantics of objects that underlie object refinement. Object refinement is suitable as a reference for correctness when proving new proof methods for objects under weak memory models to be sound and complete.

cs.PL↗
arXiv2018

A wide-spectrum language for verification of programs on weak memory models

Modern processors deploy a variety of weak memory models, which for efficiency reasons may (appear to) execute instructions in an order different to that specified by the program text. The consequences of instruction reordering can be complex and subtle, and can impact on ensuring correctness. Previous work on the semantics of weak memory models has focussed on the behaviour of assembler-level programs. In this paper we utilise that work to extract some general principles underlying instruction reordering, and apply those principles to a wide-spectrum language encompassing abstract data types as well as low-level assembler code. The goal is to support reasoning about implementations of data structures for modern processors with respect to an abstract specification. Specifically, we define an operational semantics, from which we derive some properties of program refinement, and encode the semantics in the rewriting engine Maude as a model-checking tool. The tool is used to validate the semantics against the behaviour of a set of litmus tests (small assembler programs) run on hardware, and also to model check implementations of data structures from the literature against their abstract specifications.

cs.PL↗