From a22d56d2bbd427c344d34d546c0e4d372dee0994 Mon Sep 17 00:00:00 2001
From: Timo <41513434+timohillmann@users.noreply.github.com>
Date: Sat, 29 Jun 2024 11:15:24 +0200
Subject: [PATCH] update papers!

---
 _bibliography/papers.bib           | 31 ++++++++++++++++++++++++++++++
 _news/announcement_radial_codes.md | 10 ++++++++++
 _news/preprint_lsd_decoder.md      |  9 +++++++++
 3 files changed, 50 insertions(+)
 create mode 100644 _news/announcement_radial_codes.md
 create mode 100644 _news/preprint_lsd_decoder.md

diff --git a/_bibliography/papers.bib b/_bibliography/papers.bib
index 8bb34df..6c80c79 100644
--- a/_bibliography/papers.bib
+++ b/_bibliography/papers.bib
@@ -52,6 +52,22 @@ @article{hillmann_designing_2022
   archiveprefix = {arxiv}
 }
 
+@preprint{hillmann_localized_2024,
+  title = {Localized statistics decoding: A parallel decoding algorithm for quantum low-density parity-check codes},
+  shorttitle = {Localized statistics decoding},
+  author = {Hillmann, Timo and Berent, Lucas and Quintavalle, Armanda O. and Eisert, Jens and Wille, Robert and Roffe, Joschka},
+  year = {2024},
+  month = jun,
+  number = {arXiv:2406.18655},
+  eprint = {2406.18655},
+  primaryclass = {quant-ph},
+  publisher = {arXiv},
+  url = {http://arxiv.org/abs/2406.18655},
+  urldate = {2024-06-28},
+  abstract = {Quantum low-density parity-check codes are a promising candidate for fault-tolerant quantum computing with considerably reduced overhead compared to the surface code. However, the lack of a practical decoding algorithm remains a barrier to their implementation. In this work, we introduce localized statistics decoding, a reliability-guided inversion decoder that is highly parallelizable and applicable to arbitrary quantum low-density parity-check codes. Our approach employs a parallel matrix factorization strategy, which we call on-the-fly elimination, to identify, validate, and solve local decoding regions on the decoding graph. Through numerical simulations, we show that localized statistics decoding matches the performance of state-of-the-art decoders while reducing the runtime complexity for operation in the sub-threshold regime. Importantly, our decoder is more amenable to implementation on specialized hardware, positioning it as a promising candidate for decoding real-time syndromes from experiments.},
+  archiveprefix = {arxiv}
+}
+
 @article{hillmann_performance_2022,
   ids = {hillmann_performance_2021},
   title = {Performance of Teleportation-Based Error-Correction Circuits for Bosonic Codes with Noisy Measurements},
@@ -139,3 +155,18 @@ @article{lu_resolving_2023
   copyright = {2023 The Author(s)},
   langid = {english}
 }
+
+@preprint{scruby_high-threshold_2024,
+  title = {High-threshold, low-overhead and single-shot decodable fault-tolerant quantum memory},
+  author = {Scruby, Thomas R. and Hillmann, Timo and Roffe, Joschka},
+  year = {2024},
+  month = jun,
+  number = {arXiv:2406.14445},
+  eprint = {2406.14445},
+  primaryclass = {quant-ph},
+  publisher = {arXiv},
+  url = {http://arxiv.org/abs/2406.14445},
+  urldate = {2024-06-21},
+  abstract = {We present a new family of quantum low-density parity-check codes, which we call radial codes, obtained from the lifted product of a specific subset of classical quasi-cyclic codes. The codes are defined using a pair of integers \$(r,s)\$ and have parameters \$[{\textbackslash}![2r{\textasciicircum}2s,2(r-1){\textasciicircum}2,{\textbackslash}leq2s]{\textbackslash}!]\$, with numerical studies suggesting average-case distance linear in \$s\$. In simulations of circuit-level noise, we observe comparable error suppression to surface codes of similar distance while using approximately five times fewer physical qubits. This is true even when radial codes are decoded using a single-shot approach, which can allow for faster logical clock speeds and reduced decoding complexity. We describe an intuitive visual representation, canonical basis of logical operators and optimal-length stabiliser measurement circuits for these codes, and argue that their error correction capabilities, tunable parameters and small size make them promising candidates for implementation on near-term quantum devices.},
+  archiveprefix = {arxiv}
+}
diff --git a/_news/announcement_radial_codes.md b/_news/announcement_radial_codes.md
new file mode 100644
index 0000000..316bd37
--- /dev/null
+++ b/_news/announcement_radial_codes.md
@@ -0,0 +1,10 @@
+---
+layout: post
+date: 2024-06-21 15:59:00-0400
+inline: true
+related_posts: false
+---
+
+Together with Thomas R. Scruby and Joschka Roffe we have proposed a new family of quantum LDPC codes which we call _quantum radial codes_.
+These codes are based on a family of classical quasi-cyclic LDPC codes and have a high-threshold, low-overhead, and are single-shot decodable under a circuit-level noise model.
+Find out more in our [preprint][https://arxiv.org/abs/2406.14445] on the arXiv.
diff --git a/_news/preprint_lsd_decoder.md b/_news/preprint_lsd_decoder.md
new file mode 100644
index 0000000..246ac45
--- /dev/null
+++ b/_news/preprint_lsd_decoder.md
@@ -0,0 +1,9 @@
+---
+layout: post
+date: 2024-06-28 8:59:00-0400
+inline: true
+related_posts: false
+---
+
+We are happy to release LSD to the masses! Localized statistics decoding (LSD) is a reliability-guided inversion decoder that is highly parallelizable and applicable to arbitrary quantum low-density parity-check codes. Our approach employs a parallel matrix factorization strategy, which we call _on-the-fly elimination_, to identify, validate, and solve local decoding regions on the decoding graph.
+Read more about the details in our [preprint][https://arxiv.org/abs/2406.18655] or check out the [code][https://github.com/quantumgizmos/ldpc_v2] on GitHub.