arXiv subjects

Michael Walter

Publications and source records attributed to Michael Walter.

At least 73 records · Page 4Linked to original sources

arXiv2022

A converse to Lieb-Robinson bounds in one dimension using index theory

Unitary dynamics with a strict causal cone (or "light cone") have been studied extensively, under the name of quantum cellular automata (QCAs). In particular, QCAs in one dimension have been completely classified by an index theory. Physical systems often exhibit only approximate causal cones; Hamiltonian evolutions on the lattice satisfy Lieb-Robinson bounds rather than strict locality. This motivates us to study approximately locality preserving unitaries (ALPUs). We show that the index theory is robust and completely extends to one-dimensional ALPUs. As a consequence, we achieve a converse to the Lieb-Robinson bounds: any ALPU of index zero can be exactly generated by some time-dependent, quasi-local Hamiltonian in constant time. For the special case of finite chains with open boundaries, any unitary satisfying the Lieb-Robinson bound may be generated by such a Hamiltonian. We also discuss some results on the stability of operator algebras which may be of independent interest.

quant-ph↗

arXiv2022

Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates

We propose a method to reliably and efficiently extract the fidelity of many-qubit quantum circuits composed of continuously parametrized two-qubit gates called matchgates. This method, which we call matchgate benchmarking, relies on advanced techniques from randomized benchmarking as well as insights from the representation theory of matchgate circuits. We argue the formal correctness and scalability of the protocol, and moreover deploy it to estimate the performance of matchgate circuits generated by two-qubit XY spin interactions on a quantum processor.

quant-ph↗

arXiv2022

Excitation dynamics in polyacene molecules on rare-gas clusters

Laser-induced fluorescence spectra and excitation lifetimes of anthracene, tetracene, and pentacene molecules attached to the surface of solid argon clusters have been measured with respect to cluster size, density of molecules and excitation density. Results are compared to previous studies on the same sample molecules attached to neon clusters. A contrasting lifetime behavior of anthracene on neon and argon clusters is discussed, and mechanisms are suggested to interpret the results. Although both neon and argon clusters are considered to be weakly interacting environments, we find that the excitation decay dynamics of the studied acenes depends significantly on the cluster material. Moreover, we find even qualitative differences regarding the dependence on the dopant density. Based on these observations, previous assignments of collective radiative and non-radiative decay mechanisms are discussed in the context of the new experimental findings.

physics.chem-ph↗

arXiv2021

Quantum circuit approximations and entanglement renormalization for the Dirac field in 1+1 dimensions

The multiscale entanglement renormalization ansatz describes quantum many-body states by a hierarchical entanglement structure organized by length scale. Numerically, it has been demonstrated to capture critical lattice models and the data of the corresponding conformal field theories with high accuracy. However, a rigorous understanding of its success and precise relation to the continuum is still lacking. To address this challenge, we provide an explicit construction of entanglement-renormalization quantum circuits that rigorously approximate correlation functions of the massless Dirac conformal field theory. We directly target the continuum theory: discreteness is introduced by our choice of how to probe the system, not by any underlying short-distance lattice regulator. To achieve this, we use multiresolution analysis from wavelet theory to obtain an approximation scheme and to implement entanglement renormalization in a natural way. This could be a starting point for constructing quantum circuit approximations for more general conformal field theories.

quant-ph↗

arXiv2021

Hypergraph min-cuts from quantum entropies

The min-cut function of weighted hypergraphs and the von Neumann entropy of pure quantum states are both symmetric submodular functions. In this note, we explain this coincidence by proving that the min-cut function of any weighted hypergraph can be approximated (up to an overall rescaling) by the entropies of quantum states known as stabilizer states. This implies that the min-cuts of hypergraphs are constrained by quantum entropy inequalities, and it shows that the recently defined hypergraph cones are contained in the quantum stabilizer entropy cones, as has been conjectured in the recent literature.

quant-ph↗

arXiv2021

Towards a theory of non-commutative optimization: geodesic first and second order methods for moment maps and polytopes

This paper initiates a systematic development of a theory of non-commutative optimization. It aims to unify and generalize a growing body of work from the past few years which developed and analyzed algorithms for natural geodesically convex optimization problems on Riemannian manifolds that arise from the symmetries of non-commutative groups. These algorithms minimize the moment map (a non-commutative notion of the usual gradient) and test membership in null cones and moment polytopes (a vast class of polytopes, typically of exponential vertex and facet complexity, which arise from this a priori non-convex, non-linear setting). This setting captures a diverse set of problems in different areas of computer science, mathematics, and physics. Several of them were solved efficiently for the first time using non-commutative methods; the corresponding algorithms also lead to solutions of purely structural problems and to many new connections between disparate fields. In the spirit of standard convex optimization, we develop two general methods in the geodesic setting, a first order and a second order method, which respectively receive first and second order information on the "derivatives" of the function to be optimized. These in particular subsume all past results. The main technical work goes into identifying the key parameters of the underlying group actions which control convergence to the optimum in each of these methods. These non-commutative analogues of "smoothness" are far more complex and require significant algebraic and analytic machinery. Despite this complexity, the way in which these parameters control convergence in both methods is quite simple and elegant. We show how to bound these parameters and hence obtain efficient algorithms for null cone membership in several concrete situations. Our work points to intriguing open problems and suggests further research directions.

math.OC↗

arXiv2021

Bosonic entanglement renormalization circuits from wavelet theory

Entanglement renormalization is a unitary real-space renormalization scheme. The corresponding quantum circuits or tensor networks are known as MERA, and they are particularly well-suited to describing quantum systems at criticality. In this work we show how to construct Gaussian bosonic quantum circuits that implement entanglement renormalization for ground states of arbitrary free bosonic chains. The construction is based on wavelet theory, and the dispersion relation of the Hamiltonian is translated into a filter design problem. We give a general algorithm that approximately solves this design problem and provide an approximation theory that relates the properties of the filters to the accuracy of the corresponding quantum circuits. Finally, we explain how the continuum limit (a free bosonic quantum field) emerges naturally from the wavelet construction.

quant-ph↗

arXiv2021

Holographic entanglement negativity and replica symmetry breaking

Since the work of Ryu and Takayanagi, deep connections between quantum entanglement and spacetime geometry have been revealed. The negative eigenvalues of the partial transpose of a bipartite density operator is a useful diagnostic of entanglement. In this paper, we discuss the properties of the associated entanglement negativity and its Rényi generalizations in holographic duality. We first review the definition of the Rényi negativities, which contain the familiar logarithmic negativity as a special case. We then study these quantities in the random tensor network model and rigorously derive their large bond dimension asymptotics. Finally, we study entanglement negativity in holographic theories with a gravity dual, where we find that Rényi negativities are often dominated by bulk solutions that break the replica symmetry. From these replica symmetry breaking solutions, we derive general expressions for Rényi negativities and their special limits including the logarithmic negativity. In fixed-area states, these general expressions simplify dramatically and agree precisely with our results in the random tensor network model. This provides a concrete setting for further studying the implications of replica symmetry breaking in holography.

hep-th↗

arXiv2021

Developing an Underwater Network of Ocean Observation Systems with Digital Twin Prototypes -- A Field Report from the Baltic Sea

During the research cruise AL547 with RV ALKOR (October 20-31, 2020), a collaborative underwater network of ocean observation systems was deployed in Boknis Eck (SW Baltic Sea, German exclusive economic zone (EEZ)) in the context of the project ARCHES (Autonomous Robotic Networks to Help Modern Societies). This network was realized via a Digital Twin Prototype approach. During that period different scenarios were executed to demonstrate the feasibility of Digital Twins in an extreme environment such as underwater. One of the scenarios showed the collaboration of stage IV Digital Twins with their physical counterparts on the seafloor. This way, we address the research question, whether Digital Twins represent a feasible approach to operate mobile ad hoc networks for ocean and coastal observation.

cs.SE↗

arXiv2021

Polynomial time algorithms in invariant theory for torus actions

An action of a group on a vector space partitions the latter into a set of orbits. We consider three natural and useful algorithmic "isomorphism" or "classification" problems, namely, orbit equality, orbit closure intersection, and orbit closure containment. These capture and relate to a variety of problems within mathematics, physics and computer science, optimization and statistics. These orbit problems extend the more basic null cone problem, whose algorithmic complexity has seen significant progress in recent years. In this paper, we initiate a study of these problems by focusing on the actions of commutative groups (namely, tori). We explain how this setting is motivated from questions in algebraic complexity, and is still rich enough to capture interesting combinatorial algorithmic problems. While the structural theory of commutative actions is well understood, no general efficient algorithms were known for the aforementioned problems. Our main results are polynomial time algorithms for all three problems. We also show how to efficiently find separating invariants for orbits, and how to compute systems of generating rational invariants for these actions (in contrast, for polynomial invariants the latter is known to be hard). Our techniques are based on a combination of fundamental results in invariant theory, linear programming, and algorithmic lattice theory.

cs.DS↗

arXiv2021

Effective screening of medium-assisted Van der Waals interactions between embedded particles

The effect of an implicit medium on dispersive interactions of particle pairs is discussed and simple expressions for the correction relative to vacuum are derived. We show that a single point Gauss quadrature leads to the intuitive result that the vacuum van der Waals $C_6$ coefficient is screened by the permittivity squared of the environment evaluated near to the resonance frequencies of the interacting particles. This approximation should be particularly relevant if the medium is transparent at these frequencies. In the manuscript, we provide simple models and sets of parameters for commonly used solvents, atoms and small molecules.

cond-mat.mes-hall↗

arXiv2021

Quantum Gravity in the Lab: Teleportation by Size and Traversable Wormholes

With the long-term goal of studying models of quantum gravity in the lab, we propose holographic teleportation protocols that can be readily executed in table-top experiments. These protocols exhibit similar behavior to that seen in the recent traversable wormhole constructions of [1,2]: information that is scrambled into one half of an entangled system will, following a weak coupling between the two halves, unscramble into the other half. We introduce the concept of teleportation by size to capture how the physics of operator-size growth naturally leads to information transmission. The transmission of a signal through a semi-classical holographic wormhole corresponds to a rather special property of the operator-size distribution we call size winding. For more general systems (which may not have a clean emergent geometry), we argue that imperfect size winding is a generalization of the traversable wormhole phenomenon. In addition, a form of signalling continues to function at high temperature and at large times for generic chaotic systems, even though it does not correspond to a signal going through a geometrical wormhole, but rather to an interference effect involving macroscopically different emergent geometries. Finally, we outline implementations feasible with current technology in two experimental platforms: Rydberg atom arrays and trapped ions.

quant-ph↗

arXiv2021

Quantum Gravity in the Lab: Teleportation by Size and Traversable Wormholes, Part II

In [1] we discussed how quantum gravity may be simulated using quantum devices and gave a specific proposal -- teleportation by size and the phenomenon of size-winding. Here we elaborate on what it means to do 'Quantum Gravity in the Lab' and how size-winding connects to bulk gravitational physics and traversable wormholes. Perfect size-winding is a remarkable, fine-grained property of the size wavefunction of an operator; we show from a bulk calculation that this property must hold for quantum systems with a nearly-AdS_2 bulk. We then examine in detail teleportation by size in three systems: the Sachdev-Ye-Kitaev model, random matrices, and spin chains, and discuss prospects for realizing these phenomena in near-term quantum devices.

quant-ph↗

arXiv2021

Schur-Weyl Duality for the Clifford Group with Applications: Property Testing, a Robust Hudson Theorem, and de Finetti Representations

Schur-Weyl duality is a ubiquitous tool in quantum information. At its heart is the statement that the space of operators that commute with the tensor powers of all unitaries is spanned by the permutations of the tensor factors. In this work, we describe a similar duality theory for tensor powers of Clifford unitaries. The Clifford group is a central object in many subfields of quantum information, most prominently in the theory of fault-tolerance. The duality theory has a simple and clean description in terms of finite geometries. We demonstrate its effectiveness in several applications: (1) We resolve an open problem in quantum property testing by showing that "stabilizerness" is efficiently testable: There is a protocol that, given access to six copies of an unknown state, can determine whether it is a stabilizer state, or whether it is far away from the set of stabilizer states. We give a related membership test for the Clifford group. (2) We find that tensor powers of stabilizer states have an increased symmetry group. We provide corresponding de Finetti theorems, showing that the reductions of arbitrary states with this symmetry are well-approximated by mixtures of stabilizer tensor powers (in some cases, exponentially well). (3) We show that the distance of a pure state to the set of stabilizers can be lower-bounded in terms of the sum-negativity of its Wigner function. This gives a new quantitative meaning to the sum-negativity (and the related mana) -- a measure relevant to fault-tolerant quantum computation. The result constitutes a robust generalization of the discrete Hudson theorem. (4) We show that complex projective designs of arbitrary order can be obtained from a finite number (independent of the number of qudits) of Clifford orbits. To prove this result, we give explicit formulas for arbitrary moments of random stabilizer states.

quant-ph↗

arXiv2021

Multipartite Entanglement in Stabilizer Tensor Networks

Despite the fundamental importance of quantum entanglement in many-body systems, our understanding is mostly limited to bipartite situations. Indeed, even defining appropriate notions of multipartite entanglement is a significant challenge for general quantum systems. In this work, we initiate the study of multipartite entanglement in a rich, yet tractable class of quantum states called stabilizer tensor networks. We demonstrate that, for generic stabilizer tensor networks, the geometry of the tensor network informs the multipartite entanglement structure of the state. In particular, we show that the average number of Greenberger-Horne-Zeilinger (GHZ) triples that can be extracted from a stabilizer tensor network is small, implying that tripartite entanglement is scarce. This, in turn, restricts the higher-partite entanglement structure of the states. Recent research in quantum gravity found that stabilizer tensor networks reproduce important structural features of the AdS/CFT correspondence, including the Ryu-Takayanagi formula for the entanglement entropy and certain quantum error correction properties. Our results imply a new operational interpretation of the monogamy of the Ryu-Takayanagi mutual information and an entropic diagnostic for higher-partite entanglement. Our technical contributions include a spin model for evaluating the average GHZ content of stabilizer tensor networks, as well as a novel formula for the third moment of random stabilizer states, which we expect to find further applications in quantum information.

quant-ph↗

arXiv2020

Quantum algorithms for matrix scaling and matrix balancing

Matrix scaling and matrix balancing are two basic linear-algebraic problems with a wide variety of applications, such as approximating the permanent, and pre-conditioning linear systems to make them more numerically stable. We study the power and limitations of quantum algorithms for these problems. We provide quantum implementations of two classical (in both senses of the word) methods: Sinkhorn's algorithm for matrix scaling and Osborne's algorithm for matrix balancing. Using amplitude estimation as our main tool, our quantum implementations both run in time $\tilde O(\sqrt{mn}/\varepsilon^4)$ for scaling or balancing an $n \times n$ matrix (given by an oracle) with $m$ non-zero entries to within $\ell_1$-error $\varepsilon$. Their classical analogs use time $\tilde O(m/\varepsilon^2)$, and every classical algorithm for scaling or balancing with small constant $\varepsilon$ requires $Ω(m)$ queries to the entries of the input matrix. We thus achieve a polynomial speed-up in terms of $n$, at the expense of a worse polynomial dependence on the obtained $\ell_1$-error $\varepsilon$. We emphasize that even for constant $\varepsilon$ these problems are already non-trivial (and relevant in applications). Along the way, we extend the classical analysis of Sinkhorn's and Osborne's algorithm to allow for errors in the computation of marginals. We also adapt an improved analysis of Sinkhorn's algorithm for entrywise-positive matrices to the $\ell_1$-setting, leading to an $\tilde O(n^{1.5}/\varepsilon^3)$-time quantum algorithm for $\varepsilon$-$\ell_1$-scaling in this case. We also prove a lower bound, showing that our quantum algorithm for matrix scaling is essentially optimal for constant $\varepsilon$: every quantum algorithm for matrix scaling that achieves a constant $\ell_1$-error with respect to uniform marginals needs to make at least $Ω(\sqrt{mn})$ queries.

quant-ph↗

arXiv2020

Maximum likelihood estimation for tensor normal models via castling transforms

In this paper, we study sample size thresholds for maximum likelihood estimation for tensor normal models. Given the model parameters and the number of samples, we determine whether, almost surely, (1) the likelihood function is bounded from above, (2) maximum likelihood estimates (MLEs) exist, and (3) MLEs exist uniquely. We obtain a complete answer for both real and complex models. One consequence of our results is that almost sure boundedness of the log-likelihood function guarantees almost sure existence of an MLE. Our techniques are based on invariant theory and castling transforms.

math.ST↗

arXiv2020

Macroscopic Quantum Electrodynamics and Density Functional Theory Approaches to Dispersion Interactions between Fullerenes

The processing and material properties of commercial organic semiconductors, for e.g. fullerenes is largely controlled by their precise arrangements, specially intermolecular symmetries, distances and orientations, more specifically, molecular polarisabilities. These supramolecular parameters heavily influence their electronic structure, thereby determining molecular photophysics and therefore dictating their usability as n-type semiconductors. In this article we evaluate van der Waals potentials of a fullerene dimer model system using two approaches: a) Density Functional Theory and, b) Macroscopic Quantum Electrodynamics, which is particularly suited for describing long-range van der Waals interactions. Essentially, we determine and explain the model symmetry, distance and rotational dependencies on binding energies and spectral changes. The resultant spectral tuning is compared using both methods showing correspondence within the constraints placed by the different model assumptions. We envision that the application of macroscopic methods and structure/property relationships laid forward in this article will find use in fundamental supramolecular electronics.

cond-mat.mes-hall↗