8 citations · 9 across the 9 of their papers we have counts for
12 papers · 1 filter
Parallel algebraic surgery for qLDPC codes with constant shuttling depth
Tian-Gang Zhou, Boren Gu, Jens Eisert +1
Reconfigurable atom arrays provide a promising platform for high-rate quantum low-density parity-check codes, but their computational advantage depends on whether logical operation…
Universal quantum coding
Jacopo Rizzo, Ludovico Lami, Filippo Girardi +2
Entanglement distillation from noisy bipartite states and reliable quantum communication over noisy channels are fundamental tasks in quantum information theory. Yet existing codin…
Ultra-high-distance quantum memories from amplified qLDPC codes
Zijian Liang, Boren Gu, Yu-An Chen +2
A large code distance does not by itself guarantee a well-protected quantum memory, as faults during syndrome extraction can propagate into correlated data errors. Certifying circu…
Approximability limits for bounded-degree max-LINSAT and implications for decoded quantum interferometry
Maximilian J. Kramer, Carsten Schubert, Jens Eisert
For general max-k-XORSAT with , no polynomial-time algorithm can do substantially better than random guessing on worst-case instances unless : a…
Detecting entanglement from few partial transpose moments and their decay via weight enumerators
Daniel Miller, Jens Eisert
The -PPT criterion is an experimentally viable relaxation of the well-known positive partial transposition (PPT) criterion for the certification of quantum entanglement. Recen…
High-threshold decoding of non-Pauli codes for 2D universality
Julio C. Magdalena de la Fuente, Noa Feldman, Jens Eisert +1
Topological codes have many desirable properties that allow fault-tolerant quantum computation with relatively low overhead. A core challenge for these codes, however, is to achiev…
Tight inapproximability of max-LINSAT and implications for decoded quantum interferometry
Maximilian J. Kramer, Carsten Schubert, Jens Eisert
We establish tight inapproximability bounds for max-LINSAT, the problem of maximizing the number of satisfied linear constraints over the finite field , where each co…
QGPU: Parallel logic in quantum LDPC codes
Boren Gu, Andy Zeyi Liu, Armanda O. Quintavalle +3
Quantum error correction is critical to the design and manufacture of scalable quantum computing systems. Recently, there has been growing interest in quantum low-density parity-ch…
The unbearable hardness of deciding about magic
Lorenzo Leone, Jens Eisert, Salvatore F. E. Oliviero
Identifying the boundary between classical and quantum computation is a central challenge in quantum information. In multi-qubit systems, entanglement and magic are the key resourc…
Chasing shadows with Gottesman-Kitaev-Preskill codes
Jonathan Conrad, Jens Eisert, Steven T. Flammia
We consider the task of performing shadow tomography of a logical subsystem defined via the Gottesman-Kitaev-Preskill (GKP) error correcting code. Our protocol does not require the…
Good Gottesman-Kitaev-Preskill codes from the NTRU cryptosystem
Jonathan Conrad, Jens Eisert, Jean-Pierre Seifert
We introduce a new class of random Gottesman-Kitaev-Preskill (GKP) codes derived from the cryptanalysis of the so-called NTRU cryptosystem. The derived codes are good in that they…
Gottesman-Kitaev-Preskill codes: A lattice perspective
Jonathan Conrad, Jens Eisert, Francesco Arzani
We examine general Gottesman-Kitaev-Preskill (GKP) codes for continuous-variable quantum error correction, including concatenated GKP codes, through the lens of lattice theory, in…