699 citations · 2.5k across the 44 of their papers we have counts for
8 papers · 2 filters
Distributionally Robust Variational Quantum Algorithms with Shifted Noise
Zichang He, Bo Peng, Yuri Alexeev +1
Given their potential to demonstrate near-term quantum advantage, variational quantum algorithms (VQAs) have been extensively studied. Although numerous techniques have been develo…
Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem
Ruslan Shaydulin, Changhao Li, Shouvanik Chakrabarti +26
The quantum approximate optimization algorithm (QAOA) is a leading candidate algorithm for solving optimization problems on quantum computers. However, the potential of QAOA to tac…
Fundamental causal bounds of quantum random access memories
Yunfei Wang, Yuri Alexeev, Liang Jiang +2
Quantum devices should operate in adherence to quantum physics principles. Quantum random access memory (QRAM), a fundamental component of many essential quantum algorithms for tas…
Quantum computing for finance
Dylan Herman, Cody Googin, Xiaoyuan Liu +5
Quantum computers are expected to surpass the computational capabilities of classical computers and have a transformative impact on numerous industry sectors. We present a comprehe…
Similarity-Based Parameter Transferability in the Quantum Approximate Optimization Algorithm
Alexey Galda, Eesh Gupta, Jose Falla +4
The quantum approximate optimization algorithm (QAOA) is one of the most promising candidates for achieving quantum advantage through quantum-enhanced combinatorial optimization. A…
Classical algorithm for simulating experimental Gaussian boson sampling
Changhun Oh, Minzhao Liu, Yuri Alexeev +2
Gaussian boson sampling is a promising candidate for showing experimental quantum advantage. While there is evidence that noiseless Gaussian boson sampling is hard to efficiently s…