相关论文: Generating topological order: no speedup by dissip…

Distinguishing different topologically ordered phases and characterizing phase transitions between them is a difficult task due to the absence of local order parameters. In this paper, we use a combination of analytical and numerical…

We present a simple, unified approach to determining the growth law for the characteristic length scale, $L(t)$, in the phase ordering kinetics of a system quenched from a disordered phase to within an ordered phase. This approach, based on…

Adaptive quantum circuits employ unitary gates assisted by mid-circuit measurement, classical computation on the measurement outcome, and the conditional application of future unitary gates based on the result of the classical computation.…

Understanding the behaviour of topologically ordered lattice systems at finite temperature is a way of assessing their potential as fault-tolerant quantum memories. We compute the natural extension of the topological entanglement entropy…

The utilization of a $d$-level partially entangled state, shared by two parties wishing to communicate classical information without errors over a noiseless quantum channel, is discussed. We analytically construct deterministic dense coding…

We prove a nontrivial circuit-depth lower bound for preparing a low-energy state of a locally interacting quantum many-body system in two dimensions, assuming the circuit is geometrically local. For preparing any state which has an energy…

Here we study an efficient algorithm for decoding the topological codes. It is based on a simple principle, which should allow straightforward generalization to complex decoding problems. It is benchmarked with the planar code for both…

In this paper, the degenerate ground states of Z2 topological order on a plane with holes (the so-called surface codes) are used as the protected code subspace to build a topological quantum computer by tuning their quantum tunneling…

The following open problems, which concern a fundamental limit on coding properties of quantum codes with realistic physical constraints, are analyzed and partially answered here: (a) the upper bound on code distances of quantum…

Population protocols are a popular model of distributed computing, in which randomly-interacting agents with little computational power cooperate to jointly perform computational tasks. Inspired by developments in molecular computation, and…

Calculation of topological order parameters, such as the topological entropy and topological mutual information, are used to determine whether states possess topological order. Their calculation is expected to give reliable results when the…

Presently, topology optimization requires multiple iterations to create an optimized structure for given conditions. Among the conditions for topology optimization,the design area is one of the most important for structural design. In this…

We formalize the problem of dissipative quantum encoding, and explore the advantages of using Markovian evolution to prepare a quantum code in the desired logical space, with emphasis on discrete-time dynamics and the possibility of exact…

We consider 1d Hamiltonian systems whose ground states display symmetry protected topological order. We show that ground states within the topological phase cannot be connected with each other through LOCC between a bipartition of the…

We consider geometric methods of ``rotating" the toric code in higher dimensions to reduce the qubit count. These geometric methods can be used to prepare higher dimensional toric code states using single shot techniques, and in turn these…

In this paper, we employ the linear systems representation of a convolutional code to develop a decoding algorithm for convolutional codes over the erasure channel. We study the decoding problem using the state space description and this…

We determine the conditions under which topological order survives a rapid quantum quench. Specifically, we consider the case where a quantum spin system is prepared in the ground state of the Toric Code Model and, after the quench, it…

Designing the topology of three-dimensional structures is a challenging problem due to its memory and time consumption. In this paper, we present a robust and efficient algorithm for solving large-scale 3D topology optimization problems.…

We introduce a notion of homogeneous topological order, which is obeyed by most, if not all, known examples of topological order including fracton phases on quantum spins (qudits). The notion is a condition on the ground state subspace,…

Spatially coupled codes have been shown to universally achieve the capacity for a large class of channels. Many variants of such codes have been introduced to date. We discuss a further such variant that is particularly simple and is…