46 citations · 87 across the 13 of their papers we have counts for
15 papers
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…
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…
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…
Threshold for Fault-tolerant Quantum Advantage with the Quantum Approximate Optimization Algorithm
Sivaprasad Omanakuttan, Zichang He, Zhiwei Zhang +9
Optimization is often cited as a promising application of quantum computers. However, the low degree of provable quantum speedups has led prior rigorous end-to-end resource analyse…
Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm
Anuj Apte, Shree Hari Sureshbabu, Ruslan Shaydulin +5
Quantum Approximate Optimization Algorithm (QAOA) is a promising quantum heuristic with empirical evidence of speedup over classical state-of-the-art for some problems. QAOA uses a…
Quantum Approximate Optimization Algorithm in Finite Size and Large Depth and Equivalence to Quantum Annealing
Sami Boulebnane, James Sud, Ruslan Shaydulin +1
The quantum approximate optimization algorithm (QAOA) and quantum annealing are two of the most popular quantum optimization heuristics. While QAOA is known to be able to approxima…
Applying the quantum approximate optimization algorithm to general constraint satisfaction problems
Sami Boulebnane, Maria Ciudad-Alañón, Lana Mineh +2
In this work we develop theoretical techniques for analysing the performance of the quantum approximate optimization algorithm (QAOA) when applied to random boolean constraint sati…
Solving boolean satisfiability problems with the quantum approximate optimization algorithm
Sami Boulebnane, Ashley Montanaro
The quantum approximate optimization algorithm (QAOA) is one of the most prominent proposed applications for near-term quantum computing. Here we study the ability of QAOA to solve…
Peptide conformational sampling using the Quantum Approximate Optimization Algorithm
Sami Boulebnane, Xavier Lucas, Agnes Meyder +2
Protein folding -- the problem of predicting the spatial structure of a protein given its sequence of amino-acids -- has attracted considerable research effort in biochemistry in r…
Predicting parameters for the Quantum Approximate Optimization Algorithm for MAX-CUT from the infinite-size limit
Sami Boulebnane, Ashley Montanaro
Combinatorial optimization is regarded as a potentially promising application of near and long-term quantum computers. The best-known heuristic quantum algorithm for combinatorial…
Improving the Quantum Approximate Optimization Algorithm with postselection
Sami Boulebnane
Combinatorial optimization is among the main applications envisioned for near-term and fault-tolerant quantum computers. In this work, we consider a well-studied quantum algorithm…
Approximate quantum non-demolition measurements
Sami Boulebnane, Mischa P. Woods, Joseph M. Renes
With the advent of gravitational wave detectors employing squeezed light, quantum waveform estimation---estimating a time-dependent signal by means of a quantum-mechanical probe---…
Cold light dark matter in extended seesaw models
Sami Boulebnane, Julian Heeck, Anne Nguyen +1
We present a thorough discussion of light dark matter produced via freeze-in in two-body decays A -> B DM. If A and B are quasi-degenerate, the dark matter particle has a cold spec…