Gullans, Michael J.
Joint Center for Quantum Information and Computer Science · University of Maryland, College Park
6 papers on CoChatORCID 0000-0003-3974-2987
Most cited papers
- Verified
Logical quantum processor based on reconfigurable atom arrays
Bluvstein, D., Evered, S. J., Geim, A. A., Li, S. H., Zhou, H., Manovitz, T., Ebadi, S., Cain, M., Kalinowski, M., Hangleiter, D., et al. (2024) · Nature
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 1,119
- Verified
Two-qubit silicon quantum processor with operation fidelity exceeding 99%
Mills, A. R., Guinn, C. R., Gullans, M. J., Sigillito, A. J., Feldman, M. M., Nielsen, E., & Petta, J. R. (2022) · Science Advances
Quantum and electron transport phenomenaDiamond and Carbon-based Materials Research
Cited by 329
- Verified
Shuttling a single charge across a one-dimensional array of silicon quantum dots
Mills, A. R., Zajac, D. M., Gullans, M. J., Schupp, F. J., Hazard, T. M., & Petta, J. R. (2019) · Nature Communications
Quantum and electron transport phenomenaSemiconductor Quantum Structures and Devices
Cited by 283
- Verified
Bell Sampling from Quantum Circuits
Hangleiter, D., & Gullans, M. J. (2024) · Physical Review Letters
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 28
- Verified
A sharp phase transition in linear cross-entropy benchmarking
Ware, B., Deshpande, A., Hangleiter, D., Niroula, P., Fefferman, B., Gorshkov, A. V., & Gullans, M. J. (2023) · arXiv
Quantum Computing Algorithms and ArchitectureQuantum many-body systems
Cited by 4
- Verified
Publisher Correction: A fault-tolerant neutral-atom architecture for universal quantum computation
Bluvstein, D., Geim, A. A., Li, S. H., Evered, S. J., Bonilla Ataides, J. P., Baranes, G., Gu, A., Manovitz, T., Xu, M., Kalinowski, M., et al. (2026) · Nature
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 1
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free