3 papers
quant-ph2026
Scalable Clifford-Based Classical Initialization for the Quantum Approximate Optimization Algorithm
Dhanvi Bharadwaj, Yuewen Hou, Guang-Yi Li +1
Variational Quantum Algorithms (VQAs), such as the Quantum Approximate Optimization Algorithm (QAOA), offer a promising route to tackling combinatorial optimization problems on nea…
quant-ph2025
Provably Efficient Quantum Algorithms for Solving Nonlinear Differential Equations Using Multiple Bosonic Modes Coupled with Qubits
Yu Gan, Hirad Alipanah, Jinglei Cheng +7
Quantum computers have long been expected to efficiently solve complex classical differential equations. Most digital, fault-tolerant approaches use Carleman linearization to map n…
quant-ph2025
A parity obstruction to degree-optimal syndrome extraction in bivariate bicycle codes
Guangyi Li, Yu Gan, Zeguan Wu +3
Syndrome extraction for a CSS code has depth at least the Tanner-graph degree , attained by edge colouring if gate order is ignored; correctness adds a parity constraint. We pro…