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 2026Show all

9 papers · 1 filter

quant-ph2026

Decoupling of the QAOA into independent spin-boson systems and high-depth performance on pure and mixed spin glasses

Sami Boulebnane, Abid Khan, Pragna Subrahmanya +4

The Quantum Approximate Optimization Algorithm (QAOA) is regarded as a promising candidate for near-term quantum advantage in combinatorial optimization, yet our ability to study i…

quant-ph2026

Cycle Codes and Decoded Quantum Interferometry

Anuj Apte, Shouvanik Chakrabarti, Andi Gu +6

Decoded Quantum Interferometry (DQI) reduces optimization problems with two-variable constraints to decoding cycle codes. For one such problem, namely MaxCut, prior work showed tha…

quant-ph2026

Provable Classical and Quantum Local Algorithms for Max--Cut and Quantum Advantage at Moderate Girth

Anuj Apte, Abid Khan, Edward Farhi +3

Broadening the study of quantum optimization algorithms from binary to -element alphabets has been shown to open new avenues for potential quantum advantage. A quantum advantage…

cs.CR2026

Verifiable Random Sampling

Yeoh Wei Zhu, Soorya Rethinasamy, Anthony Alexiades Armenakas +3

Verifiable random functions (VRF) underpin a wide range of applications that require publicly verifiable evaluations of a pseudorandom function on a given input. However, once the…

quant-ph2026

Optimization Using Locally-Quantum Decoders

Noah Shutty, Avijit Mandal, Seyoon Ragavan +8

It was pointed out in [JSW+25] that widely-studied optimization problems such as D-regular max-k-XORSAT can be reduced to decoding of LDPC codes, using quantum algorithms related t…

quant-ph2026

Regularized Warm-Started Quantum Approximate Optimization and Conditions for Surpassing Classical Solvers on the Max-Cut Problem

Zichang He, Anuj Apte, Brandon Augustino +4

Demonstrating quantum heuristics that outperform strong classical solvers on large-scale optimization remains an open challenge. Here we introduce Regularized Warm-Started QAOA (RW…

quant-ph2026

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…

quant-ph2026

Digital signatures with classical shadows on near-term quantum computers

Pradeep Niroula, Minzhao Liu, Sivaprasad Omanakuttan +15

Quantum mechanics provides cryptographic primitives whose security is grounded in hardness assumptions independent of those underlying classical cryptography. However, existing pro…

quant-ph2026

Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut

Anuj Apte, Sami Boulebnane, Yuwei Jin +3

Quantum algorithms for binary optimization problems have been the subject of extensive study. However, the application of quantum algorithms to integer optimization problems remain…