Steane, A. M.
University of Oxford
8 papers on CoChatORCID 0000-0001-7689-4133
Most cited papers
- Verified
Error Correcting Codes in Quantum Theory
Steane, A. M. (1996) · Physical Review Letters
Quantum Information and CryptographyQuantum Computing Algorithms and Architecture
Cited by 2,677
- Verified
Quantum computing
Steane, A. (1998) · Reports on Progress in Physics
Quantum Information and CryptographyQuantum Computing Algorithms and Architecture
Cited by 1,391
- Verified
Quantum Computing
Steane, A. (1997) · arXiv
Quantum Information and CryptographyQuantum Computing Algorithms and Architecture
Cited by 1,390
- Verified
Multiple-particle interference and quantum error correction
Steane, A. M. (1996) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 1,284
- Verified
Simple quantum error-correcting codes
Steane, A. M. (1996) · Physical Review A
Quantum Computing Algorithms and ArchitectureCoding theory and cryptography
Cited by 522
- Verified
Overhead and noise threshold of fault-tolerant quantum error correction
Steane, A. M. (2003) · Physical Review A
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 372
- Verified
High-Fidelity Readout of Trapped-Ion Qubits
Myerson, A. H., Szwer, D. J., Webster, S. C., Allcock, D. T. C., Curtis, M. J., Imreh, G., Sherman, J. A., Stacey, D. N., Steane, A. M., & Lucas, D. M. (2008) · Physical Review Letters
Quantum Information and CryptographyQuantum optics and atomic interactions
Cited by 334
- Verified
Probing Qubit Memory Errors at the Part-per-Million Level
Sepiol, M. A., Hughes, A. C., Tarlton, J. E., Nadlinger, D. P., Ballance, T. G., Ballance, C. J., Harty, T. P., Steane, A. M., Goodwin, J. F., & Lucas, D. M. (2019) · Physical Review Letters
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 31
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free