296 citations · 546 across the 13 of their papers we have counts for
10 papers · 1 filter
Efficient Soft-Output Guessing for Enhanced Quantum Tanner Code Decoding
Lukas Rapp, Muriel Médard, Eugene Tang +1
We introduce a generalized low-density parity-check decoding framework for quantum Tanner codes utilizing soft-output guessing random additive noise decoding (SOGRAND). By soft-out…
Layer codes as partially self-correcting quantum memories
Shouzhen Gu, Libor Caha, Shin Ho Choe +3
We investigate layer codes, a family of three-dimensional stabilizer codes that can achieve optimal scaling of code parameters and a polynomial energy barrier, as candidates for se…
Optimal Locality and Parameter Tradeoffs for Subsystem Codes
Samuel Dai, Ray Li, Eugene Tang
We study the tradeoffs between the locality and parameters of subsystem codes. We prove lower bounds on both the number and lengths of interactions in any -dimensional embedding…
Strategies for running the QAOA at hundreds of qubits
Brandon Augustino, Madelyn Cain, Edward Farhi +5
We explore strategies aimed at reducing the amount of computation, both quantum and classical, required to run the Quantum Approximate Optimization Algorithm (QAOA). First, followi…
Single-shot decoding of good quantum LDPC codes
Shouzhen Gu, Eugene Tang, Libor Caha +3
Quantum Tanner codes constitute a family of quantum low-density parity-check (LDPC) codes with good parameters, i.e., constant encoding rate and relative distance. In this article,…
The QAOA gets stuck starting from a good classical string
Madelyn Cain, Edward Farhi, Sam Gutmann +2
The Quantum Approximate Optimization Algorithm (QAOA) is designed to maximize a cost function over bit strings. While the initial state is traditionally a uniform superposition ove…
An efficient decoder for a linear distance quantum LDPC code
Shouzhen Gu, Christopher A. Pattison, Eugene Tang
Recent developments have shown the existence of quantum low-density parity check (qLDPC) codes with constant rate and linear distance. A natural question concerns the efficient dec…
Hybrid quantum-classical algorithms for approximate graph coloring
Sergey Bravyi, Alexander Kliesch, Robert Koenig +1
We show how to apply the recursive quantum approximate optimization algorithm (RQAOA) to MAX--CUT, the problem of finding an approximate -vertex coloring of a graph. We compa…
Obstacles to State Preparation and Variational Optimization from Symmetry Protection
Sergey Bravyi, Alexander Kliesch, Robert Koenig +1
Local Hamiltonians with topological quantum order exhibit highly entangled ground states that cannot be prepared by shallow quantum circuits. Here, we show that this property may e…
Quantum Error-Detection at Low Energies
Martina Gschwendtner, Robert Koenig, Burak Şahinoğlu +1
Motivated by the close relationship between quantum error-correction, topological order, the holographic AdS/CFT duality, and tensor networks, we initiate the study of approximate…