Fetching the paper…
Reading the bibliography…
We present two new color code circuits: one inspired by superdense coding and the other based on a middle-out strategy where the color code state appears halfway between measurements.
“Paths, trees, and flowers”
Jack Edmonds · 1965
Earlier work this paper cites.
“Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states”
Charles. Bennett and Stephen. Wiesner · 1992
Earlier work this paper cites.
“Topological Quantum Distillation”
H. Bombin and M.. Martin-Delgado · 2006
Earlier work this paper cites.
“Surface codes: Towards practical large-scale quantum computation” arXiv:1208.0928
A.. Fowler, M. Mariantoni, J.. Martinis and A.. Cleland · 2012
Earlier work this paper cites.
“Encoding electronic spectra in quantum circuits with linear T complexity”
Ryan Babbush, Craig Gidney, Dominic Berry, Nathan Wiebe, Jarrod McClean, Alexandru Paler, Austin Fowler and Hartmut Neven · 2018
Earlier work this paper cites.
“Neural network decoder for topological color codes with circuit level noise”
P Baireuther, M Caio, B Criger, C Beenakker and T O’Brien · 2019
Earlier work this paper cites.
“Triangular color codes on trivalent graphs with flag qubits”
Christopher Chamberland, Aleksander Kubica, Theodore Yoder and Guanyu Zhu · 2020
Earlier work this paper cites.
“Improved quantum circuits for elliptic curve discrete logarithms”
Thomas Häner, Samuel Jaques, Michael Naehrig, Martin Roetteler and Mathias Soeken · 2020
Cited alongside, same era.
“How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits”
Craig Gidney and Martin Ekerå · 2021
Cited alongside, same era.
“Even More Efficient Quantum Computations of Chemistry Through Tensor Hypercontraction”
Joonho Lee, Dominic. Berry, Craig Gidney, William. Huggins, Jarrod. McClean, Nathan Wiebe and Ryan Babbush · 2021
Cited alongside, same era.
“A Pair Measurement Surface Code on Pentagons”
Craig Gidney · 2022
Cited alongside, same era.
“Decoder for the Triangular Color Code by Matching on a Möbius Strip”
Kaavya Sahay and Benjamin. Brown · 2022
Cited alongside, same era.
“Decoding Merged Color-Surface Codes and Finding Fault-Tolerant Clifford Circuits Using Solvers for Satisfiability Modulo Theories”
“Data for "New circuits and an open source decoder for the color code"”
Craig Gidney and Cody Jones · 2023
Closest in time.
“Sparse Blossom: correcting a million errors per core second with minimum-weight matching”
Oscar Higgott and Craig Gidney · 2023
Closest in time.
“Efficient color code decoders in d ≥ 2 d\geq 2 dimensions from toric code decoders”
Aleksander Kubica and Nicolas Delfosse · 2023
Closest in time.
“Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics”
Matt McEwen, Dave Bacon and Craig Gidney · 2023
Closest in time.
“Steiner tree problem”, 2023
Wikipedia · 2023
Closest in time.
“Fusion Blossom: Fast MWPM Decoders for QEC”
Yue Wu and Lin Zhong · 2023
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Noah Shutty and Christopher Chamberland · 2022
Cited alongside, same era.
“High-threshold and low-overhead fault-tolerant quantum memory”
Sergey Bravyi, Andrew. Cross, Jay. Gambetta, Dmitri Maslov, Patrick Rall and Theodore. Yoder · 2023
Cited alongside, same era.
Closest in time.