Svore, Krysta M.
Microsoft Azure Quantum
14 papers on CoChatORCID 0000-0001-9500-9443
Most cited papers
- Verified
Circuit-centric quantum classifiers
Schuld, M., Bocharov, A., Svore, K. M., & Wiebe, N. (2020) · Physical Review A
Quantum Computing Algorithms and ArchitectureQuantum many-body systems
Cited by 1,057
- Verified
Elucidating reaction mechanisms on quantum computers
Reiher, M., Wiebe, N., Svore, K. M., Wecker, D., & Troyer, M. (2017) · Proceedings of the National Academy of Sciences
Quantum Computing Algorithms and ArchitectureAdvanced Chemical Physics Studies
Cited by 745
- Verified
Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms
Roetteler, M., Naehrig, M., Svore, K. M., & Lauter, K. (2017) · Lecture Notes in Computer Science
Quantum Computing Algorithms and ArchitectureCryptography and Residue Arithmetic
Cited by 212
- Verified
Quantum Speed-Ups for Solving Semidefinite Programs
Brandao, F. G. S. L., & Svore, K. M. (2017) · 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
Quantum Computing Algorithms and ArchitectureAdvanced Optimization Algorithms Research
Cited by 142
- Verified
Efficient Synthesis of Universal Repeat-Until-Success Quantum Circuits
Bocharov, A., Roetteler, M., & Svore, K. M. (2015) · Physical Review Letters
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 142
- Verified
Modeling and predicting behavioral dynamics on the web
Radinsky, K., Svore, K., Dumais, S., Teevan, J., Bocharov, A., & Horvitz, E. (2012) · Proceedings of the 21st international conference on World Wide Web
Information Retrieval and Search BehaviorRecommender Systems and Techniques
Cited by 122
- Verified
A logarithmic-depth quantum carry-lookahead adder
Draper, T. G., Kutin, S. A., Rains, E. M., & Svore, K. M. (2006) · Quantum Information and Computation
Quantum Computing Algorithms and ArchitectureCryptography and Residue Arithmetic
Cited by 101
- Verified
Factoring using $2n+2$ qubits with Toffoli based modular multiplication
Haner, T., Roetteler, M., & Svore, K. M. (2017) · Quantum Information and Computation
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 90
- Verified
Quantum deep learning
Wiebe, N., Kapoor, A., & Svore, K. M. (2016) · Quantum Information and Computation
Quantum Computing Algorithms and ArchitectureQuantum many-body systems
Cited by 85
- Verified
Cost of Universality: A Comparative Study of the Overhead of State Distillation and Code Switching with Color Codes
Beverland, M. E., Kubica, A., & Svore, K. M. (2021) · PRX Quantum
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 82
- Verified
Demonstration of logical qubits and repeated error correction with better-than-physical error rates
Paetznick, A., da Silva, M. P., Ryan-Anderson, C., Bello-Rivas, J. M., Campora, J. P., Chernoguzov, A., Dreiling, J. M., Foltz, C., Frachon, F., Gaebler, J. P., et al. (2024) · arXiv
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 42
- Verified
Fault-tolerant quantum computation with a neutral atom processor
Reichardt, B. W., Paetznick, A., Aasen, D., Basov, I., Bello-Rivas, J. M., Bonderson, P., Chao, R., van Dam, W., Hastings, M. B., Mishmash, R. V., et al. (2024) · arXiv
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 7
- Verified
Quantum deep learning
Wiebe, N., Kapoor, A., & Svore, K. M. (2014) · arXiv
Quantum Computing Algorithms and ArchitectureQuantum many-body systems
Cited by 5
- Verified
Advances in compilation for quantum hardware -- A demonstration of magic state distillation and repeat-until-success protocols
Brown, N. C., Campora, J. P., Granade, C., Heim, B., Wernli, S., Ryan-Anderson, C., Lucchetti, D., Paetznick, A., Roetteler, M., Svore, K., et al. (2023) · arXiv
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 4
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free