Performing large calculations with a quantum computer will likely require a fault-tolerant
architecture based on quantum error-correcting codes. The challenge is to design practical …

The development of robust architectures capable of large-scale fault-tolerant quantum
computation should consider both their quantum error-correcting codes and the underlying …

The surface code is currently the leading proposal to achieve fault-tolerant quantum
computation. Among its strengths are the plethora of known ways in which fault-tolerant …

We study a Hamiltonian system describing a three–spin-1/2 cluster-like interaction
competing with an Ising-like exchange. We show that the ground state in the cluster phase …

Certain physical systems that one might consider for fault-tolerant quantum computing
where qubits do not readily interact, for instance photons, are better suited for measurement …

Quantum spin systems may offer the first opportunities for beyond-classical quantum
computations of scientific interest. While general quantum simulation algorithms likely …

We consider a topological stabilizer code on a honeycomb grid, the" XYZ $^ 2$" code. The
code is inspired by the Kitaev honeycomb model and is a simple realization of a" matching …

We demonstrate how to construct the Z 2× Z 2 global symmetry which protects the ground
state degeneracy of cluster states for open boundary conditions. Such a degeneracy …

We theoretically propose a quantum simulation scheme for the toric-code Hamiltonian, the
paradigmatic model of a quantum spin liquid, based on time-periodic driving. We develop a …

We study and generalize the class of qubit topological stabilizer codes that arise in the
Abelian phase of the honeycomb lattice model. The resulting family of codes, which we …