H. Philathong
YOU?
Author Swipe
View article: Computational phase transition signature in Gibbs sampling
Computational phase transition signature in Gibbs sampling Open
Gibbs sampling is fundamental to a wide range of computer algorithms. Such algorithms are set to be replaced by physics based processors—be it quantum or stochastic annealing devices—which embed problem instances and evolve a physical syst…
View article: Circuit depth scaling for quantum approximate optimization
Circuit depth scaling for quantum approximate optimization Open
Variational quantum algorithms are the centerpiece of modern quantum programming. These algorithms involve training parameterized quantum circuits using a classical co-processor, an approach adapted partly from classical machine learning. …
View article: Reachability Deficits Implicit in Google's Quantum Approximate Optimization of Graph Problems
Reachability Deficits Implicit in Google's Quantum Approximate Optimization of Graph Problems Open
The quantum approximate optimisation algorithm (QAOA) has become a cornerstone of contemporary quantum applications development. Here we show that the $density$ of problem constraints versus problem variables acts as a performance indicato…
View article: Reachability Deficits in Quantum Approximate Optimization
Reachability Deficits in Quantum Approximate Optimization Open
The quantum approximate optimization algorithm (QAOA) has rapidly become a cornerstone of contemporary quantum algorithm development. Despite a growing range of applications, only a few results have been developed towards understanding the…