The connection between secret sharing and matroid theory is well-established through the framework of polymatroid ports. In recent years, there has been significant interest in q-polymatroids, the q-analogues of matroids. Rank-metric codes provide a natural class of q-polymatroids, known as representable q-polymatroids. In this work, we introduce q-analogues of access structures and polymatroid ports. Specifically, we explore their basic properties, including minors and duality. Finally, we examine how rank-metric codes give rise to such schemes and demonstrate how the induced rank function can be characterized using the entropy of random variables derived from the associated rank-metric code.