1 citations · 1 across the 7 of their papers we have counts for
7 papers
The Dynamical Lie Algebra of QAOA-MaxCut on the Complete Graph
Jonathan Allcock, Pei Yuan, Shengyu Zhang
We give an analytical expression for the dynamical Lie algebra corresponding to the QAOA-MaxCut problem on complete graphs, and show that the variance of the associated loss functi…
QAOA-MaxCut has barren plateaus for almost all graphs
Rui Mao, Pei Yuan, Jonathan Allcock +1
The QAOA has been the subject of intense study over recent years, yet the corresponding Dynamical Lie Algebra (DLA)--a key indicator of the expressivity and trainability of VQAs--r…
Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
Jonathan Allcock, Joao F. Doriguello, Gábor Ivanyos +1
Bell sampling is a simple yet powerful tool based on measuring two copies of a quantum state in the Bell basis, and has found applications in a plethora of problems related to stab…
On generating direct powers of dynamical Lie algebras
Jonathan Allcock, Miklos Santha, Pei Yuan +1
The expressibility and trainability of parameterized quantum circuits has been shown to be intimately related to their associated dynamical Lie algebras (DLAs). From a quantum algo…
On the dynamical Lie algebras of quantum approximate optimization algorithms
Jonathan Allcock, Miklos Santha, Pei Yuan +1
Dynamical Lie algebras (DLAs) have emerged as a valuable tool in the study of parameterized quantum circuits, helping to characterize both their expressiveness and trainability. In…
Beyond Bell sampling: stabilizer state learning and quantum pseudorandomness lower bounds on qudits
Jonathan Allcock, Joao F. Doriguello, Gábor Ivanyos +1
Bell sampling is a simple yet powerful measurement primitive that has recently attracted a lot of attention, and has proven to be a valuable tool in studying stabiliser states. Unf…
On the quantum time complexity of divide and conquer
Jonathan Allcock, Jinge Bao, Aleksandrs Belovs +2
We initiate a systematic study of the time complexity of quantum divide and conquer algorithms for classical problems. We establish generic conditions under which search and minimi…