Symmetry-enhanced Counterdiabatic Quantum Algorithm for Qudits

TL;DR

This paper introduces a symmetry-enhanced counterdiabatic quantum algorithm using qudits, achieving circuit depth reduction, more efficient problem representation, and fewer parameters, demonstrated on Max-3-Cut and qutrit W state problems.

Contribution

It presents a novel qudit-based counterdiabatic quantum algorithm with symmetry enhancements, improving efficiency and feasibility for near-term quantum devices.

Findings

Better convergence with lower circuit depth

Reduced measurement overhead

Enhanced problem representation efficiency

Abstract

Qubit-based variational quantum algorithms have undergone rapid development in recent years but still face several challenges. In this context, we propose a symmetry-enhanced digitized counterdiabatic quantum algorithm utilizing qudits instead of qubits. This approach offers three types of compression as compared to with respect to conventional variational circuits. First, compression in the circuit depth is achieved by counterdiabatic protocols. Second, information about the problem is compressed by replacing qubits with qudits, allowing for a more efficient representation of the problem. Lastly, the number of parameters is reduced by employing the symmetries of the system. We illustrate this approach by tackling a graph-based optimization problem Max-3-Cut and a highly-entangled state preparation, the qutrit W state. As our numerical results show, we achieve a better convergence with a lower circuit depth and less measurement overhead in all the cases considered. This work leads to a better design of shallow variational quantum circuits, improving the feasibility of their implementation on near-term qudit devices