Related papers: Generating topological order: no speedup by dissip…
In order to build a large scale quantum computer, one must be able to correct errors extremely fast. We design a fast decoding algorithm for topological codes to correct for Pauli errors and erasure and combination of both errors and…
We present analytical and numerical studies of the behaviour of the $\alpha$-Renyi entropies in the Toric code in presence of several types of perturbations aimed at studying the simulability of these perturbations to the parent Hamiltonian…
We still do not have perfect decoders for topological codes that can satisfy all needs of different experimental setups. Recently, a few neural network based decoders have been studied, with the motivation that they can adapt to a wide…
Long-range entanglement--the backbone of topologically ordered states--cannot be created in finite time using local unitary circuits, or equivalently, adiabatic state preparation. Recently it has come to light that single-site measurements…
In traditional topology optimization, the computing time required to iteratively update the material distribution within a design domain strongly depends on the complexity or size of the problem, limiting its application in real engineering…
Convolutional codes are constructed, designed and analysed using row and/or block structures of unit algebraic schemes. Infinite series of such codes and of codes with specific properties are derived. Properties are shown algebraically and…
Let G be an embedded planar undirected graph that has n vertices, m edges, and f faces but has no self-loop or multiple edge. If G is triangulated, we can encode it using {4/3}m-1 bits, improving on the best previous bound of about 1.53m…
In this chapter, we show how the use of differential coding and the presence of phase slips in the transmission channel affect the total achievable information rates and capacity of a system. By means of the commonly used QPSK modulation,…
Trajectory planning is a critical process that enables autonomous systems to safely navigate complex environments. Signal temporal logic (STL) specifications are an effective way to encode complex temporally extended objectives for…
The explosion in the volumes of data being stored online has resulted in distributed storage systems transitioning to erasure coding based schemes. Yet, the codes being deployed in practice are fairly short. In this work, we address what we…
We present hybrid Gibbs sampling algorithms for the stabilizer code Hamiltonians of the rotated surface code and the toric code with only local quantum algorithms, using $\sim L/2$ quantum circuit depth to prepare the Gibbs state of the…
We introduce a simple protocol for measuring properties of a gapped ground state with essentially no disturbance to the state. The required Hamiltonian evolution time scales inversely with the spectral gap and target precision (up to…
Quantum algorithms for probing ground-state properties of quantum systems require good initial states. Projection-based methods such as eigenvalue filtering rely on inputs that have a significant overlap with the low-energy subspace, which…
Measurement-based quantum computation offers exponential computational speed-up via simple measurements on a large entangled cluster state. We propose and demonstrate a scalable scheme for the generation of photonic cluster states suitable…
We construct rotated logical states by applying rotation operators to stabilizer states, extending the logical basis and modifying stabilizer generators. Rotation operators affect the effective code distance $d_R$, which decays…
We show that any embedding of a planar graph can be encoded succinctly while efficiently answering a number of topological queries near-optimally. More precisely, we build on a succinct representation that encodes an embedding of $m$ edges…
Preparing high-fidelity logical magic states is crucial for fault-tolerant quantum computation. Among prior attempts to reduce the substantial cost of magic state preparation, magic state cultivation (MSC), a recently proposed protocol for…
We investigate topological order on fractal geometries embedded in $n$ dimensions. In particular, we diagnose the existence of the topological order through the lens of quantum information and geometry, i.e., via its equivalence to a…
As communication networks are growing at a fast pace, the need for more scalable approaches to operate such networks is pressing. Decentralization and locality are key concepts to provide scalability. Existing models for which local…
The modern conception of phases of matter has undergone tremendous developments since the first observation of topologically ordered states in fractional quantum Hall systems in the 1980s. In this paper, we explore the question: How much…