154 citations · 203 across the 4 of their papers we have counts for
5 papers
On Circuit Depth Scaling For Quantum Approximate Optimization
V. Akshay, H. Philathong, E. Campos +4
Variational quantum algorithms are the centerpiece of modern quantum programming. These algorithms involve training parameterized quantum circuits using a classical co-processor, a…
Computational Phase Transitions: Benchmarking Ising Machines and Quantum Optimisers
Hariphan Philathong, Vishwa Akshay, Ksenia Samburskaya +1
While there are various approaches to benchmark physical processors, recent findings have focused on computational phase transitions. This is due to several factors. Importantly, t…
Reachability Deficits in Quantum Approximate Optimization of Graph Problems
V. Akshay, H. Philathong, I. Zacharov +1
The quantum approximate optimization algorithm (QAOA) has become a cornerstone of contemporary quantum applications development. Here we show that the \emph{density} of problem con…
Computational Phase Transition Signature in Gibbs Sampling
H. Philathong, V. Akshay, I. Zacharov +1
Gibbs sampling is fundamental to a wide range of computer algorithms. Such algorithms are set to be replaced by physics based processorsbe it quantum or stochastic annealing dev…
Reachability Deficits in Quantum Approximate Optimization
V. Akshay, H. Philathong, M. E. S. Morales +1
The quantum approximate optimization algorithm (QAOA) has rapidly become a cornerstone of contemporary quantum algorithm development. Despite a growing range of applications, only…