Infeasible space reduction for QAOA through encoding change

Abstract:

In the era of Noisy Intermediate-Scale Quantum (NISQ) computing, the design of space-efficient and fault-tolerant quantum algorithms is inevitable. Considering the problems defined over permutations,  it becomes harder to reach the optimal solutions as for some problems the feasible solutions constitute only a small fraction of the whole space. Addressing these issues, we propose Encoding-Changing Quantum Approximate Optimization Algorithm (EC-QAOA), which bases on a different ansatz compared to the original QAOA. We demonstrate the effectiveness of the proposed method through the Travelling Salesman Problem. Furthermore, we show that the proposed approach enables quantum error mitigation using mid-circuit measurements. We compare the performance of the proposed method with the existing approaches by numerical studies.

‍

____________________________________________

Zoom meeting details 

Topic: Quantum Information and Quantum Computing Working Group
Time: June 17, 2021, 3:15 PM Warsaw
 
Join Zoom Meeting 

https://tinyurl.com/ctp-quantum

Meeting ID: 96294497969
Passcode: 729533

If you encounter any problems with connecting to the Zoom meeting, please email maciejewski@cft.edu.pl directly.

‍

‍

‍

‍

‍

‍

‍

‍

‍

‍

‍

‍