Venturelli, Davide
Ames Research Center · Research Institute for Advanced Computer Science
6 papers on CoChatORCID 0000-0003-0452-7603
Most cited papers
- Verified
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
Hadfield, S., Wang, Z., O’Gorman, B., Rieffel, E. G., Venturelli, D., & Biswas, R. (2019) · Algorithms
Quantum Computing Algorithms and ArchitectureQuantum many-body systems
Cited by 772
- Verified
Reverse quantum annealing approach to portfolio optimization problems
Venturelli, D., & Kondratyev, A. (2019) · Quantum Machine Intelligence
Quantum Computing Algorithms and ArchitectureRisk and Portfolio Optimization
Cited by 233
- Verified
Quantum Optimization of Fully Connected Spin Glasses
Venturelli, D., Mandrà, S., Knysh, S., O’Gorman, B., Biswas, R., & Smelyanskiy, V. (2015) · Physical Review X
Quantum Computing Algorithms and ArchitectureTheoretical and Computational Physics
Cited by 209
- Verified
Quantum Annealing Applied to De-Conflicting Optimal Trajectories for Air Traffic Management
Stollenwerk, T., O'Gorman, B., Venturelli, D., Mandra, S., Rodionova, O., Ng, H., Sridhar, B., Rieffel, E. G., & Biswas, R. (2020) · IEEE Transactions on Intelligent Transportation Systems
Air Traffic Management and OptimizationQuantum Computing Algorithms and Architecture
Cited by 129
- Verified
Quantum Approximate Optimization with Hard and Soft Constraints
Hadfield, S., Wang, Z., Rieffel, E. G., O'Gorman, B., Venturelli, D., & Biswas, R. (2017) · Proceedings of the Second International Workshop on Post Moores Era Supercomputing
Quantum Computing Algorithms and ArchitectureMetaheuristic Optimization Algorithms Research
Cited by 51
- Verified
Improving Quantum Approximate Optimization by Noise-Directed Adaptive Remapping
Maciejewski, F. B., Biamonte, J., Hadfield, S., & Venturelli, D. (2025) · Quantum
Quantum Computing Algorithms and ArchitectureMetaheuristic Optimization Algorithms Research
Cited by 10
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free