3 citations · 3 across the 10 of their papers we have counts for
10 papers
Quantum Circuit for General Unitary: Improved T-count via Block Flattening and Dilation
Pei Yuan, Shengyu Zhang, Wei Zi
Synthesizing arbitrary -qubit unitaries using as few non-Clifford gates as possible is a central problem in fault-tolerant quantum compilation. We present a Clifford+ quantum…
Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions
Wei Zi, Pei Yuan, Junhong Nie +1
Hamming weight computation maps an -bit input to the number of ones it contains. It is a basic subroutine in quantum computing, and the core building block for symmetric Boolean…
Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding
Tongyang Li, Fengning Ou, Xinzhao Wang +3
Many quantum algorithms require coherent access to classical data, often modeled by quantum read-only memory (QROM). We initiate the study of the count of sparse QROM,…
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…
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…
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…
Quantum Approximate Optimization Algorithms for Maximum Cut on Low-Girth Graphs
Tongyang Li, Yuexin Su, Ziyi Yang +1
Maximum cut (MaxCut) on graphs is a classic NP-hard problem. In quantum computing, Farhi, Gutmann, and Goldstone proposed the Quantum Approximate Optimization Algorithm (QAOA) for…
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…
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…