arXiv subjects

Mark W. Johnson

Publications and source records attributed to Mark W. Johnson.

15 recordsLinked to original sources

arXiv2024

Beyond-classical computation in quantum simulation

Quantum computers hold the promise of solving certain problems that lie beyond the reach of conventional computers. However, establishing this capability, especially for impactful and meaningful problems, remains a central challenge. Here, we show that superconducting quantum annealing processors can rapidly generate samples in close agreement with solutions of the Schr\"odinger equation. We demonstrate area-law scaling of entanglement in the model quench dynamics of two-, three-, and infinite-dimensional spin glasses, supporting the observed stretched-exponential scaling of effort for matrix-product-state approaches. We show that several leading approximate methods based on tensor networks and neural networks cannot achieve the same accuracy as the quantum annealer within a reasonable time frame. Thus, quantum annealers can answer questions of practical importance that may remain out of reach for classical computation.

quant-ph↗

arXiv2023

Quantum error mitigation in quantum annealing

Quantum Error Mitigation (QEM) presents a promising near-term approach to reduce error when estimating expectation values in quantum computing. Here, we introduce QEM techniques tailored for quantum annealing, using Zero-Noise Extrapolation (ZNE). We implement ZNE through zero-temperature extrapolation as well as energy-time rescaling. We conduct experimental investigations into the quantum critical dynamics of a transverse-field Ising spin chain, demonstrating the successful mitigation of thermal noise through both of these techniques. Moreover, we show that energy-time rescaling effectively mitigates control errors in the coherent regime where the effect of thermal noise is minimal. Our ZNE results agree with exact calculations of the coherent evolution over a range of annealing times that exceeds the coherent annealing range by almost an order of magnitude.

quant-ph↗

arXiv2021

Architectural considerations in the design of a third-generation superconducting quantum annealing processor

Early generations of superconducting quantum annealing processors have provided a valuable platform for studying the performance of a scalable quantum computing technology. These studies have directly informed our approach to the design of the next-generation processor. Our design priorities for this generation include an increase in per-qubit connectivity, a problem Hamiltonian energy scale similar to previous generations, reduced Hamiltonian specification errors, and an increase in the processor scale that also leaves programming and readout times fixed or reduced. Here we discuss the specific innovations that resulted in a processor architecture that satisfies these design priorities.

quant-ph↗

arXiv2020

Higher homotopy invariants for spaces and maps

For a pointed topological space $X$, we use an inductive construction of a simplicial resolution of $X$ by wedges of spheres to construct a "higher homotopy structure" for $X$ (in terms of chain complexes of spaces). This structure is then used to define a collection of higher homotopy invariants which suffice to recover $X$ up to weak equivalence. It can also be used to distinguish between different maps $f$ from $X$ to $Y$ which induce the same morphism on homotopy groups $f_*$ from $π_* X$ to $π_* Y$.

math.AT↗

arXiv2019

Scaling advantage in quantum simulation of geometrically frustrated magnets

The promise of quantum computing lies in harnessing programmable quantum devices for practical applications such as efficient simulation of quantum materials and condensed matter systems. One important task is the simulation of geometrically frustrated magnets in which topological phenomena can emerge from competition between quantum and thermal fluctuations. Here we report on experimental observations of relaxation in such simulations, measured on up to 1440 qubits with microsecond resolution. By initializing the system in a state with topological obstruction, we observe quantum annealing (QA) relaxation timescales in excess of one microsecond. Measurements indicate a dynamical advantage in the quantum simulation over the classical approach of path-integral Monte Carlo (PIMC) fixed-Hamiltonian relaxation with multiqubit cluster updates. The advantage increases with both system size and inverse temperature, exceeding a million-fold speedup over a CPU. This is an important piece of experimental evidence that in general, PIMC does not mimic QA dynamics for stoquastic Hamiltonians. The observed scaling advantage, for simulation of frustrated magnetism in quantum condensed matter, demonstrates that near-term quantum devices can be used to accelerate computational tasks of practical relevance.

quant-ph↗

arXiv2018

A constructive approach to higher homotopy operations

In this paper we provide an explicit general construction of higher homotopy operations in model categories, which include classical examples such as (long) Toda brackets and (iterated) Massey products, but also cover unpointed operations not usually considered in this context. We show how such operations, thought of as obstructions to rectifying a homotopy-commutative diagram, can be defined in terms of a double induction, yielding intermediate obstructions as well.

math.AT↗

arXiv2018

Toward a Calculus of Redundancy: The feedback arrow of expectations in knowledge-based systems

This paper considers the relationships among meaning generation, selection, and the dynamics of discourse from a variety of perspectives ranging from information theory and biology to sociology. Following Husserl's idea of a horizon of meaning in intersubjective communication, we propose a way in which, using Shannon's equations, the generation and selection of meanings from a horizon of possibilities can be considered probabilistically. The information-theoretical dynamics we articulate considers a process of meaning generation within cultural evolution: information is imbued with meaning, and through this process, the number of options for the selection of meaning in discourse proliferates. The redundancy of possible meanings contributes to a codification of expectations within the discourse. Unlike hard-wired DNA, the codes of non-biological systems can co-evolve with the variations. Spanning horizons of meaning, the codes structure the communications as selection environments that shape discourses. Discursive knowledge can be considered as meta-coded communication which enables us to translate among differently coded communications. The dynamics of discursive knowledge production can thus infuse the historical dynamics with a cultural evolution by adding options, that is, by increasing redundancy. A calculus of redundancy is presented as an indicator whereby these dynamics of discourse and meaning may be explored empirically.

cs.DL↗

arXiv2012

A Near-Term Quantum Computing Approach for Hard Computational Problems in Space Exploration

In this article, we show how to map a sampling of the hardest artificial intelligence problems in space exploration onto equivalent Ising models that then can be attacked using quantum annealing implemented in D-Wave machine. We overview the existing results as well as propose new Ising model implementations for quantum annealing. We review supervised and unsupervised learning algorithms for classification and clustering with applications to feature identification and anomaly detection. We introduce algorithms for data fusion and image matching for remote sensing applications. We overview planning problems for space exploration mission applications and algorithms for diagnostics and recovery with applications to deep space missions. We describe combinatorial optimization algorithms for task assignment in the context of autonomous unmanned exploration. Finally, we discuss the ways to circumvent the limitation of the Ising mapping using a "blackbox" approach based on ideas from probabilistic computing. In this article we describe the architecture of the D-Wave One machine and report its benchmarks. Results on random ensemble of problems in the range of up to 96 qubits show improved scaling for median core quantum annealing time compared with classical algorithms; whether this scaling persists for larger problem sizes is an open question. We also review previous results of D-Wave One benchmarking studies for solving binary classification problems with a quantum boosting algorithm which is shown to outperform AdaBoost. We review quantum algorithms for structured learning for multi-label classification and introduce a hybrid classical/quantum approach for learning the weights. Results of D-Wave One benchmarking studies for learning structured labels on four different data sets show a better performance compared with an independent Support Vector Machine approach with linear kernel.

quant-ph↗

arXiv2011

Higher homotopy operations and André-Quillen cohomology

There are two main approaches to the problem of realizing a $Π$-algebra (a graded group $Λ$ equipped with an action of the primary homotopy operations) as the homotopy groups of a space $X$. Both involve trying to realize an algebraic free simplicial resolution $G_\bullet$ of $Λ$ by a simplicial space $W_\bullet$ and proceed by induction on the simplicial dimension. The first provides a sequence of André-Quillen cohomology classes in $H_{AQ}^{n+2}(Λ;Ω^{n}Λ)$ for $n \geq 1$ as obstructions to the existence of successive Postnikov sections for $W_\bullet$ by work of Dwyer, Kan and Stover. The second gives a sequence of geometrically defined higher homotopy operations as the obstructions by earlier work of Blanc; these were identified with the obstruction theory of Dwyer, Kan and Smith in earlier work of the current authors. There are also (algebraic and geometric) obstructions for distinguishing between different realizations of $Λ$. In this paper we 1) provide an explicit construction of the cocycles representing the cohomology obstructions; 2) provide a similar explicit construction of certain minimal values of the higher homotopy operations (which reduce to "long Toda brackets"), and 3) show that these two constructions correspond under an evident map.

math.AT↗

arXiv2010

On modified Reedy and modified projective model structures

Variations on the notions of Reedy model structures and projective model structures on categories of diagrams in a model category are introduced. These allow one to choose only a subset of the entries when defining weak equivalences, or to use different model categories at different entries of the diagrams. As a result, a bisimplicial model category that can be used to recover the algebraic K-theory for any Waldhausen subcategory of a model category is produced.

math.AT↗

arXiv2009

On homotopy invariance for algebras over colored PROPs

Over a monoidal model category, under some mild assumptions, we equip the categories of colored PROPs and their algebras with projective model category structures. A Boardman-Vogt style homotopy invariance result about algebras over cofibrant colored PROPs is proved. As an example, we define homotopy topological conformal field theories and observe that such structures are homotopy invariant.

math.AT↗

arXiv2009

Higher homotopy operations and cohomology

We explain how higher homotopy operations, defined topologically, may be identified under mild assumptions with (the last of) the Dwyer-Kan-Smith cohomological obstructions to rectifying homotopy-commutative diagrams.

math.AT↗

arXiv2009

Factoring the Becker-Gottlieb Transfer Through the Trace Map

We verify the Becker-Shultz axioms characterizing the Becker-Gottlieb transfer $τ$ for the composite of the algebraic K-theory transfer of any perfect fibration followed by the trace map. As a consequence, for any compact ANR fibration (those considered by Becker-Shultz), $τ$ is homotopy equivalent to the composite of the algebraic K-theory transfer followed by the trace map. Furthermore, if these same axioms (including strong additivity) could be shown to extend to characterizing $τ$ for arbitrary perfect fibrations, our homotopy equivalence extends to the case of arbitrary perfect fibrations as well.

math.KT↗

arXiv2008

On local-to-global spectral sequences for the cohomology of diagrams

The aim of this paper is to construct and examine three candidates for local-to-global spectral sequences for the cohomology of diagrams of algebras with directed indexing. In each case, the $E^2$ -terms can be viewed as a type of local cohomology relative to a map or an object in the diagram.

math.AT↗

arXiv2007

Realizing Kasparov's KK-theory groups as the homotopy classes of maps of a Quillen model category

In this article we build a Quillen model category structure on the category of sequentially complete l.m.c.-C*-algebras such that the corresponding homotopy classes of maps Ho(A,B) for separable C*-algebras A and B coincide with the Kasparov groups KK(A,B). This answers an open question posed by Mark Hovey about the possibility of describing KK-theory for C*-algebras using the language of Quillen model categories.

math.KT↗