Fetching the paper…
Reading the bibliography…
Quantum technologies have the potential to solve certain computationally hard problems with polynomial or super-polynomial speedups when compared to classical methods.
“Paths, trees, and flowers”
Jack Edmonds · 1965
Earlier work this paper cites.
“Mathematical games”
Martin Gardner · 1970
Earlier work this paper cites.
“Completely positive linear maps on complex matrices”
Man-Duen Choi · 1975
Earlier work this paper cites.
“Efficiency of a good but not linear set union algorithm”
Robert Endre Tarjan · 1975
Earlier work this paper cites.
“Completely positive dynamical semigroups of N-level systems”
Vittorio Gorini, Andrzej Kossakowski, and E. C. G. Sudarshan · 1976
Earlier work this paper cites.
“On the generators of quantum dynamical semigroups”
G. Lindblad · 1976
Earlier work this paper cites.
“Simulating physics with computers”
Richard P Feynman · 1982
Earlier work this paper cites.
“Statistical mechanics of cellular automata”
Stephen Wolfram · 1983
Earlier work this paper cites.
“Quantum cryptography: Public key distribution and coin tossing”
C. H. Bennett and G. Brassard · 1984
Earlier work this paper cites.
“Techniques for estimating the bit error rate in the simulation of digital communication systems”
M. Jeruchim · 1984
Earlier work this paper cites.
“The complexity of optimization problems”
Mark W. Krentel · 1988
Earlier work this paper cites.
“Quantum cryptography based on bell’s theorem”
Artur K. Ekert · 1991
Earlier work this paper cites.
“Algorithms for quantum computation: discrete logarithms and factoring”
P.W. Shor · 1994
Earlier work this paper cites.
“Scheme for reducing decoherence in quantum computer memory”
Peter W. Shor · 1995
Earlier work this paper cites.
“Soft-decision decoding of linear block codes based on ordered statistics”
M.P.C. Fossorier and Shu Lin · 1995
Earlier work this paper cites.
“Good quantum error-correcting codes exist”
A. R. Calderbank and Peter W. Shor · 1996
Earlier work this paper cites.
“Multiple-particle interference and quantum error correction”
Andrew Steane · 1996
Earlier work this paper cites.
“Stabilizer codes and quantum error correction”
Daniel Gottesman · 1997
Earlier work this paper cites.
“Theory of quantum error-correcting codes”
Emanuel Knill and Raymond Laflamme · 1997
Earlier work this paper cites.
“Codes for the quantum erasure channel”
M. Grassl, Th. Beth, and T. Pellizzari · 1997
Earlier work this paper cites.
“Quantum computations: algorithms and error correction”
A. Yu Kitaev · 1997
Earlier work this paper cites.
“Quantum-channel capacity of very noisy channels”
David P. DiVincenzo, Peter W. Shor, and John A. Smolin · 1998
Earlier work this paper cites.
“Quantum codes on a lattice with boundary” (1998)
Sergey Bravyi and Alexei Y. Kitaev · 1998
Earlier work this paper cites.
“Resilient quantum computation”
Emanuel Knill, Raymond Laflamme, and Wojciech H. Zurek · 1998
Earlier work this paper cites.
“The heisenberg representation of quantum computers”
D Gottesman · 1998
Earlier work this paper cites.
“Probabilistic reasoning in intelligent systems”
Judea Pearl · 1998
Earlier work this paper cites.
“Low density parity check codes over gf(q)”
M.C. Davey and D.J.C. MacKay · 1998
Earlier work this paper cites.
“A one-way quantum computer”
Robert Raussendorf and Hans J. Briegel · 2001
Earlier work this paper cites.
“Factor graphs and the sum-product algorithm”
F.R. Kschischang, B.J. Frey, and H.-A. Loeliger · 2001
Earlier work this paper cites.
“On the design of low-density parity-check codes within 0.0045 db of the shannon limit”
Sae-Young Chung, G.D. Forney, T.J. Richardson, and R. Urbanke · 2001
Earlier work this paper cites.
“Iterative reliability-based decoding of low-density parity check codes”
M.P.C. Fossorier · 2001
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.Yu. Kitaev · 2003
Earlier work this paper cites.
“Confinement-higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory”
Chenyang Wang, Jim Harrington, and John Preskill · 2003
Earlier work this paper cites.
“Sparse-graph codes for quantum error correction”
D.J.C. MacKay, G. Mitchison, and P.L. McFadden · 2004
Earlier work this paper cites.
“Analysis of quantum error-correcting codes: Symplectic lattice codes and toric codes”
James W. Harrington · 2004
Earlier work this paper cites.
“Fundamentals of wireless communication”
David Tse and Pramod Viswanath · 2005
Earlier work this paper cites.
“Topological quantum distillation”
H. Bombin and M. A. Martin-Delgado · 2006
Earlier work this paper cites.
“Correcting quantum errors with entanglement”
Todd Brun, Igor Devetak, and Min-Hsiu Hsieh · 2006
Earlier work this paper cites.
“Operator quantum error-correcting subsystems for self-correcting quantum memories”
Dave Bacon · 2006
Earlier work this paper cites.
“Fault-tolerant quantum computation with high threshold in two dimensions”
Robert Raussendorf and Jim Harrington · 2007
Earlier work this paper cites.
“Optimal resources for topological two-dimensional stabilizer codes: Comparative study”
H. Bombin and M. A. Martin-Delgado · 2007
Earlier work this paper cites.
“Continuous quantum error correction for non-markovian decoherence”
Ognyan Oreshkov and Todd A. Brun · 2007
Earlier work this paper cites.
“Symmetrized characterization of noisy quantum processes”
Joseph Emerson, Marcus Silva, Osama Moussa, Colm Ryan, Martin Laforest, Jonathan Baugh, David G. Cory, and Raymond Laflamme · 2007
Earlier work this paper cites.
“Computational complexity of projected entangled pair states”
Norbert Schuch, Michael M. Wolf, Frank Verstraete, and J. Ignacio Cirac · 2007
Earlier work this paper cites.
“Quantum computing with trapped ions”
H. Häffner, C.F. Roos, and R. Blatt · 2008
Earlier work this paper cites.
“Fault-tolerant quantum computation with constant error rate”
Dorit Aharonov and Michael Ben-Or · 2008
Earlier work this paper cites.
“Scalable protocol for identification of correctable codes”
M. Silva, E. Magesan, D. W. Kribs, and J. Emerson · 2008
Earlier work this paper cites.
“On the iterative decoding of sparse quantum codes”
David Poulin and Yeojin Chung · 2008
Earlier work this paper cites.
“Measurement-based quantum computation”
H. J. Briegel, D. E. Browne, W. Dür, R. Raussendorf, and M. Van den Nest · 2009
Earlier work this paper cites.
“Quantum serial turbo codes”
David Poulin, Jean-Pierre Tillich, and Harold Ollivier · 2009
Earlier work this paper cites.
“High-threshold universal quantum computation on the surface code”
Austin G. Fowler, Ashley M. Stephens, and Peter Groszkowski · 2009
Earlier work this paper cites.
“Asymmetric quantum codes: constructions, bounds and performance”
Pradeep Kiran Sarvepalli, Andreas Klappenecker, and Martin Rötteler · 2009
Earlier work this paper cites.
“Fault-tolerant computing with biased-noise superconducting qubits: a case study”
P Aliferis, F Brito, D P DiVincenzo, J Preskill, M Steffen, and B M Terhal · 2009
Earlier work this paper cites.
“Quantum quenching, annealing and computation”
Anjan K. Chandra, Arnab Das, and Bikas K. Chakrabarti · 2010
Earlier work this paper cites.
“Fast decoders for topological quantum codes”
Guillaume Duclos-Cianci and David Poulin · 2010
Earlier work this paper cites.
“Quantum computation and quantum information: 10th anniversary edition”
Michael A. Nielsen and Isaac L. Chuang · 2011
Earlier work this paper cites.
“Open quantum systems - an introduction”
Angel Rivas and Susana F. Huelga · 2011
Earlier work this paper cites.
“Quantum computing and the entanglement frontier” (2012)
John Preskill · 2012
Earlier work this paper cites.
“Surface codes: Towards practical large-scale quantum computation”
Austin G. Fowler, Matteo Mariantoni, John M. Martinis, and Andrew N. Cleland · 2012
Earlier work this paper cites.
“Surface code quantum computing by lattice surgery”
Dominic Horsman, Austin G Fowler, Simon Devitt, and Rodney Van Meter · 2012
Earlier work this paper cites.
“Efficient decoding of topological color codes”
Pradeep Sarvepalli and Robert Raussendorf · 2012
Earlier work this paper cites.
“Understanding the effects of leakage in superconducting quantum-error-detection circuits”
Joydip Ghosh, Austin G. Fowler, John M. Martinis, and Michael R. Geller · 2013
Earlier work this paper cites.
“Optimal complexity correction of correlated errors in the surface code” (2013)
Austin G. Fowler · 2013
Earlier work this paper cites.
“Quantum self-correction in the 3d cubic code model”
Sergey Bravyi and Jeongwan Haah · 2013
Earlier work this paper cites.
“Catalytic quantum error correction”
Todd A. Brun, Igor Devetak, and Min-Hsiu Hsieh · 2014
Cited alongside, same era.
“Efficient algorithms for maximum likelihood decoding in the surface code”
Sergey Bravyi, Martin Suchara, and Alexander Vargo · 2014
Cited alongside, same era.
“Thresholds of surface codes on the general lattice structures suffering biased error and loss”
Yuuki Tokunaga and Keisuke Fujii · 2014
Cited alongside, same era.
“A decoding algorithm for css codes using the x/z correlations”
Nicolas Delfosse and Jean-Pierre Tillich · 2014
Cited alongside, same era.
“A practical introduction to tensor networks: Matrix product states and projected entangled pair states”
R. Orús · 2014
Cited alongside, same era.
“Tensor networks and quantum error correction”
Andrew J. Ferris and David Poulin · 2014
“Degenerate Quantum LDPC Codes With Good Finite Length Performance”
Pavel Panteleev and Gleb Kalachev · 2021
Later among the works it cites.
“Quantum low-density parity-check codes”
Nikolas P. Breuckmann and Jens Niklas Eberhardt · 2021
Later among the works it cites.
“Degeneracy and its impact on the decoding of sparse quantum codes”
Patricio Fuentes, Josu Etxezarreta Martinez, Pedro M. Crespo, and Javier Garcia-Frías · 2021
Later among the works it cites.
“Saving superconducting quantum processors from decay and correlated errors generated by gamma and cosmic rays”
John M. Martinis · 2021
Later among the works it cites.
“Almost-linear time decoding algorithm for topological codes”
Nicolas Delfosse and Naomi H. Nickerson · 2021
Later among the works it cites.
“Rectangular surface code under biased noise”
Jonghyun Lee, Jooyoun Park, and Jun Heo · 2021
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
“Fast decoders for qudit topological codes”
Hussain Anwar, Benjamin J Brown, Earl T Campbell, and Dan E Browne · 2014
Cited alongside, same era.
“Overfeat: Integrated recognition, localization and detection using convolutional networks”
Pierre Sermanet, David Eigen, Xiang Zhang, Michael Mathieu, Rob Fergus, and Yann LeCun · 2014
Cited alongside, same era.
“Hardness of decoding quantum stabilizer codes”
Pavithran Iyer and David Poulin · 2015
Cited alongside, same era.
“Quantum error correction for quantum memories”
Barbara M. Terhal · 2015
Cited alongside, same era.
“Cellular-automaton decoders for topological quantum memories”
Michael Herold, Earl T. Campbell, Jens Eisert, and Michael J. Kastoryano · 2015
Cited alongside, same era.
“Minimum weight perfect matching of fault-tolerant topological quantum error correction in average o(1) parallel time”
Austin G. Fowler · 2015
Cited alongside, same era.
Later among the works it cites.
“Stim: a fast stabilizer circuit simulator”
Craig Gidney · 2021
Later among the works it cites.
“Fiber bundle codes: breaking the n1/2 polylog(n) barrier for quantum ldpc codes”
Matthew B. Hastings, Jeongwan Haah, and Ryan O’Donnell · 2021
Later among the works it cites.
“Balanced product quantum codes”
Nikolas P. Breuckmann and Jens N. Eberhardt · 2021
Later among the works it cites.
“Trapping Sets of Quantum LDPC Codes”
Nithin Raveendran and Bane Vasić · 2021
Later among the works it cites.
“Log-domain decoding of quantum ldpc codes over binary finite fields”
Ching-Yi Lai and Kao-Yueh Kuo · 2021
Later among the works it cites.
“Syndrome-based min-sum vs osd-0 decoders: Fpga implementation and analysis for quantum ldpc codes”
Javier Valls, Francisco Garcia-Herrero, Nithin Raveendran, and Bane Vasić · 2021
Later among the works it cites.
“Improved quantum error correction using soft information” (2021)
Christopher A. Pattison, Michael E. Beverland, Marcus P. da Silva, and Nicolas Delfosse · 2021
Later among the works it cites.
“General tensor network decoding of 2d pauli codes” (2021)
Christopher T. Chubb · 2021
Later among the works it cites.
“Cellular automaton decoders for topological quantum codes with noisy measurements and beyond”
Michael Vasmer, Dan E. Browne, and Aleksander Kubica · 2021
Later among the works it cites.
“Noisy intermediate-scale quantum algorithms”
Kishor Bharti, Alba Cervera-Lierta, Thi Ha Kyaw, Tobias Haug, Sumner Alperin-Lea, Abhinav Anand, Matthias Degroote, Hermanni Heimonen, Jakob S. Kottmann, Tim Menke, Wai-Keong Mok, Sukin Sim, et al · 2022
Later among the works it cites.
“Traversable wormhole dynamics on a quantum processor”
Daniel Jafferis, Alexander Zlokapa, Joseph D. Lykken, David K. Kolchmeyer, Samantha I. Davis, Nikolai Lauk, Hartmut Neven, and Maria Spiropulu · 2022
Later among the works it cites.
“Quantum advantage in learning from experiments”
Hsin-Yuan Huang, Michael Broughton, Jordan Cotler, Sitan Chen, Jerry Li, Masoud Mohseni, Hartmut Neven, Ryan Babbush, Richard Kueng, John Preskill, and Jarrod R. McClean · 2022
Later among the works it cites.
“Quantum computational advantage with a programmable photonic processor”
Lars S. Madsen, Fabian Laudenbach, Mohsen Falamarzi. Askarani, Fabien Rortais, Trevor Vincent, Jacob F. F. Bulmer, Filippo M. Miatto, Leonhard Neuhaus, Lukas G. Helt, Matthew J. Collins, Adriana E. Lita, et al · 2022
Later among the works it cites.
“A programmable qudit-based quantum processor”
Yulin Chi, Jieshan Huang, Zhanchuan Zhang, Jun Mao, Zinan Zhou, Xiaojiong Chen, Chonghao Zhai, Jueming Bao, Tianxiang Dai, Huihong Yuan, Ming Zhang, et al · 2022
Later among the works it cites.
“Asymptotically good quantum and locally testable classical ldpc codes”
Pavel Panteleev and Gleb Kalachev · 2022
Later among the works it cites.
“Realizing repeated quantum error correction in a distance-three surface code”
Sebastian Krinner, Nathan Lacroix, Ants Remm, Agustin Di Paolo, Elie Genois, Catherine Leroux, Christoph Hellings, Stefania Lazar, Francois Swiadek, Johannes Herrmann, Graham J. Norris, et al · 2022
Later among the works it cites.
“Decoherence and quantum error correction for quantum computing and communications”
Josu Etxezarreta Martinez · 2022
Later among the works it cites.
“Performance of surface codes in realistic quantum hardware”
Antonio deMarti iOlius, Josu Etxezarreta Martinez, Patricio Fuentes, Pedro M. Crespo, and Javier Garcia-Frias · 2022
Later among the works it cites.
“Universal quantum computing with twist-free and temporally encoded lattice surgery”
Christopher Chamberland and Earl T. Campbell · 2022
Later among the works it cites.
“Qubit noise deconvolution”
Stefano Mangini, Lorenzo Maccone, and Chiara Macchiavello · 2022
Later among the works it cites.
“Mitigating leakage and noise in superconducting quantum computing”
Francesco Battistel · 2022
Later among the works it cites.
“Pymatching: A python package for decoding quantum codes with minimum-weight perfect matching”
Oscar Higgott · 2022
Later among the works it cites.
“An interpretation of union-find decoder on weighted graphs” (2022)
Yue Wu, Namitha Liyanage, and Lin Zhong · 2022
Later among the works it cites.
“On the logical error rate of sparse quantum codes”
Patricio Fuentes, Josu Etxezarreta Martinez, Pedro M. Crespo, and Javier Garcia-Frías · 2022
Later among the works it cites.
“Toward a union-find decoder for quantum ldpc codes”
Nicolas Delfosse, Vivien Londe, and Michael E. Beverland · 2022
Later among the works it cites.
“Quantum tanner codes”
A. Leverrier and G. Zemor · 2022
Later among the works it cites.
“Stabilizer inactivation for message-passing decoding of quantum ldpc codes”
Julien Du Crest, Mehdi Mhalla, and Valentin Savin · 2022
Later among the works it cites.
“Soft syndrome decoding of quantum ldpc codes for joint correction of data and syndrome errors”
Nithin Raveendran, Narayanan Rengaswamy, Asit Kumar Pradhan, and Bane Vasić · 2022
Later among the works it cites.
“Single-shot decoding of linear rate ldpc quantum codes with high performance”
Nikolas P. Breuckmann and Vivien Londe · 2022
Later among the works it cites.
“Maximum likelihood decoders of stabilizer codes under device noise using tensor networks”
Benjamin Villalonga · 2022
Later among the works it cites.
“Scalable neural decoder for topological surface codes”
Kai Meinerz, Chae-Yeun Park, and Simon Trebst · 2022
Later among the works it cites.
“A modified mwpm decoding algorithm for quantum surface codes over depolarizing channels”
Yaping Yuan and Chung-Chin Lu · 2022
Later among the works it cites.
“Pauli channels can be estimated from syndrome measurements in quantum error correction”
Thomas Wagner, Hermann Kampermann, Dagmar Bruß, and Martin Kliesch · 2022
Later among the works it cites.
“Sparse blossom: correcting a million errors per core second with minimum-weight matching” (2023)
Oscar Higgott and Craig Gidney · 2023
Closest in time.
“Suppressing quantum errors by scaling a surface code logical qubit”
Rajeev Acharya, Igor Aleiner, Richard Allen, Trond I. Andersen, Markus Ansmann, Frank Arute, Kunal Arya, Abraham Asfaw, Juan Atalaya, Ryan Babbush, Dave Bacon, et al · 2023
Closest in time.
“Zero noise extrapolation on logical qubits by scaling the error correction code distance”
Misty A. Wahl, Andrea Mari, Nathan Shammah, William J. Zeng, and Gokul Subramanian Ravi · 2023
Closest in time.
“Quantum error mitigation”
Zhenyu Cai, Ryan Babbush, Simon C. Benjamin, Suguru Endo, William J. Huggins, Ying Li, Jarrod R. McClean, and Thomas E. O’Brien · 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.
“Performance enhancement of surface codes via recursive minimum-weight perfect-match decoding”
Antonio deMarti iOlius, Josu Etxezarreta Martinez, Patricio Fuentes, and Pedro M. Crespo · 2023
Closest in time.
“Learning correlated noise in a 39-qubit quantum processor”
Robin Harper and Steven T. Flammia · 2023
Closest in time.
“Probabilistic error cancellation with sparse pauli–lindblad models on noisy quantum processors”
Ewout van den Berg, Zlatko K. Minev, Abhinav Kandala, and Kristan Temme · 2023
Closest in time.
“Correcting non-independent and non-identically distributed errors with surface codes”
Konstantin Tiurev, Peter-Jan H. S. Derks, Joschka Roffe, Jens Eisert, and Jan-Michael Reiner · 2023
Closest in time.
“Fusion blossom: Fast mwpm decoders for qec”
Y. Wu and L. Zhong · 2023
Closest in time.
“Decoding quantum color codes with maxsat” (2023)
Lucas Berent, Lukas Burgholzer, Peter-Jan H. S. Derks, Jens Eisert, and Robert Wille · 2023
Closest in time.
“Multiqubit time-varying quantum channels for nisq-era superconducting quantum processors”
Josu Etxezarreta Martinez, Patricio Fuentes, Antonio deMarti iOlius, Javier Garcia-Frias, Javier Rodríguez Fonollosa, and Pedro M. Crespo · 2023
Closest in time.
“Bias-tailored quantum LDPC codes”
Joschka Roffe, Lawrence Z. Cohen, Armanda O. Quintavalle, Daryus Chandra, and Earl T. Campbell · 2023
Closest in time.
“Improved single-shot decoding of higher-dimensional hypergraph-product codes”
Oscar Higgott and Nikolas P. Breuckmann · 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.
“Neural network decoder for near-term surface-code experiments” (2023)
Boris Mihailov Varbanov, Marc Serra-Peralta, David Byfield, and Barbara Maria Terhal · 2023
Closest in time.
“Data-driven decoding of quantum error correcting codes using graph neural networks” (2023)
Moritz Lange, Pontus Havstrom, Basudha Srivastava, Valdemar Bergentall, Karl Hammar, Olivia Heuts, Evert van Nieuwenburg, and Mats Granath · 2023
Closest in time.
“Techniques for combining fast local decoders with global decoders under circuit-level noise”
Christopher Chamberland, Luis Goncalves, Prasahnt Sivarajah, Eric Peterson, and Sebastian Grimberg · 2023
Closest in time.
“Software tools for decoding quantum low-density parity-check codes”
Lucas Berent, Lukas Burgholzer, and Robert Wille · 2023
Closest in time.
“Parallel window decoding enables scalable fault tolerant quantum computation”
Luka Skoric, Dan E. Browne, Kenton M. Barnes, Neil I. Gillespie, and Earl T. Campbell · 2023
Closest in time.
“Scalable surface-code decoders with parallelization in time”
Xinyu Tan, Fang Zhang, Rui Chao, Yaoyun Shi, and Jianxin Chen · 2023
Closest in time.
“Tailored xzzx codes for biased noise”
Qian Xu, Nam Mannucci, Alireza Seif, Aleksander Kubica, Steven T. Flammia, and Liang Jiang · 2023
Closest in time.
“Logical quantum processor based on reconfigurable atom arrays”
Dolev Bluvstein, Simon J. Evered, Alexandra A. Geim, Sophie H. Li, Hengyun Zhou, Tom Manovitz, Sepehr Ebadi, Madelyn Cain, Marcin Kalinowski, Dominik Hangleiter, J. Pablo Bonilla Ataides, Nishad Maskara, Iris Cong, Xun Gao, Pedro Sales Rodriguez, Thomas Karolyshyn, Giulia Semeghini, Michael J. Gullans, Markus Greiner, Vladan Vuletić, and Mikhail D. Lukin · 2024
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.