Brown, Benjamin J.
IBM Research - Thomas J. Watson Research Center · IBM (Denmark)
7 papers on CoChatORCID 0000-0002-8060-8109
Most cited papers
- Verified
The XZZX surface code
Bonilla Ataides, J. P., Tuckett, D. K., Bartlett, S. D., Flammia, S. T., & Brown, B. J. (2021) · Nature Communications
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 262
- Verified
Encoding a magic state with beyond break-even fidelity
Gupta, R. S., Sundaresan, N., Alexander, T., Wood, C. J., Merkel, S. T., Healy, M. B., Hillenbrand, M., Jochym-O’Connor, T., Wootton, J. R., Yoder, T. J., et al. (2024) · Nature
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 115
- Verified
Low-overhead fault-tolerant quantum computing using long-range connectivity
Cohen, L. Z., Kim, I. H., Bartlett, S. D., & Brown, B. J. (2022) · Science Advances
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 98
- Verified
A fault-tolerant non-Clifford gate for the surface code in two dimensions
Brown, B. J. (2020) · Science Advances
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 77
- Verified
Decoder for the Triangular Color Code by Matching on a Möbius Strip
Sahay, K., & Brown, B. J. (2022) · PRX Quantum
Quantum Computing Algorithms and ArchitectureQuantum many-body systems
Cited by 38
- Verified
Low-overhead quantum computing with the color code
Thomsen, F., Kesselring, M. S., Bartlett, S. D., & Brown, B. J. (2024) · Physical Review Research
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 15
- Verified
Practical Quantum Error Correction with the XZZX Code and Kerr-Cat Qubits
Darmawan, A. S., Brown, B. J., Grimsmo, A. L., Tuckett, D. K., & Puri, S. (2021) · PRX Quantum
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 2
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free