19 citations · 19 across the 4 of their papers we have counts for
6 papers · 1 filter
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…
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…
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…
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…
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…
Tensor networks for quantum computing
Aleksandr Berezutskii, Minzhao Liu, Atithi Acharya +25
In the rapidly evolving field of quantum computing, tensor networks serve as an important tool due to their multifaceted utility. In this paper, we review the diverse applications…