Kelly, J.
Google (United States)
18 papers on CoChatORCID 0000-0002-2596-2121
Most cited papers
- Verified
Superconducting quantum circuits at the surface code threshold for fault tolerance
Barends, R., Kelly, J., Megrant, A., Veitia, A., Sank, D., Jeffrey, E., White, T. C., Mutus, J., Fowler, A. G., Campbell, B., et al. (2014) · Nature
Quantum Information and CryptographyQuantum Computing Algorithms and Architecture
Cited by 1,733
- Verified
Suppressing quantum errors by scaling a surface code logical qubit
Google Quantum, A. I., Acharya, R., Aleiner, I., Allen, R., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., Atalaya, J., et al. (2023) · Nature
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 1,103
- Verified
Scalable Quantum Simulation of Molecular Energies
O’Malley, P. J. J., Babbush, R., Kivlichan, I. D., Romero, J., McClean, J. R., Barends, R., Kelly, J., Roushan, P., Tranter, A., Ding, N., et al. (2016) · Physical Review X
Quantum Computing Algorithms and ArchitectureAdvanced Chemical Physics Studies
Cited by 1,059
- Verified
Coherent Josephson Qubit Suitable for Scalable Quantum Integrated Circuits
Barends, R., Kelly, J., Megrant, A., Sank, D., Jeffrey, E., Chen, Y., Yin, Y., Chiaro, B., Mutus, J., Neill, C., et al. (2013) · Physical Review Letters
Quantum Information and CryptographyQuantum Computing Algorithms and Architecture
Cited by 779
- Verified
Quantum error correction below the surface code threshold
Collaborators, G. Q. A. A., Acharya, R., Abanin, D. A., Aghababaie-Beni, L., Aleiner, I., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., et al. (2025) · Nature
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 778
- Verified
Planar superconducting resonators with internal quality factors above one million
Megrant, A., Neill, C., Barends, R., Chiaro, B., Chen, Y., Feigl, L., Kelly, J., Lucero, E., Mariantoni, M., O’Malley, P. J. J., et al. (2012) · Applied Physics Letters
Mechanical and Optical ResonatorsSuperconducting and THz Device Technology
Cited by 481
- Verified
Spectroscopic signatures of localization with interacting photons in superconducting qubits
Roushan, P., Neill, C., Tangpanitanon, J., Bastidas, V. M., Megrant, A., Barends, R., Chen, Y., Chen, Z., Chiaro, B., Dunsworth, A., et al. (2017) · Science
Quantum Information and CryptographyQuantum many-body systems
Cited by 460
- Verified
Exponential suppression of bit or phase errors with cyclic error correction
Google Quantum, A. I., Chen, Z., Satzinger, K. J., Atalaya, J., Korotkov, A. N., Dunsworth, A., Sank, D., Quintana, C., McEwen, M., Barends, R., et al. (2021) · Nature
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 393
- Verified
Fluctuations of Energy-Relaxation Times in Superconducting Qubits
Klimov, P. V., Kelly, J., Chen, Z., Neeley, M., Megrant, A., Burkett, B., Barends, R., Arya, K., Chiaro, B., Chen, Y., et al. (2018) · Physical Review Letters
Quantum Information and CryptographyQuantum Computing Algorithms and Architecture
Cited by 328
- Verified
Computing prime factors with a Josephson phase qubit quantum processor
Lucero, E., Barends, R., Chen, Y., Kelly, J., Mariantoni, M., Megrant, A., O’Malley, P., Sank, D., Vainsencher, A., Wenner, J., et al. (2012) · Nature Physics
Quantum Information and CryptographyQuantum Computing Algorithms and Architecture
Cited by 311
- Verified
Information scrambling in quantum circuits
Mi, X., Roushan, P., Quintana, C., Mandrà, S., Marshall, J., Neill, C., Arute, F., Arya, K., Atalaya, J., Babbush, R., et al. (2021) · Science
Quantum many-body systemsQuantum Computing Algorithms and Architecture
Cited by 283
- Verified
Resolving catastrophic error bursts from cosmic rays in large arrays of superconducting qubits
McEwen, M., Faoro, L., Arya, K., Dunsworth, A., Huang, T., Kim, S., Burkett, B., Fowler, A., Arute, F., Bardin, J. C., et al. (2022) · Nature Physics
Quantum Information and CryptographyQuantum Computing Algorithms and Architecture
Cited by 193
- Verified
Qubit compatible superconducting interconnects
Foxen, B., Mutus, J. Y., Lucero, E., Graff, R., Megrant, A., Chen, Y., Quintana, C., Burkett, B., Kelly, J., Jeffrey, E., et al. (2018) · Quantum Science and Technology
Superconducting and THz Device TechnologyQuantum Information and Cryptography
Cited by 143
- Verified
Phase transition in Random Circuit Sampling
Morvan, A., Villalonga, B., Mi, X., Mandrà, S., Bengtsson, A., Klimov, P. V., Chen, Z., Hong, S., Erickson, C., Drozdov, I. K., et al. (2023) · arXiv
Quantum Computing Algorithms and ArchitectureQuantum many-body systems
Cited by 138
- Verified
Non-Abelian braiding of graph vertices in a superconducting processor
Collaborators, G. Q. A. A., Andersen, T. I., Lensky, Y. D., Kechedzhi, K., Drozdov, I. K., Bengtsson, A., Hong, S., Morvan, A., Mi, X., Opremcak, A., et al. (2023) · Nature
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 108
- Verified
Overcoming leakage in quantum error correction
Miao, K. C., McEwen, M., Atalaya, J., Kafri, D., Pryadko, L. P., Bengtsson, A., Opremcak, A., Satzinger, K. J., Chen, Z., Klimov, P. V., et al. (2023) · Nature Physics
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 99
- Verified
Resisting High-Energy Impact Events through Gap Engineering in Superconducting Qubit Arrays
McEwen, M., Miao, K. C., Atalaya, J., Bilmes, A., Crook, A., Bovaird, J., Kreikebaum, J. M., Zobrist, N., Jeffrey, E., Ying, B., et al. (2024) · Physical Review Letters
Quantum Information and CryptographyQuantum Computing Algorithms and Architecture
Cited by 55
- Verified
Scaling and logic in the colour code on a superconducting quantum processor
Lacroix, N., Bourassa, A., Heras, F. J. H., Zhang, L. M., Bausch, J., Senior, A. W., Edlich, T., Shutty, N., Sivak, V., Bengtsson, A., et al. (2025) · Nature
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 51
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free