Bipartite Graphs and Matchings · Hard problem

The $3$-dimensional hypercube graph $Q_3$ has vertices $\{0,1\}^3$ with an edge between any two strings differing in exactly one coordinate ($12$ edges total). How many perfect matchings does $Q_3$ have (as a spanning subgraph using every vertex exactly once)?