Neven, Hartmut
Google (United States)
30 papers on CoChatORCID 0000-0002-9681-6746
Most cited papers
- Verified
For Fixed Control Parameters the Quantum Approximate Optimization Algorithm's Objective Function Value Concentrates for Typical Instances
Brandao, F. G. S. L., Broughton, M., Farhi, E., Gutmann, S., & Neven, H. (2018) · arXiv
Quantum Computing Algorithms and ArchitectureQuantum many-body systems
Cited by 88
- Verified
Scaling and logic in the colour code on a superconducting quantum processor
Lacroix, N., Bourassa, A., Heras, F. J. H., Zhang, L. M., Bausch, J., Senior, A. W., Edlich, T., Shutty, N., Sivak, V., Bengtsson, A., et al. (2025) · Nature
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 51
- Verified
Low depth mechanisms for quantum optimization
McClean, J. R., Harrigan, M. P., Mohseni, M., Rubin, N. C., Jiang, Z., Boixo, S., Smelyanskiy, V. N., Babbush, R., & Neven, H. (2020) · arXiv
Quantum Computing Algorithms and ArchitectureMetaheuristic Optimization Algorithms Research
Cited by 45
- Verified
Testing the Conjecture That Quantum Processes Create Conscious Experience
Neven, H., Read, P., Kosik, K. S., Van der Molen, T., Bouwmeester, D., Bodnia, E., Turin, L., & Koch, C. (2024) · Entropy
Philosophy and Theoretical ScienceQuantum Mechanics and Applications
Cited by 33
- Verified
Quantum simulation of exact electron dynamics can be more efficient than classical mean-field methods
Babbush, R., Huggins, W. J., Berry, D. W., Ung, S. F., Zhao, A., Reichman, D. R., Neven, H., Baczewski, A. D., & Lee, J. (2023) · Nature Communications
Quantum Computing Algorithms and ArchitectureQuantum many-body systems
Cited by 32
- Verified
Efficient approximation of experimental Gaussian boson sampling
Villalonga, B., Niu, M. Y., Li, L., Neven, H., Platt, J. C., Smelyanskiy, V. N., & Boixo, S. (2021) · arXiv
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 16
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free