Walks, Paths and Connectivity · Hard problem

The $3$-dimensional hypercube graph $Q_3$ has one vertex for each binary string of length $3$, with an edge between two vertices exactly when their strings differ in one bit. Find $\kappa(Q_3)$, the vertex connectivity.