A four-player potential game for barren-plateau-aware quantum ansatz design
Rub\'en Dar\'io Guerrero

TL;DR
This paper introduces a four-player potential game framework for designing parameterized quantum circuits, optimizing for trainability, non-stabilizerness, task performance, and hardware cost, demonstrated through various experiments.
Contribution
It formulates quantum circuit design as a multi-objective game and develops a Nash search method to optimize multiple circuit properties simultaneously.
Findings
Nash search achieves high potential on hardware topologies.
Seeding Nash from a Givens-doubles ansatz yields efficient circuits for LiH.
The framework complements energy-only searches like ADAPT-VQE.
Abstract
We cast the design of parameterized quantum circuits as a four-player potential game whose state is a circuit directed acyclic graph (DAG) and whose players encode trainability, non-stabilizerness, task performance, and hardware cost. Per-player restricted action sets factorize the move space into append, remove, retype, and rewire operations; a block-coordinate -Nash residual certifies that no single player can improve unilaterally. A single weight sweep on MaxCut traces a Pareto frontier from a Clifford endpoint to a non-Clifford endpoint . On three four-qubit hardware topologies (heavy-hex, grid, Rydberg all-to-all), Nash search achieves the highest mean potential; on the grid Nash reaches the theoretical ceiling on two of five seeds while the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
