Let $|\psi\rangle = C_1 |0^{n}\rangle$ be a quantum state, such that $C_1$ is a Haar random unitary circuit. Consider a density matrix $\rho$ as follows
\begin{equation} \rho_1 = \mathbb{E}[|\psi\rangle\langle \psi|], \end{equation} where the expectation is taken over the circuits.
Now, consider another family of states $|\phi\rangle = C_2 |0^{n}\rangle$, where $|\phi\rangle$ is a sufficiently deep random quantum circuit, comprising of layers of local one and two qubit random unitaries drawn from the Haar measure, such that the output distribution of $C_2$ when measured in the standard basis is a Porter-Thomas distribution. In other words, it is a type of circuit used in the Google quantum supremacy experiment. Let \begin{equation} \rho_2 = \mathbb{E}[|\phi\rangle\langle \phi|], \end{equation} where the expectation is taken over all circuits of type $C_2$.
I am trying to show that \begin{equation} \rho_1 = \frac{\mathbb{I}}{{2^{n}}}, \end{equation} and that the trace distance of $\rho_1$ and $\rho_2$ is very small.
That $\rho_1$ is the maximally mixed state is qualitatively easy to see --- $\rho_1$ is essentially a uniform distribution over all possible quantum states. But I could not do this mathematically.