Quantum approximate optimization of bosonic finite-state systems
Shakib Daryanoosh
TL;DR
This work develops a Hamiltonian-based QAOA framework to tackle finite-dimensional bosonic problems on gate-based quantum hardware by designing problem-preserving mixers for three encodings: binary, symmetric, and unary. It shows that symmetric encoding, combined with the standard mixer, minimizes entangling resources and outperforms the other encodings in both initial-state preparation and measurement efficiency, while binary and unary encodings incur a $p$-fold growth in CX gate counts. The authors apply this approach to quantum approximate thermalization and to ground-state searches in the Bose-Hubbard model, demonstrating high-fidelity Gibbs-state approximation and strong-ground-state convergence in the strong-interaction regime, with more depth required for weakly interacting or highly entangled regimes. The results indicate that carefully engineered mixers can confine the variational search to feasible subspaces, offering a scalable route to simulate bosonic and other multi-level systems on near-term quantum devices, and point to future work in error mitigation, qudit-based hardware, and adaptive mixing strategies.
Abstract
There exist numerous problems in nature inherently described by finite $D$-dimensional states. Formulating these problems for execution on qubit-based quantum hardware requires mapping the qudit Hilbert space to that of multiqubit which may be exponentially larger. To exclude the infeasible subspace, one common approach relies on penalizing the objective function. However, this strategy can be inefficient as the size of the illegitimate subspace grows. Here we propose to employ the Hamiltonian-based quantum approximate optimization algorithm (QAOA) through devising appropriate mixing Hamiltonians such that the infeasible configuration space is ruled out. We investigate this idea by employing binary, symmetric, and unary mapping techniques. It is shown that the standard mixing Hamiltonian (sum of the bit-flip operations) is the optimal option for symmetric mapping, where the controlled-NOT gate count is used as a measure of implementation cost. In contrast, the other two encoding schemes witness a $p$-fold increase in this figure for a $p$-layer QAOA. We apply this framework to quantum approximate thermalization and find the ground state of the repulsive Bose-Hubbard model in the strong and weak interaction regimes.
