193 citations · 474 across the 15 of their papers we have counts for
9 papers · 1 filter
Measurements Number Scaling in the Quantum Approximate Optimization Algorithm for MaxCut: A Statistical Analysis
Inbar Chefer, Uri Shaham, Adi Makmal
We provide a statistical analysis of the measurement (shot) requirements of the quantum approximate optimization algorithm (QAOA) for the MaxCut problem. We derive sufficient condi…
A Variational Qubit-Efficient MaxCut Heuristic Algorithm
Yovav Tene-Cohen, Tomer Kelman, Ohad Lev +1
MaxCut is a key NP-Hard combinatorial optimization graph problem with extensive theoretical and industrial applications, including the Ising model and chip design. While quantum co…
A Qubit-Efficient Variational Selected Configuration-Interaction Method
Daniel Yoffe, Amir Natan, Adi Makmal
Finding the ground-state energy of molecules is an important and challenging computational problem for which quantum computing can potentially find efficient solutions. The variati…
Iterative-Free Quantum Approximate Optimization Algorithm Using Neural Networks
Ohad Amosy, Tamuz Danzig, Ely Porat +2
The quantum approximate optimization algorithm (QAOA) is a leading iterative variational quantum algorithm for heuristically solving combinatorial optimization problems. A large po…
Approximate encoding of quantum states using shallow circuits
Matan Ben Dov, David Shnaiderov, Adi Makmal +1
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates…
Quantum walks on embedded hypercubes: Nonsymmetric and nonlocal cases
Adi Makmal, Markus Tiersch, Clemens Ganahl +1
The expected hitting time of discrete quantum walks on a hypercube (HC) is numerically known to be exponentially shorter than that of their classical analogs in terms of the scalin…