Searcharxiv⌕ Search

arXiv subjects

Jeongwan Haah

Publications and source records attributed to Jeongwan Haah.

At least 37 records · Page 2Linked to original sources
arXiv2022

Performance of planar Floquet codes with Majorana-based qubits

Quantum error correction is crucial for any quantum computing platform to achieve truly scalable quantum computation. The surface code and its variants have been considered the most promising quantum error correction scheme due to their high threshold, low overhead, and relatively simple structure that can naturally be implemented in many existing qubit architectures, such as superconducting qubits. The recent development of Floquet codes offers another promising approach. By going beyond the usual paradigm of stabilizer codes, Floquet codes achieve similar performance while being constructed entirely from two-qubit measurements. This makes them particularly suitable for platforms where two-qubit measurements can be implemented directly, such as measurement-only topological qubits based on Majorana zero modes (MZMs). Here, we explain how two variants of Floquet codes can be implemented on MZM-based architectures without any auxiliary qubits for syndrome measurement and with shallow syndrome extraction sequences. We then numerically demonstrate their favorable performance. In particular, we show that they improve the threshold for scalable quantum computation in MZM-based systems by an order of magnitude, and significantly reduce space and time overheads below threshold.

quant-ph↗
arXiv2022

How Dynamical Quantum Memories Forget

Motivated by recent work showing that a quantum error correcting code can be generated by hybrid dynamics of unitaries and measurements, we study the long time behavior of such systems. We demonstrate that even in the "mixed" phase, a maximally mixed initial density matrix is purified on a time scale equal to the Hilbert space dimension (i.e., exponential in system size), albeit with noisy dynamics at intermediate times which we connect to Dyson Brownian motion. In contrast, we show that free fermion systems -- i.e., ones where the unitaries are generated by quadratic Hamiltonians and the measurements are of fermion bilinears -- purify in a time quadratic in the system size. In particular, a volume law phase for the entanglement entropy cannot be sustained in a free fermion system.

quant-ph↗
arXiv2022

Classification of Small Triorthogonal Codes

Triorthogonal codes are a class of quantum error correcting codes used in magic state distillation protocols. We classify all triorthogonal codes with $n+k \le 38$, where $n$ is the number of physical qubits and $k$ is the number of logical qubits of the code. We find $38$ distinguished triorthogonal subspaces and show that every triorthogonal code with $n+k\le 38$ descends from one of these subspaces through elementary operations such as puncturing and deleting qubits. Specifically, we associate each triorthogonal code with a Reed-Muller polynomial of weight $n+k$, and classify the Reed-Muller polynomials of low weight using the results of Kasami, Tokura, and Azumi and an extensive computerized search. In an appendix independent of the main text, we improve a magic state distillation protocol by reducing the time variance due to stochastic Clifford corrections.

quant-ph↗
arXiv2022

Clifford Quantum Cellular Automata: Trivial group in 2D and Witt group in 3D

We study locality preserving automorphisms of operator algebras on $D$-dimensional uniform lattices of prime $p$-dimensional qudits (QCA), specializing in those that are translation invariant (TI) and map every prime $p$-dimensional Pauli matrix to a tensor product of Pauli matrices (Clifford). We associate antihermitian forms of unit determinant over Laurent polynomial rings to TI Clifford QCA with lattice boundaries, and prove that the form determines the QCA up to Clifford circuits and shifts (trivial). It follows that every 2D TI Clifford QCA is trivial since the antihermitian form in this case is always trivial. Further, we prove that for any $D$ the fourth power of any TI Clifford QCA is trivial. We present explicit examples of nontrivial TI Clifford QCA for $D=3$ and any odd prime $p$, and show that the Witt group of the finite field $\mathbb F_p$ is a subgroup of the group $\mathfrak C(D = 3, p)$ of all TI Clifford QCA modulo trivial ones. That is, $\mathfrak C(D = 3, p \equiv 1 \mod 4) \supseteq \mathbb Z_2 \times \mathbb Z_2$ and $\mathfrak C(D = 3, p \equiv 3 \mod 4) \supseteq \mathbb Z_4$. The examples are found by disentangling the ground state of a commuting Pauli Hamiltonian which is constructed by coupling layers of prime dimensional toric codes such that an exposed surface has an anomalous topological order that is not realizable by commuting Pauli Hamiltonians strictly in two dimensions. In an appendix independent of the main body of the paper, we revisit a recent theorem of Freedman and Hastings that any two-dimensional QCA, which is not necessarily Clifford or translation invariant, is a constant depth quantum circuit followed by a shift. We give a more direct proof of the theorem without using any ancillas.

quant-ph↗
arXiv2022

Nontrivial Quantum Cellular Automata in Higher Dimensions

We construct a three-dimensional quantum cellular automaton (QCA), an automorphism of the local operator algebra on a lattice of qubits, which disentangles the ground state of the Walker-Wang three fermion model. We show that if this QCA can be realized by a quantum circuit of constant depth, then there exists a two-dimensional commuting projector Hamiltonian which realizes the three fermion topological order which is widely believed not to be possible. We conjecture in accordance with this belief that this QCA is not a quantum circuit of constant depth, and we provide two further pieces of evidence to support the conjecture. We show that this QCA maps every local Pauli operator to a local Pauli operator, but is not a Clifford circuit of constant depth. Further, we show that if the three-dimensional QCA can be realized by a quantum circuit of constant depth, then there exists a two-dimensional QCA acting on fermionic degrees of freedom which cannot be realized by a quantum circuit of constant depth; i.e., we prove the existence of a nontrivial QCA in either three or two dimensions. The square of our three-dimensional QCA can be realized by a quantum circuit of constant depth, and this suggests the existence of a $\mathbb{Z}_2$ invariant of a QCA in higher dimensions, totally distinct from the classification by positive rationals (i.e., by one integer index for each prime) in one dimension. In an appendix, unrelated to the main body of this paper, we give a fermionic generalization of a result of Bravyi and Vyalyi on ground states of 2-local commuting Hamiltonians.

quant-ph↗
arXiv2022

Boundaries for the Honeycomb Code

We introduce a simple construction of boundary conditions for the honeycomb code that uses only pairwise checks and allows parallelogram geometries at the cost of modifying the bulk measurement sequence. We discuss small instances of the code.

quant-ph↗
arXiv2021

Limits on the storage of quantum information in a volume of space

We study the fundamental limits on the reliable storage of quantum information in lattices of qubits by deriving tradeoff bounds for approximate quantum error correcting codes. We introduce a notion of local approximate correctability and code distance, and give a number of equivalent formulations thereof, generalizing various exact error-correction criteria. Our tradeoff bounds relate the number of physical qubits $n$, the number of encoded qubits $k$, the code distance $d$, the accuracy parameter $δ$ that quantifies how well the erasure channel can be reversed, and the locality parameter $\ell$ that specifies the length scale at which the recovery operation can be done. In a regime where the recovery is successful to accuracy $ε$ that is exponentially small in $\ell$, which is the case for perturbations of local commuting projector codes, our bound reads $kd^{\frac{2}{D-1}} \le O\bigl(n (\log n)^{\frac{2D}{D-1}} \bigr)$ for codes on $D$-dimensional lattices of Euclidean metric. We also find that the code distance of any local approximate code cannot exceed $O\bigl(\ell n^{(D-1)/D}\bigr)$ if $δ\le O(\ell n^{-1/D})$. As a corollary of our formulation of correctability in terms of logical operator avoidance, we show that the code distance $d$ and the size $\tilde d$ of a minimal region that can support all approximate logical operators satisfies $\tilde d d^{\frac{1}{D-1}}\le O\bigl( n \ell^{\frac{D}{D-1}} \bigr)$, where the logical operators are accurate up to $O\bigl( ( n δ/ d )^{1/2}\bigr)$ in operator norm. Finally, we prove that for two-dimensional systems if logical operators can be approximated by operators supported on constant-width flexible strings, then the dimension of the code space must be bounded. This supports one of the assumptions of algebraic anyon theories, that there exist only finitely many anyon types.

quant-ph↗
arXiv2021

Dynamically Generated Logical Qubits

We present a quantum error correcting code with dynamically generated logical qubits. When viewed as a subsystem code, the code has no logical qubits. Nevertheless, our measurement patterns generate logical qubits, allowing the code to act as a fault-tolerant quantum memory. Our particular code gives a model very similar to the two-dimensional toric code, but each measurement is a two-qubit Pauli measurement.

quant-ph↗
arXiv2021

Measurement sequences for magic state distillation

Magic state distillation uses special codes to suppress errors in input states, which are often tailored to a Clifford-twirled error model. We present detailed measurement sequences for magic state distillation protocols which can suppress arbitrary errors on any part of a protocol, assuming the independence of errors across qubits. Provided with input magic states, our protocol operates on a two-dimensional square grid by measurements of $ZZ$ on horizontal pairs of qubits, $XX$ on vertical pairs, and $Z,X$ on single qubits.

quant-ph↗
arXiv2021

A degeneracy bound for homogeneous topological order

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, rather than on the Hamiltonian, and demands that given a collection of ball-like regions, any linear transformation on the ground space be realized by an operator that avoids the ball-like regions. We derive a bound on the ground state degeneracy $\mathcal D$ for systems with homogeneous topological order on an arbitrary closed Riemannian manifold of dimension $d$, which reads \[ \log \mathcal D \le c μ(L/a)^{d-2}.\] Here, $L$ is the diameter of the system, $a$ is the lattice spacing, and $c$ is a constant that only depends on the isometry class of the manifold, and $μ$ is a constant that only depends on the density of degrees of freedom. If $d=2$, the constant $c$ is the (demi)genus of the space manifold. This bound is saturated up to constants by known examples.

quant-ph↗
arXiv2020

Classification of translation invariant topological Pauli stabilizer codes for prime dimensional qudits on two-dimensional lattices

We prove that on any two-dimensional lattice of qudits of a prime dimension, every translation invariant Pauli stabilizer group with local generators and with code distance being the linear system size, is decomposed by a local Clifford circuit of constant depth into a finite number of copies of the toric code (abelian discrete gauge theory) stabilizer group. This means that under local Clifford circuits the number of toric code copies is the complete invariant of topological Pauli stabilizer codes. Previously, the same conclusion was obtained under the assumption of nonchirality for qubit codes or the Calderbank-Shor-Steane structure for prime qudit codes; we do not assume any of these.

quant-ph↗
arXiv2020

Disentangling the Generalized Double Semion Model

We analyze the class of Generalized Double Semion (GDS) models in arbitrary dimensions from the point of view of lattice Hamiltonians. We show that on a $d$-dimensional spatial manifold $M$ the dual of the GDS is equivalent, up to constant depth local quantum circuits, to a group cohomology theory tensored with lower dimensional cohomology models that depend on the manifold $M$. We comment on the space-time topological quantum field theory (TQFT) interpretation of this result. We also investigate the GDS in the presence of time reversal symmetry, showing that it forms a non-trivial symmetry enriched toric code phase in odd spatial dimensions.

math-ph↗
arXiv2020

Optimization of the surface code design for Majorana-based qubits

The surface code is a prominent topological error-correcting code exhibiting high fault-tolerance accuracy thresholds. Conventional schemes for error correction with the surface code place qubits on a planar grid and assume native CNOT gates between the data qubits with nearest-neighbor ancilla qubits. Here, we present surface code error-correction schemes using $\textit{only}$ Pauli measurements on single qubits and on pairs of nearest-neighbor qubits. In particular, we provide several qubit layouts that offer favorable trade-offs between qubit overhead, circuit depth and connectivity degree. We also develop minimized measurement sequences for syndrome extraction, enabling reduced logical error rates and improved fault-tolerance thresholds. Our work applies to topologically protected qubits realized with Majorana zero modes and to similar systems in which multi-qubit Pauli measurements rather than CNOT gates are the native operations.

quant-ph↗
arXiv2020

Quantum algorithm for simulating real time evolution of lattice Hamiltonians

We study the problem of simulating the time evolution of a lattice Hamiltonian, where the qubits are laid out on a lattice and the Hamiltonian only includes geometrically local interactions (i.e., a qubit may only interact with qubits in its vicinity). This class of Hamiltonians is very general and is believed to capture fundamental interactions of physics. Our algorithm simulates the time evolution of such a Hamiltonian on $n$ qubits for time $T$ up to error $ε$ using $\mathcal O( nT \mathrm{polylog} (nT/ε))$ gates with depth $\mathcal O(T \mathrm{polylog} (nT/ε))$. Our algorithm is the first simulation algorithm that achieves gate cost quasilinear in $nT$ and polylogarithmic in $1/ε$. Our algorithm also readily generalizes to time-dependent Hamiltonians and yields an algorithm with similar gate count for any piecewise slowly varying time-dependent bounded local Hamiltonian. We also prove a matching lower bound on the gate count of such a simulation, showing that any quantum algorithm that can simulate a piecewise constant bounded local Hamiltonian in one dimension to constant error requires $\tilde Ω(nT)$ gates in the worst case. The lower bound holds even if we only require the output state to be correct on local measurements. To our best knowledge, this is the first nontrivial lower bound on the gate complexity of the simulation problem. Our algorithm is based on a decomposition of the time-evolution unitary into a product of small unitaries using Lieb-Robinson bounds. In the appendix, we prove a Lieb-Robinson bound tailored to Hamiltonians with small commutators between local terms, giving zero Lieb-Robinson velocity in the limit of commuting Hamiltonians. This improves the performance of our algorithm when the Hamiltonian is close to commuting.

quant-ph↗
arXiv2020

An Exactly Solvable Model for a $4+1D$ Beyond-Cohomology Symmetry Protected Topological Phase

We construct an exactly solvable commuting projector model for a $4+1$ dimensional ${\mathbb Z}_2$ symmetry-protected topological phase (SPT) which is outside the cohomology classification of SPTs. The model is described by a decorated domain wall construction, with "three-fermion" Walker-Wang phases on the domain walls. We describe the anomalous nature of the phase in several ways. One interesting feature is that, in contrast to in-cohomology phases, the effective ${\mathbb Z}_2$ symmetry on a $3+1$ dimensional boundary cannot be described by a quantum circuit and instead is a nontrivial quantum cellular automaton (QCA). A related property is that a codimension-two defect (for example, the termination of a ${\mathbb Z}_2$ domain wall at a trivial boundary) will carry nontrivial chiral central charge $4$ mod $8$. We also construct a gapped symmetric topologically-ordered boundary state for our model, which constitutes an anomalous symmetry enriched topological phase outside of the classification of arXiv:1602.00187, and define a corresponding anomaly indicator.

cond-mat.str-el↗
arXiv2020

Product Decomposition of Periodic Functions in Quantum Signal Processing

We consider an algorithm to approximate complex-valued periodic functions $f(e^{iθ})$ as a matrix element of a product of $SU(2)$-valued functions, which underlies so-called quantum signal processing. We prove that the algorithm runs in time $\mathcal O(N^3 \mathrm{polylog}(N/ε))$ under the random-access memory model of computation where $N$ is the degree of the polynomial that approximates $f$ with accuracy $ε$; previous efficiency claim assumed a strong arithmetic model of computation and lacked numerical stability analysis.

quant-ph↗
arXiv2019

The Group Structure of Quantum Cellular Automata

We consider the group structure of quantum cellular automata (QCA) modulo circuits and show that it is abelian even without assuming the presence of ancillas, at least for most reasonable choices of control space; this is a corollary of a general method of ancilla removal. Further, we show how to define a group of QCA that is well-defined without needing to use families, by showing how to construct a coherent family containing an arbitrary finite QCA; the coherent family consists of QCA on progressively finer systems of qudits where any two members are related by a shallow quantum circuit. This construction applied to translation invariant QCA shows that all translation invariant QCA in three dimensions and all translation invariant Clifford QCA in any dimension are coherent.

quant-ph↗