The preparation of long-range entangled states using unitary circuits is limited by Lieb-
Robinson bounds, but circuits with projective measurements and feedback (“adaptive …

Logical gates constitute the building blocks of fault-tolerant quantum computation. While
quantum error-corrected memories have been extensively studied in the literature, explicit …

A bstract Holography has taught us that spacetime is emergent and its properties depend on
the entanglement structure of the dual theory. In this paper, we describe how changes in the …

Random quantum circuits continue to inspire a wide range of applications in quantum
information science and many-body quantum physics, while remaining analytically tractable …

We provide the first tensor-network method for computing quantum weight enumerator
polynomials in the most general form. If a quantum code has a known tensor-network …

In the ongoing race towards experimental implementations of quantum error correction
(QEC), finding ways to automatically discover codes and encoding strategies tailored to the …

Adaptive quantum circuits, which combine local unitary gates, midcircuit measurements, and
feedforward operations, have recently emerged as a promising avenue for efficient state …

In this paper, we introduce an algorithm for extracting topological data from translation
invariant generalized Pauli stabilizer codes in two-dimensional systems, focusing on the …

We introduce a new class of qubit codes that we call Evenbly codes, building on a previous
proposal of hyperinvariant tensor networks. Its tensor network description consists of local …

The exponential scaling of the quantum degrees of freedom with the size of the system is
one of the biggest challenges in computational chemistry and particularly in quantum …