Egger, Daniel J.
IBM Research - Zurich
6 papers on CoChatORCID 0000-0002-5523-9807
Most cited papers
- Verified
Quantum algorithms for electronic structure calculations: Particle-hole Hamiltonian and optimized wave-function expansions
Barkoutsos, P. K., Gonthier, J. F., Sokolov, I., Moll, N., Salis, G., Fuhrer, A., Ganzhorn, M., Egger, D. J., Troyer, M., Mezzacapo, A., et al. (2018) · Physical Review A
Quantum Computing Algorithms and ArchitectureQuantum many-body systems
Cited by 363
- Verified
Warm-starting quantum optimization
Egger, D. J., Mareček, J., & Woerner, S. (2021) · Quantum
Quantum Computing Algorithms and ArchitectureComplexity and Algorithms in Graphs
Cited by 269
- Verified
Challenges and opportunities in quantum optimization
Abbas, A., Ambainis, A., Augustino, B., Bärtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D. J., Elmegreen, B. G., et al. (2024) · Nature Reviews Physics
Quantum Computing Algorithms and ArchitectureMetaheuristic Optimization Algorithms Research
Cited by 201
- Verified
Quantum Algorithms for Mixed Binary Optimization Applied to Transaction Settlement
Braine, L., Egger, D. J., Glick, J., & Woerner, S. (2021) · IEEE Transactions on Quantum Engineering
Quantum Computing Algorithms and ArchitectureMetaheuristic Optimization Algorithms Research
Cited by 51
- Verified
Provable bounds for noise-free expectation values computed from noisy samples
Barron, S. V., Egger, D. J., Pelofske, E., Bärtschi, A., Eidenbenz, S., Lehmkuehler, M., & Woerner, S. (2024) · Nature Computational Science
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 25
- Verified
Quantum Optimization Benchmarking Library - The Intractable Decathlon
Koch, T., Neira, D. E. B., Chen, Y., Cortiana, G., Egger, D. J., Heese, R., Hegade, N. N., Cadavid, A. G., Huang, R., Itoko, T., et al. (2025) · arXiv
Quantum Computing Algorithms and ArchitectureMetaheuristic Optimization Algorithms Research
Cited by 5
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free