Fetching the paper…
Reading the bibliography…
We present the bicycle architecture, a modular quantum computing framework based on high-rate, low-overhead quantum LDPC codes identified in prior work.
“Gráfok és alkalmazásuk a determinánsok és a halmazok elméletére”
Dénes Kőnig · 1916
Earlier work this paper cites.
“Fault-tolerant quantum computation”
Peter Shor · 1996
Earlier work this paper cites.
“Stabilizer codes and quantum error correction”, 1997
Daniel Gottesman · 1997
Earlier work this paper cites.
“Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer”
Peter. Shor · 1997
Earlier work this paper cites.
“Topological quantum memory”
Eric Dennis, Alexei Kitaev, Andrew Landahl and John Preskill · 2002
Earlier work this paper cites.
“Fault-tolerant quantum computation by anyons”
A Kitaev · 2003
Earlier work this paper cites.
“Universal quantum computation with ideal Clifford gates and noisy ancillas”
Sergey Bravyi and Alexei Kitaev · 2005
Earlier work this paper cites.
“Quantum computing with realistically noisy devices”
Emanuel Knill · 2005
Earlier work this paper cites.
“Quantum Circuit Architecture”
G. Chiribella, G.. D’Ariano and P. Perinotti · 2008
Earlier work this paper cites.
“Thresholds for Topological Codes in the Presence of Loss”
Thomas. Stace, Sean. Barrett and Andrew. Doherty · 2009
Earlier work this paper cites.
“Tradeoffs for reliable quantum information storage in 2D systems”
Sergey Bravyi, David Poulin and Barbara Terhal · 2010
Earlier work this paper cites.
“Surface code quantum computing with error rates over 1%”
David. Wang, Austin. Fowler and Lloyd.. Hollenberg · 2011
Earlier work this paper cites.
“Surface codes: Towards practical large-scale quantum computation”
Austin Fowler, Matteo Mariantoni, John Martinis and Andrew Cleland · 2012
Earlier work this paper cites.
“Surface code quantum computing by lattice surgery”
Clare Horsman, Austin Fowler, Simon Devitt and Rodney Van · 2012
Earlier work this paper cites.
“Leveraging automorphisms of quantum codes for fault-tolerant quantum computation”
Markus Grassl and Martin Roetteler · 2013
Earlier work this paper cites.
“Fast and efficient exact synthesis of single-qubit unitaries generated by clifford and T gates”
Vadym Kliuchnikov, Dmitri Maslov and Michele Mosca · 2013
Earlier work this paper cites.
“Quantum Kronecker sum-product low-density parity-check codes with finite rate”
Alexey Kovalev and Leonid Pryadko · 2013
Earlier work this paper cites.
“Topological quantum computing with a very noisy network and local error rates approaching one percent”
Naomi Nickerson, Ying Li and Simon Benjamin · 2013
Earlier work this paper cites.
“Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength”
Jean-Pierre Tillich and Gilles Zémor · 2013
Earlier work this paper cites.
“Fault-tolerant quantum computation with constant overhead”
Daniel Gottesman · 2014
Earlier work this paper cites.
“Large-scale modular quantum-computer architecture with atomic memory and photonic interconnects”
C Monroe, R Raussendorf, A Ruthven, KR Brown, P Maunz, L-M Duan and J Kim · 2014
Earlier work this paper cites.
“Hardness of decoding quantum stabilizer codes”
Pavithran Iyer and David Poulin · 2015
Earlier work this paper cites.
“Quantum error correction for quantum memories”
Barbara Terhal · 2015
Earlier work this paper cites.
“Improved classical simulation of quantum circuits dominated by Clifford gates”
Sergey Bravyi and David Gosset · 2016
Earlier work this paper cites.
“Multilayer microwave integrated quantum circuits for scalable quantum computing”
Teresa Brecht, Wolfgang Pfaff, Chen Wang, Yiwen Chu, Luigi Frunzio, Michel Devoret and Robert Schoelkopf · 2016
Earlier work this paper cites.
“Trading Classical and Quantum Computational Resources”
Sergey Bravyi, Graeme Smith and John. Smolin · 2016
Earlier work this paper cites.
“Hierarchical surface code for network quantum computing with modules of arbitrary size”
Ying Li and Simon Benjamin · 2016
Earlier work this paper cites.
“Optimal ancilla-free Clifford+T approximation of z-rotations”
Neil. Ross and Peter Selinger · 2016
Earlier work this paper cites.
“Demonstration of Weight-Four Parity Measurements in the Surface Code Architecture”
Maika Takita, A.. Córcoles, Easwar Magesan, Baleegh Abdo, Markus Brink, Andrew Cross, Jerry. Chow and Jay. Gambetta · 2016
Earlier work this paper cites.
“Fault-tolerance thresholds for the surface code with fabrication errors”
James Auger, Hussain Anwar, Mercedes Gimeno-Segovia, Thomas Stace and Dan Browne · 2017
Earlier work this paper cites.
“Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms”
Martin Roetteler, Michael Naehrig, Krysta. Svore and Kristin Lauter · 2017
Earlier work this paper cites.
“Deterministic Remote Entanglement of Superconducting Circuits through Microwave Two-Photon Transitions”
P. Campagne-Ibarcq et al · 2018
Earlier work this paper cites.
“Deterministic teleportation of a quantum gate between two logical qubits”
Kevin. Chou, Jacob. Blumoff, Christopher. Wang, Philip. Reinhold, Christopher. Axline, Yvonne. Gao, L. Frunzio, M.. Devoret, Liang Jiang and R.. Schoelkopf · 2018
Earlier work this paper cites.
“Deterministic quantum state transfer and remote entanglement using microwave photons”
P. Kurpiers et al · 2018
Earlier work this paper cites.
“Qubitization of arbitrary basis quantum chemistry leveraging sparsity and low rank factorization”
Dominic Berry, Craig Gidney, Mario Motta, Jarrod McClean and Ryan Babbush · 2019
Earlier work this paper cites.
“The role of entropy in topological quantum error correction”
Michael Beverland, Benjamin Brown, Michael Kastoryano and Quentin Marolleau · 2019
Earlier work this paper cites.
“Simulation of quantum circuits by low-rank stabilizer decompositions”
Sergey Bravyi, Dan Browne, Padraic Calpin, Earl Campbell, David Gosset and Mark Howard · 2019
Earlier work this paper cites.
“Fault-tolerant magic state preparation with flag qubits”
Christopher Chamberland and Andrew Cross · 2019
Earlier work this paper cites.
“Efficient magic state factories with a catalyzed | C C Z ⟩ |CCZ\textrangle to 2 | T ⟩ 2|T\textrangle transformation”
Craig Gidney and Austin. Fowler · 2019
Earlier work this paper cites.
“Deterministic bidirectional communication and remote entanglement generation between superconducting qubits”
Nelson Leung, Y Lu, S Chakram, RK Naik, N Earnest, R Ma, K Jacobs, AN Cleland and DI Schuster · 2019
Earlier work this paper cites.
“A game of surface codes: Large-scale quantum computing with lattice surgery”
Daniel Litinski · 2019
Earlier work this paper cites.
“Magic State Distillation: Not as Costly as You Think”
Daniel Litinski · 2019
Earlier work this paper cites.
“Quantum error correction: an introductory guide”
Joschka Roffe · 2019
Earlier work this paper cites.
“Code deformation and lattice surgery are gauge fixing”
Christophe Vuillot, Lingling Lao, Ben Criger, Carmenía Almudéver, Koen Bertels and Barbara Terhal · 2019
Earlier work this paper cites.
“Quantum Algorithms for Quantum Chemistry and Quantum Materials Science” PMID: 33090772
Bela Bauer, Sergey Bravyi, Mario Motta and Garnet-Lic Chan · 2020
Earlier work this paper cites.
“Microwave Quantum Link between Superconducting Circuits Housed in Spatially Separated Cryogenic Systems”
P. Magnard et al · 2020
Earlier work this paper cites.
“Decoding across the quantum low-density parity-check code landscape”
Joschka Roffe, David White, Simon Burton and Earl Campbell · 2020
Earlier work this paper cites.
“Quantum Low-Density Parity-Check Codes”
Nikolas. Breuckmann and Jens Eberhardt · 2021
Cited alongside, same era.
“Hadamard-Free Circuits Expose the Structure of the Clifford Group”
Sergey Bravyi and Dmitri Maslov · 2021
Cited alongside, same era.
“Interleaving: Modular architectures for fault-tolerant photonic quantum computing”, 2021
Hector Bombin, Isaac. Kim, Daniel Litinski, Naomi Nickerson, Mihir Pant, Fernando Pastawski, Sam Roberts and Terry Rudolph · 2021
Cited alongside, same era.
“Quantum computing enhanced computational catalysis”
Vera von Burg, Guang Low, Thomas Häner, Damian Steiger, Markus Reiher, Martin Roetteler and Matthias Troyer · 2021
Cited alongside, same era.
Nicolas Delfosse, Michael. Beverland and Maxime. Tremblay · 2021
Cited alongside, same era.
“Logical operators and fold-transversal gates of bivariate bicycle codes”
Jens Eberhardt and Vincent Steffan · 2024
Later among the works it cites.
“Data for "Magic state cultivation: growing T states as cheap as CNOT gates"”
Craig Gidney, Cody Jones and Noah Shutty · 2024
Later among the works it cites.
“Quantum LDPC Codes with Transversal Non-Clifford Gates via Products of Algebraic Codes”, 2024
Louis Golowich and Ting-Chun Lin · 2024
Later among the works it cites.
“ Qualtran
Google Quantum Team · 2024
Later among the works it cites.
“Magic state cultivation: growing T states as cheap as CNOT gates”, 2024
Craig Gidney, Noah Shutty and Cody Jones · 2024
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“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.
“Stim: a fast stabilizer circuit simulator”
Craig Gidney · 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.
“Logical-qubit operations in an error-detecting surface code”
J.. Marques et al · 2021
Cited alongside, same era.
“Degenerate quantum LDPC codes with good finite length performance”
Pavel Panteleev and Gleb Kalachev · 2021
Cited alongside, same era.
“Decomposition of Clifford Gates”
Tefjol Pllaha, Kalle Volanto and Olav Tirkkonen · 2021
Cited alongside, same era.
“Deterministic multi-qubit entanglement in a quantum network”
Youpeng Zhong et al · 2021
Cited alongside, same era.
Matthew. Harrigan, Tanuj Khattar, Charles Yuan, Anurudh Peduri, Noureldin Yosri, Fionn. Malone, Ryan Babbush and Nicholas. Rubin · 2024
Later among the works it cites.
“Fault-tolerant logical measurements via homological measurement”, 2024
Benjamin Ide, Manoj Gowda, Priya Nadkarni and Guillaume Dauphinais · 2024
Later among the works it cites.
“Snakes and Ladders: Adapting the surface code to defects”, 2024
Catherine Leroux, Sophia. Lin, Przemyslaw Bienias, Krishanu. Sankar, Asmae Benhemou, Aleksander Kubica and Joseph. Iverson · 2024
Later among the works it cites.
“Codesign of quantum error-correcting codes and modular chiplets in the presence of defects”
Sophia Lin, Joshua Viszlai, Kaitlin Smith, Gokul Ravi, Charles Yuan, Frederic Chong and Benjamin Brown · 2024
Later among the works it cites.
“Subspace methods for electronic structure simulations on quantum computers”
Mario Motta, William Kirby, Ieva Liepuoniute, Kevin Sung, Jeffrey Cohn, Antonio Mezzacapo, Katherine Klymko, Nam Nguyen, Nobuyuki Yoshioka and Julia Rice · 2024
Later among the works it cites.
“Architecture for fast implementation of qLDPC codes with optimized Rydberg gates”, 2024
C. Poole, T.. Graham, M.. Perlin, M. Otten and M. Saffman · 2024
Later among the works it cites.
“Fault-tolerant connection of error-corrected qubits with noisy links”
Joshua Ramette, Josiah Sinclair, Nikolas Breuckmann and Vladan Vuletić · 2024
Later among the works it cites.
“Fault-Tolerant Logical Clifford Gates from Code Automorphisms”, 2024
Hasan Sayginel, Stergios Koutsioumpas, Mark Webster, Abhishek Rajput and Dan Browne · 2024
Later among the works it cites.
“Assessing the benefits and risks of quantum computers”
Travis Scholten, Carl Williams, Dustin Moody, Michele Mosca, William Hurley, William Zeng, Matthias Troyer and Jay Gambetta · 2024
Later among the works it cites.
“Unveiling clean two-dimensional discrete time quasicrystals on a digital quantum computer”, 2024
Kazuya Shinjo, Kazuhiro Seki, Tomonori Shirakawa, Rong-Yang Sun and Seiji Yunoki · 2024
Later among the works it cites.
“Universal adapters between quantum LDPC codes”
Esha Swaroop, Tomas Jochym-O’Connor and Theodore Yoder · 2024
Later among the works it cites.
“Flag-Proxy Networks: Overcoming the Architectural, Scheduling and Decoding Obstacles of Quantum LDPC Codes”
Suhas Vittal, Ali Javadi-Abhari, Andrew Cross, Lev Bishop and Moinuddin Qureshi · 2024
Later among the works it cites.
“Low-overhead fault-tolerant quantum computation by gauging logical operators”
Dominic. Williamson and Theodore. Yoder · 2024
Later among the works it cites.
“pygridsynth”, 2024
Shuntaro Yamamoto and Nobuyuki Yoshioka · 2024
Later among the works it cites.
“Algorithmic Fault Tolerance for Fast Quantum Computing”, 2024
Hengyun Zhou, Chen Zhao, Madelyn Cain, Dolev Bluvstein, Casey Duckering, Hong-Ye Hu, Sheng-Tao Wang, Aleksander Kubica and Mikhail. Lukin · 2024
Later among the works it cites.
“Adaptive Syndrome Extraction”, 2025
Noah Berthusen, Shi Tan, Eric Huang and Daniel Gottesman · 2025
Closest in time.
“Efficient approaches to characterize rare events in quantum error correction systems”, 2025
Michael Beverland, Malcolm Carroll, Patrick Rall and Ted Yoder · 2025
Closest in time.
“Planar fault-tolerant circuits for non-Clifford gates on the 2D color code”
Andreas Bauer and Julio de Fuente · 2025
Closest in time.
“Parallel Logical Measurements via Quantum Code Surgery”, 2025
Alexander Cowtan, Zhiyang He, Dominic. Williamson and Theodore. Yoder · 2025
Closest in time.
“Universal fault tolerant quantum computation in 2D without getting tied in knots”, 2025
Margarita Davydova, Andreas Bauer, Julio. de Fuente, Mark Webster, Dominic. Williamson and Benjamin. Brown · 2025
Closest in time.
“A Constant Rate Quantum Computer on a Line”, 2025
Craig Gidney and Thiago Bergamaschi · 2025
Closest in time.
“Yoked surface codes”
Craig Gidney, Michael Newman, Peter Brooks and Cody Jones · 2025
Closest in time.
“How to factor 2048 bit RSA integers with less than a million noisy qubits”, 2025
Craig Gidney · 2025
Closest in time.
“Characterising the failure mechanisms of error-corrected quantum logic gates”, 2025
Robin Harper, Constance Lainé, Evan Hockings, Campbell McLauchlan, Georgia. Nixon, Benjamin. Brown and Stephen. Bartlett · 2025
Closest in time.
“Generating logical magic states with the aid of non-Abelian topological order”, 2025
Sheng-Jie Huang and Yanzhu Chen · 2025
Closest in time.
“Extractors: QLDPC Architectures for Efficient Pauli-Based Computation”, 2025
Zhiyang He, Alexander Cowtan, Dominic Williamson and Theodore Yoder · 2025
Closest in time.
Kentaro Heya et al · 2025
Closest in time.
“Network Requirements for Distributed Quantum Computation”
Hugo Jacinto, Élie Gouzien and Nicolas Sangouard · 2025
Closest in time.
“Generalized toric codes on twisted tori for quantum error correction”, 2025
Zijian Liang, Ke Liu, Hao Song and Yu-An Chen · 2025
Closest in time.
“Improved belief propagation is sufficient for real-time decoding of quantum memory”, 2025
Tristan Müller, Thomas Alexander, Thilo Maurer, Michael. Beverland, Markus Bühler and Drew Vandeth · 2025
Closest in time.
“Decision-tree decoders for general quantum LDPC codes”, 2025
Kai Ott, Bence Hetényi and Michael Beverland · 2025
Closest in time.
“Hierarchical memories: simulating quantum LDPC codes with local gates”
Christopher Pattison, Anirudh Krishna and John Preskill · 2025
Closest in time.
“Lowering connectivity requirements for bivariate bicycle codes using morphing circuits”
Mackenzie Shaw and Barbara Terhal · 2025
Closest in time.
“GNU Parallel 20250322 (’Have you said thank you’)”
Ole Tange · 2025
Closest in time.
“Demonstration of low-overhead quantum error correction codes”, 2025
Ke Wang et al · 2025
Closest in time.
“Constant-Overhead Magic State Injection into qLDPC Codes with Error Independence Guarantees”, 2025
Guo Zhang, Yuanye Zhu, Xiao Yuan and Ying Li · 2025
Closest in time.
“Resource Analysis of Low-Overhead Transversal Architectures for Reconfigurable Atom Arrays”, 2025
Hengyun Zhou, Casey Duckering, Chen Zhao, Dolev Bluvstein, Madelyn Cain, Aleksander Kubica, Sheng-Tao Wang and Mikhail. Lukin · 2025
Closest in time.
“Universal fault-tolerant quantum computation with a 2d abelian topological stabilizer code using magic patches”, 2025
Guanyu Zhu, Tomas Jochym-O’Connor, Arpit Dua and Maissam Barkeshli · 2025
Closest in time.
Guanyu Zhu · 2025
Closest in time.
“Time-Efficient Logical Operations on Quantum Low-Density Parity Check Codes”
Guo Zhang and Ying Li · 2025
Closest in time.
“Lower bounds on the non-Clifford resources for quantum computations”
Michael Beverland, Earl Campbell, Mark Howard and Vadym Kliuchnikov · 2058
Closest in time.