arXiv subjects

Campbell McLauchlan

Publications and source records attributed to Campbell McLauchlan.

10 recordsLinked to original sources

arXiv2026

Putting fermions onto a digital quantum computer

Quantum computers are expected to become a powerful tool for studying physical quantum systems. Consequently, a number of quantum algorithms for studying the physical properties of such systems have been developed. While qubit-based quantum computers are naturally suited to the study of spin-1/2 systems, systems containing other degrees of freedom must first be encoded into qubits. Transformations to and from fermionic degrees of freedom have long been an important tool in physics and, now the simulation of fermionic systems on quantum computers based on qubits provides yet another application. In this perspective, we review methods for encoding fermionic degrees of freedom into qubits and attempt to dispel the persistent notion that fermionic systems beyond one dimension are fundamentally more difficult to deal with.

quant-ph↗

arXiv2026

Single-Shot Decoding and Fault-tolerant Gates with Trivariate Tricycle Codes

While quantum low-density parity check (qLDPC) codes are a low-overhead means of quantum information storage, it is valuable for quantum codes to possess fault-tolerant features beyond this resource efficiency. In this work, we introduce trivariate tricycle (TT) codes, qLDPC codes that combine several desirable features: high thresholds under a circuit-level noise model, partial single-shot decodability for low-time-overhead decoding, a large set of transversal Clifford gates and automorphisms within and between code blocks, and (for several sub-constructions) constant-depth implementations of a (non-Clifford) $CCZ$ gate. TT codes are CSS codes based on a length-3 chain complex, and are defined from three trivariate polynomials, with the 3D toric code (3DTC) belonging to this construction. We numerically search for TT codes and find several candidates with improved parameters relative to the 3DTC, using up to 48$\times$ fewer data qubits as equivalent 3DTC encodings. We construct syndrome-extraction circuits for these codes and numerically demonstrate single-shot decoding in the X error channel in both phenomenological and circuit-level noise models. Under circuit-level noise, TT codes have a threshold of $0.3\%$ in the Z error channel and $1\%$ in the X error channel (with single-shot decoding). All TT codes possess several transversal $CZ$ gates that can partially address logical qubits between two code blocks. Additionally, the codes possess a large set of automorphisms that can perform Clifford gates within a code block. Finally, we establish several TT code polynomial constructions that allows for a constant-depth implementation of logical $CCZ$ gates. We find examples of error-correcting and error-detecting codes using these constructions whose parameters out-perform those of the 3DTC, using up to $4\times$ fewer data qubits for equivalent-distance 3DTC encodings.

quant-ph↗

arXiv2025

Classifying one-dimensional Floquet phases through two-dimensional topological order

Floquet systems display rich phenomena, such as time crystals, with many-body localisation (MBL) protecting the phases from heating. While several types of Floquet phases have been classified, a unified picture of Floquet MBL is still emerging. Static phases have been fruitfully studied via "symmetry topological field theory" (SymTFT), wherein the universal features of $G$-symmetric systems are elucidated by placing them on the boundary of a topological order of one dimension higher. In this work, we provide a SymTFT approach to classifying $G$-symmetric Floquet MBL phases in 1D, for $G$ a finite Abelian group with on-site unitary action. In the SymTFT, these 1D systems correspond to the boundaries of the quantum double associated to $G$, and the classification naturally arises from considering the Lagrangian subgroups and boundary excitations of the quantum double. The classification covers all known Floquet phases while uncovering others previously unexplored, along with bulk features of phases thought to have only boundary signatures. We refer to the latter phases as "dual" time crystals. For static phases, we show how anyons of the quantum double and (string) order parameters provide a natural and simple interpretation of known classification schemes. By extending our framework to the boundaries of twisted quantum doubles, we uncover a new time-crystalline phase with non-onsite symmetry, which cannot be obtained through local, symmetric Hamiltonian drives. We numerically demonstrate evidence for the absolute stability of this phase, and observe that for open boundary conditions it has greater stability to symmetric perturbations. We finally discuss perspectives on using programmable quantum devices to realise and probe the phases we discuss. Our results show that SymTFT provides a powerful approach to unifying phases and features of Floquet systems.

cond-mat.str-el↗

arXiv2025

Tailoring Dynamical Codes for Biased Noise: The X$^3$Z$^3$ Floquet Code

We propose the X$^3$Z$^3$ Floquet code, a dynamical code with improved performance under biased noise compared to other Floquet codes. The enhanced performance is attributed to a simplified decoding problem resulting from a persistent stabiliser-product symmetry, which surprisingly exists in a code without constant stabilisers. Even if such a symmetry is allowed, we prove that general dynamical codes with two-qubit parity measurements cannot admit one-dimensional decoding graphs, a key feature responsible for the high performance of bias-tailored stabiliser codes. Despite this, our comprehensive simulations show that the symmetry of the X$^3$Z$^3$ Floquet code renders its performance under biased noise far better than several leading Floquet codes. To maintain high-performance implementation in hardware without native two-qubit parity measurements, we introduce ancilla-assisted bias-preserving parity measurement circuits. Our work establishes the X$^3$Z$^3$ code as a prime quantum error-correcting code, particularly for devices with reduced connectivity, such as the honeycomb and heavy-hexagonal architectures.

quant-ph↗

arXiv2025

Characterising the failure mechanisms of error-corrected quantum logic gates

Mid-circuit measurements used in quantum error correction are essential in quantum computer architecture, as they read out syndrome data and drive logic gates. Here, we use a heavy-hex code prepared on a superconducting qubit array to investigate how different noise sources impact error-corrected logic. First, we identify that idling errors occurring during readout periods are highly detrimental to a quantum memory. We demonstrate significant improvements to the memory by designing and implementing a low-depth syndrome extraction circuit. Second, we perform a stability experiment to investigate the type of failures that can occur during logic gates due to readout assignment errors. We find that the error rate of the stability experiment improves with additional stabilizer readout cycles, revealing a trade-off as additional stability comes at the expense of time over which the memory can decay. We corroborate our results using holistic device benchmarking and by comparison to numerical simulations. Finally, by varying different parameters in our simulations we identify the key noise sources that impact the fidelity of fault-tolerant logic gates, with measurement noise playing a dominant role in logical gate performance.

quant-ph↗

arXiv2024

Accommodating Fabrication Defects on Floquet Codes with Minimal Hardware Requirements

Floquet codes are an intriguing generalisation of stabiliser and subsystem codes, which can provide good fault-tolerant characteristics while benefiting from reduced connectivity requirements in hardware. A recent question of interest has been how to run Floquet codes on devices which have defective -- and therefore unusable -- qubits. This is an under-studied issue of crucial importance for running such codes on realistic hardware. To address this challenge, we introduce a new method of accommodating defective qubits on a wide range of two-dimensional Floquet codes, which requires no additional connectivity in the underlying quantum hardware, no modifications to the original Floquet code's measurement schedule, can accommodate boundaries, and is optimal in terms of the number of qubits and stabilisers removed. We numerically demonstrate that, using this method, the planar honeycomb code is fault tolerant up to a fabrication defect probability of $\approx 12\%$. We find the fault-tolerant performance of this code under defect noise is competitive with that of the surface code, despite its sparser connectivity. We finally propose multiple ways this approach can be adapted to the underlying hardware, through utilising any additional connectivity available, and treating defective auxiliary qubits separately to defective data qubits. Our work therefore serves as a guide for the implementation of Floquet codes in realistic quantum hardware.

quant-ph↗

arXiv2024

A new twist on the Majorana surface code: Bosonic and fermionic defects for fault-tolerant quantum computation

Majorana zero modes (MZMs) are promising candidates for topologically-protected quantum computing hardware, however their large-scale use will likely require quantum error correction. Majorana surface codes (MSCs) have been proposed to achieve this. However, many MSC properties remain unexplored. We present a unified framework for MSC "twist defects" $\unicode{x2013}$ anyon-like objects encoding quantum information. We show that twist defects in MSCs can encode twice the amount of topologically protected information as in qubit-based codes or other MSC encoding schemes. This is due to twists encoding both logical qubits and "logical MZMs," with the latter enhancing the protection microscopic MZMs can offer. We explain how to perform universal computation with logical qubits and logical MZMs while potentially using far fewer resources than in other MSC schemes. All Clifford gates can be implemented on logical qubits by braiding twist defects. We introduce lattice-surgery-based techniques for computing with logical MZMs and logical qubits, achieving the effect of Clifford gates with zero time overhead. We also show that logical MZMs may result in improved spatial overheads for sufficiently low rates of quasi-particle poisoning. Finally, we introduce a novel MSC analogue of transversal gates that achieves encoded Clifford gates in small codes by braiding microscopic MZMs. MSC twist defects thus open new paths towards fault-tolerant quantum computation.

quant-ph↗

arXiv2024

Dynamical Magic Transitions in Monitored Clifford+T Circuits

The classical simulation of highly-entangling quantum dynamics is conjectured to be generically hard. Thus, recently discovered measurement-induced transitions between highly entangling and low-entanglement dynamics are phase transitions in classical simulability. Here, we study simulability transitions beyond entanglement: noting that some highly-entangling dynamics (e.g., integrable systems or Clifford circuits) are easy to classically simulate, thus requiring "magic"--a subtle form of quantum resource--to achieve computational hardness, we ask how the dynamics of magic competes with measurements. We study the resulting "dynamical magic transitions" focusing on random monitored Clifford circuits doped by T gates (injecting magic). We identify dynamical "stabilizer-purification"--the collapse of a superposition of stabilizer states by measurements--as the mechanism driving this transition. We find cases where transitions in magic and entanglement coincide, but also others with a magic and simulability transition in a highly (volume-law) entangled phase. In establishing our results, we use Pauli-based computation, a scheme distilling the quantum essence of the dynamics to a magic state register subject to mutually commuting measurements. We link stabilizer-purification to "magic fragmentation" wherein these measurements separate into disjoint, O(1)-weight blocks, and relate this to the spread of magic in the original circuit becoming arrested.

quant-ph↗

arXiv2024

Error-corrected Hadamard gate simulated at the circuit level

We simulate the logical Hadamard gate in the surface code under a circuit-level noise model, compiling it to a physical circuit on square-grid connectivity hardware. Our paper is the first to do this for a logical unitary gate on a quantum error-correction code. We consider two proposals, both via patch-deformation: one that applies a transversal Hadamard gate (i.e. a domain wall through time) to interchange the logical $X$ and $Z$ strings, and another that applies a domain wall through space to achieve this interchange. We explain in detail why they perform the logical Hadamard gate by tracking how the stabilisers and the logical operators are transformed in each quantum error-correction round. We optimise the physical circuits and evaluate their logical failure probabilities, which we find to be comparable to those of a quantum memory experiment for the same number of quantum error-correction rounds. We present syndrome-extraction circuits that maintain the same effective distance under circuit-level noise as under phenomenological noise. We also explain how a $SWAP$-quantum error-correction round (required to return the patch to its initial position) can be compiled to only four two-qubit gate layers. This can be applied to more general scenarios and, as a byproduct, explains from first principles how the "stepping" circuits of the recent Google paper [McEwen, Bacon, and Gidney, Quantum 7, 1172 (2023)] can be constructed.

quant-ph↗

arXiv2024

SymTFT out of equilibrium: from time crystals to braided drives and Floquet codes

Symmetry Topological Field Theory (SymTFT) is a framework to capture universal features of quantum many-body systems by viewing them as a boundary of topological order in one higher dimension. This has yielded numerous insights in static low-energy settings. Here we study what SymTFT can reveal about nonequilibrium, focusing on one-dimensional (1D) periodically driven systems and their 2D SymTFTs. In driven settings, boundary conditions (BCs) can be dynamical and can apply both spatially and temporally. We show how this enters SymTFT via topological operators, which we then use to uncover several new results. These include revealing time crystals (TCs) as systems with symmetry-twisted temporal BCs, robust bulk ``dual TCs" in phases thought to be only boundary TCs, generating drive dualities, or identifying 2D Floquet codes as space-time duals to 1D systems with duality-twisted spatial BCs. We also show how, by making duality-twisted BCs dynamical, non-Abelian braiding of duality defects can enter SymTFT, leading to effects such as the exact pumping of symmetry charges between a system and its BCs. We illustrate our ideas for $\mathbb{Z}_2$-symmetric 1D systems, but our construction applies for any finite Abelian symmetry.

cond-mat.str-el↗