Figure 1
From: A reduction from an LWE problem to maximum independent set problems
Upper bounds (Eq. 42) of the numbers of vertices of graphs reduced from n-dimensional LWE problems. They depend on the number of conditions \(m_\delta \) in Eq. (32). The number of qubits needed to encode the reduced problem is a few times the upper bound. For example, when \(n=40\) and \(m_\delta =4n\), the graph shows that the upper bound is about 40,000. Hence, approximately a few times 40,000 qubits are required to encode the reduced problem.
