3 citations · 3 across the 5 of their papers we have counts for
14 papers
Fault-tolerant execution of error-corrected quantum algorithms
Michael A. Perlin, Zichang He, Anthony Alexiades Armenakas +9
Scaling up quantum algorithms to tackle high-impact problems in science and industry requires quantum error correction and fault tolerance. While progress has been made in experime…
Quantum Speedups for Group Relaxations of Integer Linear Programs
Brandon Augustino, Dylan Herman, Guneykan Ozgul +5
Integer Linear Programs (ILPs) are a flexible and ubiquitous model for discrete optimization problems. Solving ILPs is \textsf{NP-Hard} yet of great practical importance. Super-qua…
Quantum Speedups for Derivative Pricing Beyond Black-Scholes
Dylan Herman, Yue Sun, Jin-Peng Liu +5
This paper explores advancements in quantum algorithms for derivative pricing of exotics, a computational pipeline of fundamental importance in quantitative finance. For such cases…
Mechanisms for Quantum Advantage in Global Optimization of Nonconvex Functions
Dylan Herman, Guneykan Ozgul, Anuj Apte +4
We present new theoretical mechanisms for quantum speedup in the global optimization of nonconvex functions, expanding the scope of quantum advantage beyond traditional tunneling-b…
A simple analysis of a quantum-inspired algorithm for solving low-rank linear systems
Tyler Chen, Junhyung Lyle Kim, Archan Ray +3
We describe and analyze a simple algorithm for sampling from the solution to a linear system . We assume…
Spin-Boson Mapping of the Quantum Approximate Optimization Algorithm
Sami Boulebnane, Abid Khan, Minzhao Liu +4
The Quantum Approximate Optimization Algorithm (QAOA) achieves monotonically improving performance with circuit depth , yet the study of the high-depth regime has been obstructe…