123 citations · 785 across the 28 of their papers we have counts for
30 papers · 1 filter
Low-Overhead Quantum Error Correction with Boundary-Connected Planar Modules
Oscar Higgott, Hasan Sayginel, Francisco J. H. Heras +11
Realizing practical quantum computers requires quantum error correction, but the most widely implemented approach, the planar surface code, demands a substantial physical qubit ove…
In-Situ Simultaneous Magic State Injection on Arbitrary CSS qLDPC Codes
Kun Liu, Shifan Xu, Tomas Jochym-O'Connor +3
Quantum low-density parity-check (qLDPC) codes can encode many logical qubits within a single code block at low physical qubit overhead, yet magic state injection into such codes r…
Constant-Time Surgery on 2D Hypergraph Product Codes with Near-Constant Space Overhead
Kathleen Chang, Zhiyang He, Theodore J. Yoder +2
Generalized code surgery is a versatile and low-overhead technique for performing fault-tolerant computation on quantum low-density parity-check (qLDPC) codes. In many settings, su…
Adaptive Channel Reshaping for Improved Entanglement Distillation
Dina Abdelhadi, Tomas Jochym-O'Connor, Vikesh Siddhu +1
Quantum communication and computation heavily rely on entanglement distillation protocols. There is a plethora of distillation protocols for Pauli channels and also for some non-Pa…
Universal adapters between quantum LDPC codes
Esha Swaroop, Tomas Jochym-O'Connor, Theodore J. Yoder
We propose the repetition code adapter as a way to perform joint logical Pauli measurements within a quantum low-density parity check (LDPC) codeblock or between separate such code…
Entanglement sharing across a damping-dephasing channel
Vikesh Siddhu, Dina Abdelhadi, Tomas Jochym-O'Connor +1
Entanglement distillation is a fundamental information processing task whose implementation is key to quantum communication and modular quantum computing. Noise experienced by such…
Encoding a magic state with beyond break-even fidelity
Riddhi S. Gupta, Neereja Sundaresan, Thomas Alexander +10
To run large-scale algorithms on a quantum computer, error-correcting codes must be able to perform a fundamental set of operations, called logic gates, while isolating the encoded…
Phase diagram of the three-dimensional subsystem toric code
Yaodong Li, C. W. von Keyserlingk, Guanyu Zhu +1
Subsystem quantum error-correcting codes typically involve measuring a sequence of non-commuting parity check operators. They can sometimes exhibit greater fault-tolerance than con…
Homomorphic Logical Measurements
Shilin Huang, Tomas Jochym-O'Connor, Theodore J. Yoder
Shor and Steane ancilla are two well-known methods for fault-tolerant logical measurements, which are successful on small codes and their concatenations. On large quantum low-densi…
Quantum error correction with fractal topological codes
Arpit Dua, Tomas Jochym-O'Connor, Guanyu Zhu
Recently, a class of fractal surface codes (FSCs), has been constructed on fractal lattices with Hausdorff dimension , which admits a fault-tolerant non-Clifford CCZ gate. We…
Topological Order, Quantum Codes and Quantum Computation on Fractal Geometries
Guanyu Zhu, Tomas Jochym-O'Connor, Arpit Dua
We investigate topological order on fractal geometries embedded in dimensions. In particular, we diagnose the existence of the topological order through the lens of quantum inf…
A four-dimensional toric code with non-Clifford transversal gates
Tomas Jochym-O'Connor, Theodore J. Yoder
The design of a four-dimensional toric code is explored with the goal of finding a lattice capable of implementing a logical gate transversally. The established lat…
Fault-tolerant gates via homological product codes
Tomas Jochym-O'Connor
A method for the implementation of a universal set of fault-tolerant logical gates is presented using homological product codes. In particular, it is shown that one can fault-toler…
Advantages of versatile neural-network decoding for topological codes
Nishad Maskara, Aleksander Kubica, Tomas Jochym-O'Connor
Finding optimal correction of errors in generic stabilizer codes is a computationally hard problem, even for simple noise models. While this task can be simplified for codes with s…
The disjointness of stabilizer codes and limitations on fault-tolerant logical gates
Tomas Jochym-O'Connor, Aleksander Kubica, Theodore J. Yoder
Stabilizer codes are a simple and successful class of quantum error-correcting codes. Yet this success comes in spite of some harsh limitations on the ability of these codes to fau…
Error suppression via complementary gauge choices in Reed-Muller codes
Christopher Chamberland, Tomas Jochym-O'Connor
Concatenation of two quantum error correcting codes with complementary sets of transversal gates can provide a means towards universal fault-tolerant computation. We first show tha…
Comparison of memory thresholds for planar qudit geometries
Jacob Marks, Tomas Jochym-O'Connor, Vlad Gheorghiu
We introduce and analyze a new type of decoding algorithm called General Color Clustering (GCC), based on renormalization group methods, to be used in qudit color codes. The perfor…
Overhead analysis of universal concatenated quantum codes
Christopher Chamberland, Tomas Jochym-O'Connor, Raymond Laflamme
We analyze the resource overhead of recently proposed methods for universal fault-tolerant quantum computation using concatenated codes. Namely, we examine the concatenation of the…
Thresholds for universal concatenated quantum codes
Christopher Chamberland, Tomas Jochym-O'Connor, Raymond Laflamme
Quantum error correction and fault-tolerance make it possible to perform quantum computations in the presence of imprecision and imperfections of realistic devices. An important qu…
Private Quantum Subsystems and Quasiorthogonal Operator Algebras
Jeremy Levick, Tomas Jochym-O'Connor, David Kribs +2
We generalize a recently discovered example of a private quantum subsystem to find private subsystems for Abelian subgroups of the -qubit Pauli group, which exist in the absence…
Stacked codes: universal fault-tolerant quantum computation in a two-dimensional layout
Tomas Jochym-O'Connor, Stephen D. Bartlett
We introduce a class of 3D color codes, which we call stacked codes, together with a fault-tolerant transformation that will map logical qubits encoded in two-dimensional (2D) colo…
On the robustness of bucket brigade quantum RAM
Srinivasan Arunachalam, Vlad Gheorghiu, Tomas Jochym-O'Connor +2
We study the robustness of the bucket brigade quantum random access memory model introduced by Giovannetti, Lloyd, and Maccone [Phys. Rev. Lett. 100, 160501 (2008)]. Due to a resul…
NMR quantum information processing
Dawei Lu, Aharon Brodutch, Jihyun Park +3
Quantum computing exploits fundamentally new models of computation based on quantum mechanical properties instead of classical physics, and it is believed that quantum computers ar…
Classification of transversal gates in qubit stabilizer codes
Jonas T. Anderson, Tomas Jochym-O'Connor
This work classifies the set of diagonal gates that can implement a single or two-qubit transversal logical gate for qubit stabilizer codes. We show that individual physical gates…