Showing quant-phShow all
2 papers · 1 filter
quant-ph2026★ 12 cited
Mind the gap: Achieving a super-Grover quantum speedup by jumping to the end
Alexander M. Dalzell, Nicola Pancotti, Earl T. Campbell +1
We present a quantum algorithm that has rigorous runtime guarantees for several families of binary optimization problems, including Quadratic Unconstrained Binary Optimization (QUB…
quant-ph2024
End-to-end resource analysis for quantum interior point methods and portfolio optimization
Alexander M. Dalzell, B. David Clader, Grant Salton +8
We study quantum interior point methods (QIPMs) for second-order cone programming (SOCP), guided by the example use case of portfolio optimization (PO). We provide a complete quant…