Fetching the paper…
Reading the bibliography…
For the first time in history, we are seeing a branching point in computing paradigms with the emergence of quantum processing units (QPUs).
R. Gallager, “Low-density parity-check codes,” IRE Transactions on Information Theory 8
1962
Earlier work this paper cites.
R. Feynman, “Simulating physics with computers,” International Journal of Theoretical Physics 21
1982
Earlier work this paper cites.
P. W. Shor, “Algorithms for quantum computation: Discrete logarithms and factoring,” in Proceedings 35th annual symposium on foundations of computer science (Ieee, 1994) pp. 124–134
1994
Earlier work this paper cites.
D. P. DiVincenzo, “Quantum computation,” Science 270
1995
Earlier work this paper cites.
L. K. Grover, “A fast quantum mechanical algorithm for database search,” in Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing , STOC ’96 (ACM, New York, NY, USA, 1996) pp. 212–219
1996
Earlier work this paper cites.
S. Lloyd, “Universal quantum simulators,” Science , 1073–1078 (1996)
1996
Earlier work this paper cites.
D. Gottesman, “Class of quantum error-correcting codes saturating the quantum Hamming bound,” Physical Review A 54
1996
Earlier work this paper cites.
A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. Sloane, “Quantum error correction and orthogonal geometry,” Physical Review Letters 78
1997
Earlier work this paper cites.
S. B. Bravyi and A. Y. Kitaev, “Quantum codes on a lattice with boundary,” arXiv preprint quant-ph/9811052 (1998)
1998
Earlier work this paper cites.
D. S. Abrams and S. Lloyd, “Quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors,” Physical Review Letters 83
1999
Earlier work this paper cites.
E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, “Quantum computation by adiabatic evolution,” arXiv:0001106 (2000)
2000
Earlier work this paper cites.
A. Y. Kitaev, “Fault-tolerant quantum computation by anyons,” Annals of Physics 303
2003
Earlier work this paper cites.
M. A. Nielsen, “Quantum computation by measurement and quantum memory,” Physics Letters A 308
2003
Earlier work this paper cites.
S. Bravyi, M. B. Hastings, and F. Verstraete, “Lieb-robinson bounds and the generation of correlations and topological quantum order,” Physical Review Letters 97
2006
Earlier work this paper cites.
T. J. Osborne, “Efficient approximation of the dynamics of one-dimensional quantum spin systems,” Physical Review Letters 97
2006
Earlier work this paper cites.
M. P. Larsson and S. Lucyszyn, “A micromachined separable RF connector fabricated using low-resistivity silicon,” Journal of Micromechanics and Microengineering 16
2006
Earlier work this paper cites.
R. Raussendorf and J. Harrington, “Fault-tolerant quantum computation with high threshold in two dimensions,” Physical Review Letters 98
2007
Earlier work this paper cites.
V. Giovannetti, S. Lloyd, and L. Maccone, “Quantum random access memory,” Physical Review Letters 100
2008
Earlier work this paper cites.
K. G. Vollbrecht and J. I. Cirac, “Quantum simulators, continuous-time automata, and translationally invariant systems,” Physical Review Letters 100
2008
Earlier work this paper cites.
D. Nagaj and P. Wocjan, “Hamiltonian quantum cellular automata in one dimension,” Physical Review A 78
2008
Earlier work this paper cites.
A. Kay, “Computational power of symmetric hamiltonians,” Physical Review A 78
2008
Earlier work this paper cites.
2008
Earlier work this paper cites.
M. Hastings, “Observations outside the light cone: Algorithms for nonequilibrium and thermal states,” Physical Review B 77
2008
Earlier work this paper cites.
D. Aharonov, V. Jones, and Z. Landau, “A polynomial quantum algorithm for approximating the Jones polynomial,” Algorithmica 55
2009
Earlier work this paper cites.
A. G. Fowler, A. M. Stephens, and P. Groszkowski, “High-threshold universal quantum computation on the surface code,” Physical Review A 80
2009
Earlier work this paper cites.
S. Bravyi, D. Poulin, and B. Terhal, “Tradeoffs for reliable quantum information storage in 2D systems,” Physical Review Letters 104
2010
Earlier work this paper cites.
U. Schollwöck, “The density-matrix renormalization group in the age of matrix product states,” Annals of Physics 326
2011
Earlier work this paper cites.
M.-H. Hsieh and F. Le Gall, “NP-hardness of decoding quantum error-correction codes,” Physical Review A 83
2011
Earlier work this paper cites.
D. S. Wang, A. G. Fowler, and L. C. Hollenberg, “Surface code quantum computing with error rates over 1%,” Physical Review A 83
2011
Earlier work this paper cites.
K.-Y. Kuo and C.-C. Lu, “On the hardness of decoding quantum stabilizer codes under the depolarizing channel,” in 2012 International Symposium on Information Theory and its Applications (IEEE, 2012) pp. 208–211
2012
Earlier work this paper cites.
2012
Earlier work this paper cites.
G. Knizia and G. K.-L. Chan, “Density matrix embedding: A simple alternative to dynamical mean-field theory,” Physical review letters 109
2012
Earlier work this paper cites.
2013
Earlier work this paper cites.
J.-P. Tillich and G. Zémor, “Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength,” IEEE Transactions on Information Theory 60
2013
Earlier work this paper cites.
S. Bravyi and R. König, “Classification of topologically protected gates for local stabilizer codes,” Physical Review Letters 110
2013
Earlier work this paper cites.
V. Kliuchnikov, D. Maslov, and M. Mosca, “Fast and efficient exact synthesis of single-qubit unitaries generated by Clifford and T gates,” Quantum Information and Computation 13
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
G. Knizia and G. K.-L. Chan, “Density matrix embedding: A strong-coupling quantum embedding theory,” Journal of chemical theory and computation 9
2013
Earlier work this paper cites.
N. H. Nickerson, Y. Li, and S. C. Benjamin, “Topological quantum computing with a very noisy network and local error rates approaching one percent,” Nature Communications 2013 4:1 4
2013
Earlier work this paper cites.
2014
Earlier work this paper cites.
C. Monroe, R. Raussendorf, A. Ruthven, K. R. Brown, P. Maunz, L.-M. Duan, and J. Kim, “Large-scale modular quantum-computer architecture with atomic memory and photonic interconnects,” Physical Review A 89
2014
Earlier work this paper cites.
P. Iyer and D. Poulin, “Hardness of decoding quantum stabilizer codes,” IEEE Transactions on Information Theory 61
2015
Earlier work this paper cites.
H. Bombín, “Single-shot fault-tolerant quantum error correction,” Physical Review X 5
2015
Earlier work this paper cites.
Y. Li, “A magic state’s fidelity can be superior to the operations that created it,” New Journal of Physics 17
2015
Earlier work this paper cites.
A. Kubica, B. Yoshida, and F. Pastawski, “Unfolding the color code,” New Journal of Physics 17
2015
Cited alongside, same era.
S. K. Tolpygo, V. Bolkhovsky, T. J. Weir, L. M. Johnson, M. A. Gouker, and W. D. Oliver, “Fabrication process and properties of fully-planarized seep-submicron Nb/Al– AlO x /Nb \hbox{AlO}_{\rm x}\hbox{/Nb} Josephson junctions for VLSI circuits,” IEEE Transactions on Applied Superconductivity 25
2015
Cited alongside, same era.
D. J. Reilly, “Engineering the quantum-classical interface of solid-state qubits,” npj Quantum Information 2015 1:1 1
2015
Cited alongside, same era.
S. Bravyi, G. Smith, and J. A. Smolin, “Trading classical and quantum computational resources,” Physical Review X 6
2016
Cited alongside, same era.
S. Lloyd, S. Garnerone, and P. Zanardi, “Quantum algorithms for topological and geometric analysis of data,” Nature communications 7
D. R. W. Yost, M. E. Schwartz, J. Mallek, D. Rosenberg, C. Stull, J. L. Yoder, G. Calusine, M. Cook, R. Das, A. L. Day, E. B. Golden, D. K. Kim, A. Melville, B. M. Niedzielski, W. Woods, A. J. Kerman, and W. D. Oliver, “Solid-state qubits integrated with superconducting through-silicon vias,” npj Quantum Information 6
2020
Later among the works it cites.
D. Rosenberg, S. Weber, D. Conway, D. Yost, J. Mallek, G. Calusine, R. Das, D. Kim, M. Schwartz, W. Woods, J. L. Yoder, and W. D. Oliver, “Solid-state qubits: 3D integration and packaging,” IEEE Microwave Magazine 21
2020
Later among the works it cites.
J. M. Kreikebaum, K. P. O’Brien, A. Morvan, and I. Siddiqi, “Improving wafer-scale Josephson junction resistance variation in superconducting quantum coherent circuits,” Superconductor Science and Technology 33
2020
Later among the works it cites.
“IBM unveils world’s first 2 nanometer chip technology, opening a new frontier for semiconductors,” https://newsroom.ibm.com/2021-05-06-IBM-Unveils-Worlds-First-2-Nanometer-Chip-Technology-Opening-a-New-Frontier-for-Semiconductors
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
Cited alongside, same era.
A. M. Kaufman, M. E. Tai, A. Lukin, M. Rispoli, R. Schittko, P. M. Preiss, and M. Greiner, “Quantum thermalization through entanglement in an isolated many-body system,” Science 353
2016
Cited alongside, same era.
J. E. Moussa, “Transversal Clifford gates on folded surface codes,” Physical Review A 94
2016
Cited alongside, same era.
N. J. Ross and P. Selinger, “Optimal ancilla-free Clifford+T approximation of z-rotations,” Quantum Information and Computation 16
2016
Cited alongside, same era.
S. Bravyi and D. Gosset, “Improved classical simulation of quantum circuits dominated by Clifford gates,” Physical Review Letters 116
2016
Cited alongside, same era.
B. Bauer, D. Wecker, A. J. Millis, M. B. Hastings, and M. Troyer, “Hybrid quantum-classical approach to correlated materials,” Phys. Rev. X 6
2016
Cited alongside, same era.
J. M. Kreula, L. García-Álvarez, L. Lamata, S. R. Clark, E. Solano, and D. Jaksch, “Few-qubit quantum-classical simulation of strongly correlated lattice fermions,” EPJ Quantum Technology 3
2016
Cited alongside, same era.
D. B. Tuckerman, M. C. Hamilton, D. J. Reilly, R. Bai, G. A. Hernandez, J. M. Hornibrook, J. A. Sellers, and C. D. Ellis, “Flexible superconducting Nb transmission lines on thin film polyimide for quantum computing applications,” Superconductor Science and Technology 29
2016
Cited alongside, same era.
2021
Later among the works it cites.
W. Tang, T. Tomesh, M. Suchara, J. Larson, and M. Martonosi, “Cutqc: using small quantum computers for large quantum circuit evaluations,” in Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems (2021) pp. 473–486
2021
Later among the works it cites.
K. Mitarai and K. Fujii, “Constructing a virtual two-qubit gate by sampling single-qubit operations,” New Journal of Physics 23
2021
Later among the works it cites.
N. P. Breuckmann and J. N. Eberhardt, “Quantum low-density parity-check codes,” PRX Quantum 2
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
J. Haah, M. B. Hastings, R. Kothari, and G. H. Low, “Quantum algorithm for simulating real time evolution of lattice hamiltonians,” SIAM Journal on Computing , FOCS18–250 (2021)
2021
Later among the works it cites.
2021
Later among the works it cites.
M. B. Hastings and J. Haah, “Dynamically generated logical qubits,” Quantum 5
2021
Later among the works it cites.
A. Strikis, D. Qin, Y. Chen, S. C. Benjamin, and Y. Li, “Learning-based quantum error mitigation,” PRX Quantum 2
2021
Later among the works it cites.
S. T. Flammia, “Averaged circuit eigenvalue sampling,” arXiv preprint arXiv:2108.05803 (2021)
2021
Later among the works it cites.
Y. Kim, C. J. Wood, T. J. Yoder, S. T. Merkel, J. M. Gambetta, K. Temme, and A. Kandala, “Scalable error mitigation for noisy quantum circuits produces competitive expectation values,” (2021)
2021
Later among the works it cites.
W. J. Huggins, S. McArdle, T. E. O’Brien, J. Lee, N. C. Rubin, S. Boixo, K. B. Whaley, R. Babbush, and J. R. McClean, “Virtual distillation for quantum error mitigation,” Phys. Rev. X 11
2021
Later among the works it cites.
B. Koczor, “Exponential error suppression for near-term quantum devices,” Phys. Rev. X 11
2021
Later among the works it cites.
S. Endo, Z. Cai, S. C. Benjamin, and X. Yuan, “Hybrid quantum-classical algorithms and quantum error mitigation,” Journal of the Physical Society of Japan 90
2021
Later among the works it cites.
C. Piveteau, D. Sutter, S. Bravyi, J. M. Gambetta, and K. Temme, “Error mitigation for universal gates on encoded qubits,” Physical Review Letters 127
2021
Later among the works it cites.
M. Lostaglio and A. Ciani, “Error mitigation and quantum-assisted simulation in the error corrected regime,” Phys. Rev. Lett. 127
2021
Later among the works it cites.
Y. Liu, S. Arunachalam, and K. Temme, “A rigorous and robust quantum speed-up in supervised machine learning,” Nature Physics 17
2021
Later among the works it cites.
2021
Later among the works it cites.
S. Bravyi, D. Gosset, and R. Movassagh, “Classical algorithms for quantum mean values,” Nature Physics 17
2021
Later among the works it cites.
D. Stilck França and R. García-Patrón, “Limitations of optimization algorithms on noisy quantum devices,” Nature Physics 17
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
J. B. Hertzberg, E. J. Zhang, S. Rosenblatt, E. Magesan, J. A. Smolin, J.-B. Yau, V. P. Adiga, M. Sandberg, M. Brink, J. M. Chow, and J. S. Orcutt, “Laser-annealing Josephson junctions for yielding scaled-up superconducting quantum processors,” npj Quantum Inf 7
2021
Later among the works it cites.
A. P. M. Place, L. V. H. Rodgers, P. Mundada, B. M. Smitham, M. Fitzpatrick, Z. Leng, A. Premkumar, J. Bryon, A. Vrajitoarea, S. Sussman, G. Cheng, T. Madhavan, H. K. Babla, X. H. Le, Y. Gang, B. Jäck, A. Gyenis, N. Yao, R. J. Cava, N. P. de Leon, and A. A. Houck, “New material platform for superconducting transmon qubits with coherence times exceeding 0.3 milliseconds,” Nature Communications 2021 12:1 12
2021
Later among the works it cites.
C. R. H. McRae, G. M. Stiehl, H. Wang, S. X. Lin, S. A. Caldwell, D. P. Pappas, J. Mutus, and J. Combes, “Reproducible coherence characterization of superconducting quantum devices,” Applied Physics Letters 119
2021
Later among the works it cites.
X. Xue, B. Patra, J. P. G. van Dijk, N. Samkharadze, S. Subramanian, A. Corna, B. Paquelet Wuetz, C. Jeon, F. Sheikh, E. Juarez-Hernandez, B. P. Esparza, H. Rampurawala, B. Carlton, S. Ravikumar, C. Nieva, S. Kim, H.-J. Lee, A. Sammak, G. Scappucci, M. Veldhorst, F. Sebastiano, M. Babaie, S. Pellerano, E. Charbon, and L. M. K. Vandersypen, “CMOS-based cryogenic control of silicon quantum circuits,” Nature 593
2021
Later among the works it cites.
J. M. Pino, J. M. Dreiling, C. Figgatt, J. P. Gaebler, S. A. Moses, M. S. Allman, C. H. Baldwin, M. Foss-Feig, D. Hayes, K. Mayer, C. Ryan-Anderson, and B. Neyenhuis, “Demonstration of the trapped-ion quantum CCD computer architecture,” Nature 592
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
C. Conner, A. Bienfait, H.-S. Chang, M.-H. Chou, É. Dumur, J. Grebel, G. Peairs, R. Povey, H. Yan, Y. Zhong, et al. , “Superconducting qubits in a flip-chip architecture,” Applied Physics Letters 118
2021
Later among the works it cites.
Y. Zhong, H.-S. Chang, A. Bienfait, É. Dumur, M.-H. Chou, C. R. Conner, J. Grebel, R. G. Povey, H. Yan, D. I. Schuster, and A. N. Cleland, “Deterministic multi-qubit entanglement in a quantum network,” Nature 2021 590:7847 590
2021
Later among the works it cites.
P. Panteleev and G. Kalachev, “Asymptotically good quantum and locally testable classical LDPC codes,” STOC 2022: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing , 375 (2022)
2022
Closest in time.
2022
Closest in time.
Y. Suzuki, S. Endo, K. Fujii, and Y. Tokunaga, “Quantum error mitigation for fault-tolerant quantum computing,” PRX Quantum 3
2022
Closest in time.
2022
Closest in time.
A. Eddins, M. Motta, T. P. Gujarati, S. Bravyi, A. Mezzacapo, C. Hadfield, and S. Sheldon, “Doubling the size of quantum simulators by entanglement forging,” PRX Quantum 3
2022
Closest in time.
2022
Closest in time.
L. Mineh and A. Montanaro, “Solving the Hubbard model using density matrix embedding theory and the variational quantum eigensolver,” Physical Review B 105
2022
Closest in time.
N. J. Coble and M. Coudron, “Quasi-polynomial time approximation of output probabilities of geometrically-local, shallow quantum circuits.” 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) , 598 (2022)
2022
Closest in time.