The partial representation extension problem, introduced by Klav{i}k et al. (2011), generalizes the recognition problem. In this short note we show that this problem is NP-complete for unit circular-arc graphs.