Lykov, Danylo

Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem

Shaydulin, R., Li, C., Chakrabarti, S., DeCross, M., Herman, D., Kumar, N., Larson, J., Lykov, D., Minssen, P., Sun, Y., et al. (2024) · Science Advances

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 120

Transferability of optimal QAOA parameters between random graphs

Galda, A., Liu, X., Lykov, D., Alexeev, Y., & Safro, I. (2021) · 2021 IEEE International Conference on Quantum Computing and Engineering (QCE)

Quantum Computing Algorithms and ArchitectureQuantum many-body systems

Cited by 72

The computational power of random quantum circuits in arbitrary geometries

DeCross, M., Haghshenas, R., Liu, M., Rinaldi, E., Gray, J., Alexeev, Y., Baldwin, C. H., Bartolotta, J. P., Bohn, M., Chertkov, E., et al. (2024) · arXiv

Quantum Computing Algorithms and ArchitectureQuantum many-body systems

Cited by 45

Fast Simulation of High-Depth QAOA Circuits

Lykov, D., Shaydulin, R., Sun, Y., Alexeev, Y., & Pistoia, M. (2023) · Proceedings of the SC '23 Workshops of the International Conference on High Performance Computing, Network, Storage, and Analysis

Quantum Computing Algorithms and ArchitectureQuantum many-body systems

Cited by 27