295 citations · 399 across the 8 of their papers we have counts for
8 papers
Repeated ancilla reuse for logical computation on a neutral atom quantum computer
J. A. Muniz, D. Crow, H. Kim +59
Quantum processors based on neutral atoms trapped in arrays of optical tweezers have appealing properties, including relatively easy qubit number scaling and the ability to enginee…
High-fidelity universal gates in the Yb ground state nuclear spin qubit
J. A. Muniz, M. Stone, D. T. Stack +50
Arrays of optically trapped neutral atoms are a promising architecture for the realization of quantum computers. In order to run increasingly complex algorithms, it is advantageous…
Fault-tolerant quantum computation with a neutral atom processor
Ben W. Reichardt, Adam Paetznick, David Aasen +69
Quantum computing experiments are transitioning from running on physical qubits to using encoded, logical qubits. Fault-tolerant computation can identify and correct errors, and ha…
Quantum Subspace Correction for Constraints
Kelly Ann Pawlak, Jeffrey M. Epstein, Daniel Crow +4
We demonstrate that it is possible to construct operators that stabilize the constraint-satisfying subspaces of computational problems in their Ising representations. We provide an…
Improved decoding of circuit noise and fragile boundaries of tailored surface codes
Oscar Higgott, Thomas C. Bohdanowicz, Aleksander Kubica +2
Realizing the full potential of quantum computation requires quantum error correction (QEC), with most recent breakthrough demonstrations of QEC using the surface code. QEC codes u…
Building a fault-tolerant quantum computer using concatenated cat codes
Christopher Chamberland, Kyungjoo Noh, Patricio Arrangoiz-Arriola +13
We present a comprehensive architectural analysis for a proposed fault-tolerant quantum computer based on cat codes concatenated with outer quantum error-correcting codes. For the…
Good approximate quantum LDPC codes from spacetime circuit Hamiltonians
Thomas C. Bohdanowicz, Elizabeth Crosson, Chinmay Nirkhe +1
We study approximate quantum low-density parity-check (QLDPC) codes, which are approximate quantum error-correcting codes specified as the ground space of a frustration-free local…
Universal Hamiltonians for Exponentially Long Simulation
Thomas C. Bohdanowicz, Fernando G. S. L. Brandão
We construct a Hamiltonian whose dynamics simulate the dynamics of every other Hamiltonian up to exponentially long times in the system size. The Hamiltonian is time-independent, l…