For $n=l+1$, pursuant to the instruction immediately following eq. (23) in https://arxiv.org/abs/1607.03364 I desire "$Q\in \mathrm{SO}(l+1)$ with elements in the last row being $Q_{(l+1)j} = \sqrt{p_j}$; $p_j\geq 0$, and $\sum_{j=1}^{l+1} p_j = 1$."
Is there a general construction available? It would seem that such $Q$'s would certainly not be unique.
Given--as angryavian emphasizes in his answer--the nonuniqueness of the candidates, can one reasonably aim to construct matrices with "simple" characteristics, that might facilitate subsequent analyses? The simplest in nature would seem to be a matrix in which all entries have the same absolute value (Hadamard matrices being an example).
If the last row is given to you, then you can apply the Gram-Schmidt process to extend it to an orthonormal basis over $\mathbb{R}^{l+1}$, and let these be the remaining rows of your matrix. This gives you an orthogonal matrix $Q$. If its determinant is $-1$, then you can negate one of the rows to change its determinant to $1$. There is definitely not a unique $Q$.