Related papers: Generating topological order: no speedup by dissip…
Linear computation coding is concerned with the compression of multidimensional linear functions, i.e. with reducing the computational effort of multiplying an arbitrary vector to an arbitrary, but known, constant matrix. This paper…
Recent work argued that the scaling of a dimensionless quantity $Q_D$ with path length is a better proxy for quantifying the scaling of the computational cost of maintaining adiabaticity than the timescale. It also conjectured that…
The preparation of long-range entangled states using unitary circuits is limited by Lieb-Robinson bounds, but circuits with projective measurements and feedback (``adaptive circuits'') can evade such restrictions. We introduce three classes…
Here we show the connection between topological order and the geometric entanglement, as measured by the logarithm of the overlap between a given state and its closest product state of blocks, for the topological universality class of the…
We devise a generic and experimentally accessible recipe to prepare boundary states of topological or nontopological quantum systems through an interplay between coherent Hamiltonian dynamics and local dissipation. Intuitively, our recipe…
We investigate the $U(1)$ checkerboard toric code which corresponds to the $U(1)$-symmetry enriched toric code with two distinct star sublattices. One can therefore tune from the limit of isolated stars to the uniform system. The uniform…
Exploration systems are critical for enhancing the autonomy of robots. Due to the unpredictability of the future planning space, existing methods either adopt an inefficient greedy strategy or require a lot of resources to obtain a global…
For a class of translation-invariant free-fermion systems (including those with uniform nearest neighbor hopping) on a $d$-dimensional $L \times \cdots \times L$ hypercubic lattice, we prove that, starting from an arbitrary pure initial…
A (1 + eps)-approximate distance oracle for a graph is a data structure that supports approximate point-to-point shortest-path-distance queries. The most relevant measures for a distance-oracle construction are: space, query time, and…
We study the robustness of 3D intrinsic topogical order under external perturbations by investigating the paradigmatic microscopic model, the 3D toric code in an external magnetic field. Exact dualities as well as variational calculations…
Two topological phases are equivalent if they are connected by a local unitary transformation. In this sense, classifying topological phases amounts to classifying long-range entanglement patterns. We show that all 2D topological stabilizer…
We theoretically examine the use of a statistical distance measure, the indistinguishability, as a generic tool for the identification of topological order. We apply this measure to the toric code and two fractional quantum Hall models. We…
Storing quantum information for long times without disruptions is a major requirement for most quantum information technologies. A very appealing approach is to use self-correcting Hamiltonians, i.e. tailoring local interactions among the…
In this work, we will show how the topological order of the Toric Code appears when the lattice on which it is defined discretizes a three-dimensional torus. In order to do this, we will present a pedagogical review of the traditional…
In a previous effort [arXiv:1708.05492] we have created a framework that explains why topological structures naturally arise within a scientific theory; namely, they capture the requirements of experimental verification. This is…
We investigate a generalization of topological order from closed systems to open systems, for which the steady states take the place of ground states. We construct typical lattice models with steady-state topological order, and characterize…
In fault-tolerant quantum computing with the surface code, non-Clifford gates are crucial for universal computation. However, implementing these gates using methods like magic state distillation and code switching requires significant…
We give a new proof for the area law for general 1D gapped systems, which exponentially improves Hastings' famous result \cite{ref:Has07}. Specifically, we show that for a chain of d-dimensional spins, governed by a 1D local Hamiltonian…
This is the second paper in a series describing a numerical implementation of the conformal Einstein equation. This paper deals with the technical details of the numerical code used to perform numerical time evolutions from a "minimal" set…
We establish improved complexity estimates of quantum algorithms for linear dissipative ordinary differential equations (ODEs) and show that the time dependence can be fast-forwarded to be sub-linear. Specifically, we show that a quantum…