Fetching the paper…
Reading the bibliography…
We construct families of Floquet codes derived from colour code tilings of closed hyperbolic surfaces.
On the thickness of graphs of given degree
John H. Halton · 1991
Earlier work this paper cites.
Triangle group representations and constructions of regular maps
Jozef Širáň · 2001
Earlier work this paper cites.
Topological quantum memory
Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill · 2002
Earlier work this paper cites.
Stabilizer formalism for operator quantum error correction
David Poulin · 2005
Earlier work this paper cites.
Operator quantum error-correcting subsystems for self-correcting quantum memories
Dave Bacon · 2006
Earlier work this paper cites.
Topological quantum distillation
H. Bombin and M. A. Martin-Delgado · 2006
Earlier work this paper cites.
Anyons in an exactly solved model and beyond
Alexei Kitaev · 2006
Earlier work this paper cites.
Surface code quantum communication
Austin G. Fowler, David S. Wang, Charles D. Hill, Thaddeus D. Ladd, Rodney Van Meter, and Lloyd C. L. Hollenberg · 2010
Earlier work this paper cites.
Constructions and noise threshold of topological subsystem codes
Martin Suchara, Sergey Bravyi, and Barbara Terhal · 2011
Earlier work this paper cites.
Bounding the distance of quantum surface codes
Ethan Fetaya · 2012
Earlier work this paper cites.
Subsystem surface codes with three-qubit check operators
Sergey Bravyi, Guillaume Duclos-Cianci, David Poulin, and Martin Suchara · 2013
Earlier work this paper cites.
Optimal complexity correction of correlated errors in the surface code
Austin G. Fowler · 2013
Earlier work this paper cites.
Tradeoffs for reliable quantum information storage in surface codes and color codes
Nicolas Delfosse · 2013
Earlier work this paper cites.
Topological quantum computing with a very noisy network and local error rates approaching one percent
Naomi H Nickerson, Ying Li, and Simon C Benjamin · 2013
Earlier work this paper cites.
Minimum weight perfect matching of fault-tolerant topological quantum error correction in average o ( 1 ) o(1) parallel time
Austin G. Fowler · 2014
Earlier work this paper cites.
Large-scale modular quantum-computer architecture with atomic memory and photonic interconnects
C. Monroe, R. Raussendorf, A. Ruthven, K. R. Brown, P. Maunz, L.-M. Duan, and J. Kim · 2014
Earlier work this paper cites.
Freely scalable quantum technologies using cells of 5-to-50 qubits with very lossy and noisy photonic links
Naomi H. Nickerson, Joseph F. Fitzsimons, and Simon C. Benjamin · 2014
Earlier work this paper cites.
Cavity-based quantum networks with single atoms and optical photons
Andreas Reiserer and Gerhard Rempe · 2015
Earlier work this paper cites.
Constructions and noise threshold of hyperbolic surface codes
Nikolas P. Breuckmann and Barbara M. Terhal · 2016
Earlier work this paper cites.
Hyperbolic and semi-hyperbolic surface codes for quantum storage
Nikolas P Breuckmann, Christophe Vuillot, Earl Campbell, Anirudh Krishna, and Barbara M Terhal · 2017
Earlier work this paper cites.
The small stellated dodecahedron code and friends
J. Conrad, C. Chamberland, N. P. Breuckmann, and B. M. Terhal · 2018
Earlier work this paper cites.
Phd thesis: Homological quantum codes beyond the toric code
Nikolas P. Breuckmann · 2018
Earlier work this paper cites.
Hyperbolic lattices in circuit quantum electrodynamics
Alicia J Kollár, Mattias Fitzpatrick, and Andrew A Houck · 2019
Earlier work this paper cites.
A numerical study of bravyi-bacon-shor and subsystem hypergraph product codes
Muyuan Li and Theodore J. Yoder · 2020
Earlier work this paper cites.
Optimization of the surface code design for Majorana-based qubits
Rui Chao, Michael E. Beverland, Nicolas Delfosse, and Jeongwan Haah · 2020
Earlier work this paper cites.
High-rate, high-fidelity entanglement of qubits across an elementary quantum network
L. J. Stephenson, D. P. Nadlinger, B. C. Nichol, S. An, P. Drmota, T. G. Ballance, K. Thirumalai, J. F. Goodwin, D. M. Lucas, and C. J. Ballance · 2020
Earlier work this paper cites.
Waveguide cavity optomagnonics for microwave-to-optics conversion
Na Zhu, Xufeng Zhang, Xu Han, Chang-Ling Zou, Changchun Zhong, Chiao-Hsuan Wang, Liang Jiang, and Hong X. Tang · 2020
Earlier work this paper cites.
Fault-tolerant weighted union-find decoding on the toric code
Shilin Huang, Michael Newman, and Kenneth R. Brown · 2020
Cited alongside, same era.
Quantum low-density parity-check codes
Nikolas P. Breuckmann and Jens Niklas Eberhardt · 2021
Cited alongside, same era.
Fiber bundle codes: Breaking the n1/2 polylog(n) barrier for quantum ldpc codes
Matthew B. Hastings, Jeongwan Haah, and Ryan O’Donnell · 2021
Cited alongside, same era.
Balanced product quantum codes
Nikolas P. Breuckmann and Jens N. Eberhardt · 2021
Cited alongside, same era.
Subsystem codes with high thresholds by gauge fixing and reduced qubit overhead
Oscar Higgott and Nikolas P. Breuckmann · 2021
Cited alongside, same era.
Dynamically Generated Logical Qubits
Matthew B. Hastings and Jeongwan Haah · 2021
Cited alongside, same era.
Hierarchical memories: Simulating quantum ldpc codes with local gates
Christopher A. Pattison, Anirudh Krishna, and John Preskill · 2023
Closest in time.
Floquetifying the colour code
Alex Townsend-Teague, Julio Magdalena de la Fuente, and Markus Kesselring · 2023
Closest in time.
Performance of planar floquet codes with majorana-based qubits
Adam Paetznick, Christina Knapp, Nicolas Delfosse, Bela Bauer, Jeongwan Haah, Matthew B. Hastings, and Marcus P. da Silva · 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.
Fusion blossom: Fast MWPM decoders for QEC
Yue Wu and Lin Zhong · 2023
Closest in time.
Fault-tolerant hyperbolic floquet quantum error correcting codes
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A Fault-Tolerant Honeycomb Memory
Craig Gidney, Michael Newman, Austin Fowler, and Michael Broughton · 2021
Cited alongside, same era.
Planar floquet codes
Christophe Vuillot · 2021
Cited alongside, same era.
Demonstration of the trapped-ion quantum ccd computer architecture
Juan M Pino, Jennifer M Dreiling, Caroline Figgatt, John P Gaebler, Steven A Moses, MS Allman, CH Baldwin, Michael Foss-Feig, D Hayes, K Mayer, et al · 2021
Cited alongside, same era.
Stim: a fast stabilizer circuit simulator
Craig Gidney · 2021
Cited alongside, same era.
Almost-linear time decoding algorithm for topological codes
Nicolas Delfosse and Naomi H. Nickerson · 2021
Cited alongside, same era.
Quantum ldpc codes with almost linear minimum distance
Pavel Panteleev and Gleb Kalachev · 2022
Cited alongside, same era.
Ali Fahimniya, Hossein Dehghani, Kishor Bharti, Sheryl Mathew, Alicia J Kollár, Alexey V Gorshkov, and Michael J Gullans · 2023
Closest in time.
Quantum computation from dynamic automorphism codes
Margarita Davydova, Nathanan Tantivasadakarn, Shankar Balasubramanian, and David Aasen · 2023
Closest in time.
Measurement quantum cellular automata and anomalies in floquet codes
David Aasen, Jeongwan Haah, Zhi Li, and Roger S. K. Mong · 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.
Demonstrating multi-round subsystem quantum error correction using matching and maximum likelihood decoders
Neereja Sundaresan, Theodore J. Yoder, Youngseok Kim, Muyuan Li, Edward H. Chen, Grace Harper, Ted Thorbeck, Andrew W. Cross, Antonio D. Córcoles, and Maika Takita · 2023
Closest in time.
Logical blocks for fault-tolerant topological quantum computation
Héctor Bombín, Chris Dawson, Ryan V. Mishmash, Naomi Nickerson, Fernando Pastawski, and Sam Roberts · 2023
Closest in time.
Spacetime codes of clifford circuits
Nicolas Delfosse and Adam Paetznick · 2023
Closest in time.
Improved decoding of circuit noise and fragile boundaries of tailored surface codes
Oscar Higgott, Thomas C Bohdanowicz, Aleksander Kubica, Steven T Flammia, and Earl T Campbell · 2023
Closest in time.
Ancillary data for hyperbolic and semi-hyperbolic floquet codes
Oscar Higgott and Nikolas P Breuckmann · 2023
Closest in time.
Floquet codes without parent subsystem codes
Margarita Davydova, Nathanan Tantivasadakarn, and Shankar Balasubramanian · 2023
Closest in time.
X-cube floquet code: A dynamical quantum error correcting code with a subextensive number of logical qubits
Zhehao Zhang, David Aasen, and Sagar Vijay · 2023
Closest in time.
Floquet codes and phases in twist-defect networks
Joseph Sullivan, Rui Wen, and Andrew C Potter · 2023
Closest in time.
Partitioning qubits in hypergraph product codes to implement logical gates
Armanda O Quintavalle, Paul Webster, and Michael Vasmer · 2023
Closest in time.
Transversal diagonal logical operators for stabiliser codes
Mark A Webster, Armanda O Quintavalle, and Stephen D Bartlett · 2023
Closest in time.
High-threshold and low-overhead fault-tolerant quantum memory
Sergey Bravyi, Andrew W. Cross, Jay M. Gambetta, Dmitri Maslov, Patrick Rall, and Theodore J. Yoder · 2024
Closest in time.
Constant-overhead fault-tolerant quantum computation with reconfigurable atom arrays
Qian Xu, J. Pablo Bonilla Ataides, Christopher A. Pattison, Nithin Raveendran, Dolev Bluvstein, Jonathan Wurtz, Bane Vasić, Mikhail D. Lukin, Liang Jiang, and Hengyun Zhou · 2024
Closest in time.
Anyon condensation and the color code
Markus S Kesselring, Julio C Magdalena de la Fuente, Felix Thomsen, Jens Eisert, Stephen D Bartlett, and Benjamin J Brown · 2024
Closest in time.
Topological error correcting processes from fixed-point path integrals
Andreas Bauer · 2024
Closest in time.
Engineering 3d floquet codes by rewinding
Arpit Dua, Nathanan Tantivasadakarn, Joseph Sullivan, and Tyler D. Ellison · 2024
Closest in time.
Fault-tolerant connection of error-corrected qubits with noisy links
Joshua Ramette, Josiah Sinclair, Nikolas P Breuckmann, and Vladan Vuletić · 2024
Closest in time.
Fold-Transversal Clifford Gates for Quantum Codes
Nikolas P. Breuckmann and Simon Burton · 2024
Closest in time.