Graph isomorphism problem setting up state to put into QFT matrix
Summarize this article with:
Suppose we had a graph with n vertices and m edges where My plan to encode the data into qubits is to: Take a n×(n-1) matrix and if there is a edge between 2 vertices then write 1 to the matrix if not then write 0. Straighten the matrix into n×(n-1) x 1.Now it's ok this is common practice for graphs.Now to the point of the question.I want to encode as a qubit with 2 basis states :the value of the basis state 0 will be 1 if there is a edge in the first matrix while the value of the basis state will be 1 if there is a edge in the second matrix.Then u each put info into n×(n-1) Hadamard gates to initialise.This is the way right?because graph isomorphism even tho edges and vertices may not be 1 to 1 is all about the quality and quantity of connections Now about the oracle:Do you have any idea about what oracle do I need to use to feed it into the QFT? Thanks. submitted by /u/Routine_Comb_7277 [link] [comments]