6 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…
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…
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…
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…
Full Characterization of the Depth Overhead for Quantum Circuit Compilation with Arbitrary Qubit Connectivity Constraint
Pei Yuan, Shengyu Zhang
In some physical implementations of quantum computers, 2-qubit operations can be applied only on certain pairs of qubits. Compilation of a quantum circuit into one compliant to suc…
Depth-Efficient Quantum Circuit Synthesis for Deterministic Dicke State Preparation
Pei Yuan, Shengyu Zhang
The -qubit -weight Dicke states , defined as the uniform superposition of all computational basis states with exactly qubits in state , form a b…