activity
20212026
most citedImportance of Kernel Bandwidth in Quantum Machine Learning

64 citations · 214 across the 31 of their papers we have counts for

collaborators
Showing 2024Show all

9 papers · 1 filter

quant-ph2024

Generalized Short Path Algorithms: Towards Super-Quadratic Speedup over Markov Chain Search for Combinatorial Optimization

Shouvanik Chakrabarti, Dylan Herman, Guneykan Ozgul +6

We analyze generalizations of quantum algorithms based on the short path framework first proposed by Hastings~[\textit{Quantum} 2, 78 (2018)], which has been extended and shown by…

quant-ph2024★ 9 cited

Performance of Quantum Approximate Optimization with Quantum Error Detection

Zichang He, David Amaro, Ruslan Shaydulin +1

Quantum algorithms must be scaled up to tackle real-world applications. Doing so requires overcoming the noise present on today's hardware. The quantum approximate optimization alg…

math.OC2024★ 6 cited

Decomposition Pipeline for Large-Scale Portfolio Optimization with Applications to Near-Term Quantum Computing

Atithi Acharya, Romina Yalovetzky, Pierre Minssen +10

Industrially relevant constrained optimization problems, such as portfolio optimization and portfolio rebalancing, are often intractable or difficult to solve exactly. In this work…

quant-ph2024★ 7 cited

Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era

Zichang He, Ruslan Shaydulin, Dylan Herman +4

Quantum Approximate Optimization Algorithm (QAOA) is one of the most promising quantum heuristics for combinatorial optimization. While QAOA has been shown to perform well on small…

quant-ph2024★ 2 cited

End-to-End Protocol for High-Quality QAOA Parameters with Few Shots

Tianyi Hao, Zichang He, Ruslan Shaydulin +2

The quantum approximate optimization algorithm (QAOA) is a quantum heuristic for combinatorial optimization that has been demonstrated to scale better than state-of-the-art classic…

quant-ph2024★ 32 cited

The computational power of random quantum circuits in arbitrary geometries

Matthew DeCross, Reza Haghshenas, Minzhao Liu +49

Empirical evidence for a gap between the computational powers of classical and quantum computers has been provided by experiments that sample the output distributions of two-dimens…

quant-ph2024

Variational Quantum Algorithm Landscape Reconstruction by Low-Rank Tensor Completion

Tianyi Hao, Zichang He, Ruslan Shaydulin +2

Variational quantum algorithms (VQAs) are a broad class of algorithms with many applications in science and industry. Applying a VQA to a problem involves optimizing a parameterize…

quant-ph2024★ 1 cited

Quantum counterdiabatic driving enhanced by two-stage local control

Changhao Li, Jiayu Shen, Ruslan Shaydulin +1

Counterdiabatic driving can suppress diabatic losses during adiabatic ground state preparation. As its implementation necessitates the generation of an adiabatic gauge potential, w…

quant-ph2024

Q-CHOP: Quantum constrained Hamiltonian optimization

Michael A. Perlin, Ruslan Shaydulin, Benjamin P. Hall +7

Combinatorial optimization problems that arise in science and industry typically have constraints. Yet the presence of constraints makes them challenging to tackle using both class…