Hidden Matching Problem
COMPUTATION COMPLEXITY PROBLEM
User:HazelMSMurray/sandbox; Draft:Hidden Matching Problem
The Hidden Matching Problem is a computation complexity problem that can be solved using quantum protocols: Let n be a positive even integer. In the Hidden Matching Problem, Alice is given x \in \{0,1\}^n and Bob is given M \in \mathcal{M}_n(\mathcal{M}_n denotes the family of all possible perfect matchings on n nodes).