Brad Lackey

Brad Lackey

Auto-generated profile, based on publicly available information

Brad Lackey

Microsoft Quantum Redmond WA USA

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 May 2022 in PRX Quantum
Verified
Journal Article
Open access
PDF file
CCChunJun Cao
ChunJun Cao
BLBrad Lackey
Brad Lackey
We introduce a flexible and graphically intuitive framework that constructs complex quantum error correction codes from simple codes or states, generalizing code concatenation. More specifically, we represent the complex code constructions as tensor networks built from the tensors of simple codes or states in a modular fashion. Using a set of local moves known as operator pushing, one can derive properties of the more complex codes, such as transversal non-Clifford gates, by tracing the flow of operators in the network. The framework endows a network geometry to any code it builds and is valid for constructing stabilizer codes as well as nonstabilizer codes over qubits and qudits. For a contractible tensor network, the sequence of contractions also constructs a decoding or encoding circuit. To highlight the framework’s range of capabilities and to provide a tutorial, we lay out some examples where we glue together simple stabilizer codes to construct nontrivial codes. These examples include the toric code and its variants, a holographic code with transversal non-Clifford operators, a three-dimensional stabilizer code, and other stabilizer codes with interesting properties. Surprisingly, we find that the surface code is equivalent to the two-dimensional Bacon-Shor code after “dualizing” its tensor-network encoding map.

14 May 2021 in Journal of High Energy Physics
Verified
Journal Article
Open access
PDF file
CCChunJun Cao
ChunJun Cao
BLBrad Lackey
Brad Lackey
We explicitly construct a class of holographic quantum error correction codes with non-trivial centers in the code subalgebra. Specifically, we use the Bacon-Shor codes and perfect tensors to construct a gauge code (or a stabilizer code with gauge-fixing), which we call the holographic hybrid code. This code admits a local log-depth encoding/decoding circuit, and can be represented as a holographic tensor network which satisfies an analog of the Ryu-Takayanagi formula and reproduces features of the sub-region duality. We then construct approximate versions of the holographic hybrid codes by “skewing” the code subspace, where the size of skewing is analogous to the size of the gravitational constant in holography. These approximate hybrid codes are not necessarily stabilizer codes, but they can be expressed as the superposition of holographic tensor networks that are stabilizer codes. For such constructions, different logical states, representing different bulk matter content, can “back-react” on the emergent geometry, resembling a key feature of gravity. The locality of the bulk degrees of freedom becomes subspace-dependent and approximate. Such subspace-dependence is manifest from the point of view of the “entanglement wedge” and bulk operator reconstruction from the boundary. Exact complementary error correction breaks down for certain bipartition of the boundary degrees of freedom; however, a limited, state-dependent form is preserved for particular subspaces. We also construct an example where the connected two-point correlation functions can have a power-law decay. Coupled with known constraints from holography, a weakly back-reacting bulk also forces these skewed tensor network models to the “large N limit” where they are built by concatenating a large N number of copies.

7 December 2023 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
CCChunJun Cao
ChunJun Cao
BLBrad Lackey
Brad Lackey
We examine the use of weight enumerators for analyzing tensor network constructions, and specifically the quantum lego framework recently introduced. We extend the notion of quantum weight enumerators to so-called tensor enumerators, and prove that the trace operation on tensor networks is compatible with a trace operation on tensor enumerators. This allows us to compute quantum weight enumerators of larger codes, such as the ones constructed through tensor network methods, more efficiently. We also provide a general framework for quantum MacWilliams identities that includes tensor enumerators as a special case.

27 March 2025 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
AKAlon Kukliansky
Alon Kukliansky
BLBrad Lackey
Brad Lackey
We extend the recently introduced notion of tensor enumerator to the circuit enumerator. We provide a mathematical framework that offers a novel method for analyzing circuits and error models without resorting to Monte Carlo techniques. We introduce an analogue of the Poisson summation formula for stabilizer codes, facilitating a method for the exact computation of the number of error paths within the syndrome extraction circuit of the code that does not require direct enumeration. We demonstrate the efficacy of our approach by explicitly providing the exact number of error paths in a distance five surface code under various error models, a task infeasible via direct enumeration. We also show our circuit enumerator is related to the process matrix of a channel through a type of MacWilliams identity.

17 July 2025 in arXiv
Verified
Preprint
Open access
PDF file
CCChunJun Cao
ChunJun Cao
BLBrad Lackey
Brad Lackey
It is generally unclear whether smaller codes can be "concatenated" to systematically create quantum LDPC codes or their sparse subsystem code cousins where the degree of the Tanner graph remains bounded while increasing the code distance. In this work, we use a slight generalization of concatenation called conjoining introduced by the quantum lego formalism. We show that by conjoining only quantum repetition codes, one can construct quantum LDPC codes. More generally, we provide an efficient iterative algorithm for constructing sparse subsystem codes with a distance guarantee that asymptotically saturates $kd^2=O(n)$ in the worst case. Furthermore, we show that the conjoining of even just two-qubit quantum bit-flip and phase-flip repetition codes is quite powerful as they can create any CSS code. Therefore, more creative combinations of these basic code blocks will be sufficient for generating good quantum codes, including good quantum LDPC codes.

23 July 2026 in Quantum
Verified
Journal Article
Open access
PDF file
ASAarthi Sundaram
Aarthi Sundaram
RRRobert Rand
Robert Rand
KSKartik Singhal
Kartik Singhal
YCYoungchan Cho
Youngchan Cho
BLBrad Lackey
Brad Lackey
We show that Gottesman's (1998) semantics for Clifford circuits based on the Heisenberg representation gives rise to a lightweight Hoare-like logic for efficiently characterizing a common subset of quantum programs. Our applications include (i) certifying whether auxiliary qubits can be safely disposed of, (ii) determining if a system is separable across a given bipartition, (iii) checking the transversality of a gate with respect to a given stabilizer code, and (iv) computing post-measurement states for computational basis measurements. Further, this logic is extended to accommodate universal quantum computing by deriving Hoare triples for the T -gate, multiply-controlled unitaries such as the Toffoli gate, and some gate injection circuits that use associated magic states. A number of interesting results emerge from this logic, including a lower bound on the number of T gates necessary to perform a multiply-controlled Z gate.