# finding subsets which meets conditions

I have a set S = {a, b, c, d, e, f} from which I need to find out if there exists two subsets S0 and S1 such that the sum of elements of S0 = sum of elements of S1. Also, the max of S0 and S1 cannot exceed h. I'm thinking of treating it as a search problem. I have to use quantum walk algorithm to solve and develop the quantum circuit for this as well. I understand that I can encode a to f using qubits for example, then create a circuit for finding sets of possible elements. And another circuit to identify those which meets the criteria. Where to begin? Any references could be of great help.

• Can you give some context that would explain why you posted this question on the quantum computing stackexchange? E.g. does the task require you to use a quantum circuit? Mar 17, 2023 at 8:45
• @RajivKrishnakumar yes, have to create the quantum circuit which does this. added context. thanks! Mar 17, 2023 at 9:50
• I'm not sure to understand, what prevents you from using $S_0=S_1$? Do you also have the condition that $S_0\cap S_1=\varnothing$? Mar 18, 2023 at 13:45
• If you have $S_0 \cup S_1 = S$ this would be the subset-sum problem. Should I assume you are looking for smaller-sized solutions? Mar 18, 2023 at 14:42
• @rhundt that's correct. for example, S={0,2,3,4,5,6} then S0= {0,2,3,5} and S1={4,6}. Yes to smaller-sized solutions. Interested to know what approaches to follow. Mar 18, 2023 at 17:20