Showing quant-phShow all
3 papers · 1 filter
quant-ph2026
Disentangling QAOA: From Weakly Entangled Circuits to a Classical QUBO Solver
Boris I. Bantysh, Andrey Yu. Chernyavskiy, Denis A. Kulikov +2
The role of entanglement in quantum optimization remains actively debated. To address this question, we focus on the fixed-parameter expanding-depth regime of the quantum approxima…
quant-ph2025
Evidence for effectively constant shot complexity in the quantum approximate optimization algorithm without per-instance optimization
Andrey Yu. Chernyavskiy, Denis A. Kulikov, Boris I. Bantysh +3
We study a modified fixed-point version of the Quantum Approximate Optimization Algorithm (fpQAOA), where parameters are trained classically on small instances and then transferred…
quant-ph2023
Minimizing the negativity of quantum circuits in overcomplete quasiprobability representations
Denis A. Kulikov, Vsevolod I. Yashin, Aleksey K. Fedorov +1
The problem of simulatability of quantum processes using classical resources plays a cornerstone role for quantum computing. Quantum circuits can be simulated classically, e.g., us…