DWDominic J. Williamson

Dominic J. Williamson

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Dominic J. Williamson has a total of 48 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Ising on the Donut: Regimes of Topological Quantum Error Correction from Statistical Mechanics

    by Lucas H. English, Sam Roberts, Stephen D. Bartlett, Andrew C. Doherty, Dominic J. Williamson

    Utility-scale quantum computers require quantum error correcting codes with large numbers of physical qubits to achieve sufficiently low logical error rates. The performance of quantum error correction (QEC) is generally predicted through large-scale numerical simulations, used to estimate thresholds, finite-size scaling, and exponential suppression of logical errors below threshold. The connection of QEC to models from statistical mechanics provides an alternative tool for analyzing QEC performance. However, predicting the behavior of these models also requires large-scale numerical simulations, as analytic solutions are not generally known. Here we exploit an exact mapping, from a toric code under bit-flip noise that is post-selected on being syndrome free to the exactly solvable two-dimensional Ising model on a torus, to derive an analytic solution for the logical failure rate across its full domain of physical error rates. In particular, this mapping provides closed-form expressions for the logical failure rate in four distinct regimes: the path-counting, below-threshold (ordered), near-threshold (critical), and above-threshold (disordered) regimes. Our framework places a number of familiar and long-standing numerical observations on firm theoretical ground. It also motivates explicit ansätze for the conventional QEC setting of non-post-selected codes whose statistical mechanics mappings involve random-bond disorder. Specifically, we introduce an effective tension model for the below-threshold regime, and a new scaling ansatz for the near-threshold regime, derived from an analysis of the domain wall energy cost distributions. By bridging statistical mechanics theory and quantum error correction practice, our results offer a new toolkit for designing, benchmarking, and understanding topological codes beyond current computational limits.

  • Constant-Depth Magic State Cultivation with Clifford Measurements by Gauging

    by Bence Hetényi, Benjamin J. Brown, Dominic J. Williamson

    Magic states are a scarce resource for two-dimensional qubit stabilizer codes. Magic state cultivation was recently proposed to reduce the cost of magic state preparation by measuring the transversal Clifford operator of the color code. Cultivation achieves ∼10^{-9} logical error rates for the d=5 color code, with substantially lower space-time overhead than magic state distillation. However, due to the O(d) depth of the Clifford measurement circuit, magic state cultivation becomes impractical for d>5. Here, we perform logical XS^{†} measurements on the color code by gauging a transversal Clifford gate, resulting in a constant-depth logical measurement circuit. We employ repeated gauging measurements with postselection rather than performing error correction on the Clifford stabilizer code that emerges during the gauging protocol, thus gaining simplicity at the cost of scalability. Our protocol requires a regular square grid connectivity and yields logical error rates comparable to magic state cultivation. The d=7 version of our protocol gives access to the 10^{-12} logical error rate regime at 0.05% physical error rate while retaining more than 1% of the shots after the equivalent of the cultivation stage.

  • Open Access

    Symmetry-enriched topological order in tensor networks: Defects, gauging and anyon condensation

    by Dominic J. Williamson, Nick Bultinck, Frank Verstraete

    We study symmetry-enriched topological order in two-dimensional tensor network states by using graded matrix product operator algebras to represent symmetry-induced domain walls. A close connection to the theory of graded unitary fusion categories is established. Tensor network representations of the topological defect superselection sectors are constructed for all domain walls. The emergent symmetry-enriched topological order is extracted from these representations, including the symmetry action on the underlying anyons. Dual phase transitions, induced by gauging a global symmetry, and condensation of a bosonic subtheory, are analyzed and the relationship between topological orders on either side of the transition is derived. Several examples are worked through explicitly.


  • Partial Self-Correction in Layer Codes

    by Dominic J. Williamson

    The storage of large-scale quantum information at finite temperature requires an autonomous and reliable quantum hard drive, also known as a self-correcting quantum memory. It is a long-standing open problem to find a self-correcting quantum memory in three dimensions. The recently introduced layer codes achieve the best possible scaling of code parameters and logical energy barrier in three dimensions; these are tantalizing features for the purposes of self-correction. In this Letter, we show that a family of layer codes based on good quantum Tanner codes exhibit partial self-correction. Their memory time grows exponentially with linear system size, up to a length scale that is exponential in the inverse temperature. At this length scale, the memory time scales as a double exponential of inverse temperature. To establish this result, we introduce a concatenated matching decoder that combines three rounds of parallelized minimum-weight perfect matching with a decoder for good quantum Tanner codes. We show that our decoder corrects errors up to a constant fraction of the energy barrier, and a constant fraction of the code distance, for a family of layer codes. Our results position layer codes as the leading candidate for a partially self-correcting memory in three dimensions in the asymptotically large system size regime. While they fall short of achieving strict self-correction in the thermodynamic limit, our Letter highlights the potential of these local codes in three dimensions, with fast distance and logical qubit growth, fast decoders, and a long memory time over a wide range of parameters. In particular, recent work by Gu et al. reports promising numerical results for the memory time of small explicit instances of layer codes based on random input codes.

  • Open Access

    Universal Fault-Tolerant Quantum Computation in 2D without Getting Tied in Knots

    by Margarita Davydova, Andreas Bauer, Julio C. Magdalena de la Fuente, Mark Webster, Dominic J. Williamson, Benjamin J. Brown

    We show how to perform scalable fault-tolerant non-Clifford gates in two dimensions by introducing domain walls between the surface code and a non-Abelian topological code whose code space is stabilized by Clifford operators. We formulate a path-integral framework which provides both a macroscopic picture for different logical gates as well as a way to derive the associated microscopic circuits. We also show an equivalence between our approach and prior proposals where a 2D array of qubits reproduces the action of a transversal gate in a 3D stabilizer code over time, thus establishing a connection between 3D codes and 2D non-Abelian topological phases. We prove a threshold theorem for our protocols under local stochastic circuit noise using a just-in-time decoder to correct the non-Abelian code.


  • Open Access

    Parallel Logical Measurements via Quantum Code Surgery

    by Alexander Cowtan, Zhiyang He, Dominic J. Williamson, Theodore J. Yoder

    Quantum code surgery is a flexible and low-overhead technique for performing logical measurements on quantum error-correcting codes, which generalizes lattice surgery. In this work, we present a code surgery scheme, applicable to any qubit stabilizer low-density parity check (LDPC) code, that fault-tolerantly measures many logical Pauli operators in parallel. For a collection of logically disjoint Pauli product measurements supported on t logical qubits, our scheme uses O ( t ω ( log  t + log 3  ω ) ) ancilla qubits, where ω ≥ d is the maximum weight of the single logical Pauli representatives involved in the measurements and d is the code distance. This is all done in time O ( d ) independent of t . Our proposed scheme preserves both the LDPC property and the fault-distance of the original code, without requiring ancillary logical codeblocks, which may be costly to prepare. This addresses a shortcoming of several recently introduced surgery schemes, which can only be applied to measure a limited number of logical operators in parallel if they overlap on data qubits.


  • Open Access

    Wire Codes

    by Nouédyn Baspin, Dominic Williamson

    Quantum information is fragile and must be protected by a quantum error-correcting code for large-scale practical applications. Recently, highly efficient quantum codes have been discovered which require a high degree of spatial connectivity. This raises the question of how to realize these codes with minimal overhead under physical hardware connectivity constraints. Here, we introduce a general recipe to transform any quantum stabilizer code into a subsystem code that has local interactions, with weight and degree three, on a given graph. We call the subsystem codes produced by our recipe wire codes, and their code parameters depend on the input code and the given graph. Wire codes can be adapted to have a local implementation on any graph that supports a low-density embedding of the input Tanner graph, with an overhead that depends on the embedding. In particular, applying our results to a stabilizer code and a subdivision of its own Tanner graph, yields a quantum weight reduction procedure with a multiplicative qubit overhead and distance reduction that are linear in the input check degree and weight, respectively. Applying our results to hypercubic lattices leads to a construction of local subsystem codes with optimal scaling code parameters in any fixed spatial dimension. Similarly, applying our results to families of expanding graphs leads to local codes on these graphs with code parameters that depend on the degree of expansion. Our results constitute a general method to construct low-overhead subsystem codes on general graphs, which can be applied to adapt highly efficient quantum error correction procedures to hardware with restricted connectivity.


  • Top Cited Papers
    Open Access

    Low-overhead fault-tolerant quantum computation by gauging logical operators

    by Dominic J. Williamson, Theodore J. Yoder


  • Top Cited Papers
    Open Access

    Topological Stabilizer Models on Continuous Variables

    by Julio C. Magdalena de la Fuente, Tyler D. Ellison, Meng Cheng, Dominic J. Williamson

    We construct a family of two-dimensional topological stabilizer codes on continuous variable (CV) degrees of freedom, which generalize homological rotor codes and the toric-GKP code. Our topological codes are built using the concept of boson condensation—we start from a parent stabilizer code based on an R gauge theory and condense various bosonic excitations. This produces a large class of topological CV stabilizer codes, including ones that are characterized by the anyon theories of U ( 1 ) 2 n × U ( 1 ) − 2 m Chern-Simons theories, for arbitrary pairs of positive integers ( n , m ) . Most notably, this includes anyon theories that are nonchiral and nevertheless do not admit a gapped boundary. It is widely believed that such anyon theories cannot be realized by any stabilizer model on finite-dimensional systems. We conjecture that these CV codes go beyond codes obtained from concatenating a topological qudit code with a local encoding into CVs, and thus constitute the first example of topological codes that are intrinsic to CV systems. Moreover, we study the Hamiltonians associated with the topological CV stabilizer codes and show that, although they have a gapless spectrum, they can become gapped with the addition of a quadratic perturbation. We show that similar methods can be used to construct a gapped Hamiltonian whose anyon theory agrees with a U ( 1 ) 2 Chern-Simons theory. Our work initiates the study of scalable stabilizer codes that are intrinsic to CV systems and highlights how error-correcting codes can be used to design and analyze many-body systems of CVs that model lattice gauge theories.


  • Top Cited Papers
    Open Access

    Quantum Cellular Automata and Categorical Dualities of Spin Chains

    by Corey Jones, Kylan Schatz, Dominic J. Williamson

    Dualities play a central role in the study of quantum spin chains, providing insight into the structure of quantum phase diagrams and phase transitions. In this work, we study categorical dualities, which are defined as bounded-spread isomorphisms between algebras of symmetry-respecting local operators on a spin chain. We consider generalized global symmetries that correspond to unitary fusion categories, which are represented by matrix-product operator algebras. A fundamental question about dualities is whether they can be extended to quantum cellular automata on the larger algebra generated by all local operators in the the unit matrix-product operator sector. For on-site representations of Hopf algebra symmetries, this larger algebra is the usual tensor product quasi-local algebra. We present a solution to the extension problem using the machinery of Doplicher–Haag–Roberts bimodules. Our solution provides a crisp categorical criterion for when an extension of a duality exists. We show that the set of possible extensions form a torsor over the invertible objects in the relevant symmetry category. As a corollary, we obtain a classification result concerning dualities in the group case.