Exploring Entanglement and Parameter Sensitivity in QAOA through Quantum Fisher Information

Abstract

Quantum Fisher Information (QFI) can be used to quantify how sensitive a quantum state reacts to changes in its variational parameters, making it a natural diagnostic for algorithms such as the Quantum Approximate Optimization Algorithm (QAOA). We perform a systematic QFI analysis of QAOA for Max-Cut on cyclic and complete graphs with $N=4-10$ qubits. Two mixer families are studied, RX-only and hybrid RX-RY, with depths $p=2,4,6$ and $p=3,6,9$, respectively, and with up to three entanglement stages implemented through cyclic- or complete-entangling patterns. Complete graphs consistently yield larger QFI eigenvalues than cyclic graphs; none of the settings reaches the Heisenberg limit ($4N^2$), but several exceed the linear bound ($4N$). Introducing entanglement primarily redistributes QFI from diagonal to off-diagonal entries: non-entangled circuits maximize per-parameter (diagonal) sensitivity, whereas entangling layers increase the covariance fraction and thus cross-parameter correlations, with diminishing returns beyond the first stage. Leveraging these observations, we propose, as a proof of concept, a QFI-Informed Mutation (QIm) heuristic that sets mutation probabilities and step sizes from the normalized diagonal QFI. On 7- and 10-qubit instances, QIm attains higher mean energies and lower variance than equal-probability and random-restart baselines over 100 runs, underscoring QFI as a lightweight, problem-aware preconditioner for QAOA and other variational quantum algorithms.

17 pages, 16 higures, 1 table

References in corpus (21)

• Quantum Computing in the NISQ era and beyond
• Barren plateaus in quantum neural network training landscapes
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Quantum metrology from a quantum information science perspective
• Quantum Fisher information matrix and multiparameter estimation
• Quantum limits in optical interferometry
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• Quantum Natural Gradient
• Quantum Approximate Optimization Algorithm for MaxCut: A Fermionic View
• QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
• Compatibility in Multiparameter Quantum Metrology
• Interaction-based quantum metrology showing scaling beyond the Heisenberg limit
• A Geometric Perspective on Quantum Parameter Estimation
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• Fisher Information in Noisy Intermediate-Scale Quantum Applications
• Benchmarking the performance of portfolio optimization with QAOA
• Quantum natural gradient generalised to noisy and non-unitary circuits
• Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems
• Robust estimation of the Quantum Fisher Information on a quantum processor
• Variational quantum algorithms to estimate rank, quantum entropies, fidelity and Fisher information via purity minimization
• Performance Analysis of Multi-Angle QAOA for p > 1