The Quantum Cybersecurity Threat May Arrive Sooner Than You Think

Summary: In the era of NISQ computers, it is important to design quantum algorithms that do not require many qubits or deep circuits. This paper demonstrates how to reduce the number of qubits needed for the Traveling Salesman Problem and proposes encoding schemes that can be efficiently implemented within the Quantum Approximate Optimization Algorithm framework.