It is well-known that the logarithms of prime numbers are linearly independent over $\mathbb Q$. It is also known that the question whether the logarithms are algebraically independent over $\mathbb Q$ is an open problem.
What is known about the next to linear by complexity case? Are the logarithms of primes quadratically independent over $\mathbb Q$, i.e. $$\sum_{ij\le N}a_{ij} \log p_i \log p_j = 0, \quad a_{ij} \in \mathbb Q, \quad \implies a_{ij} = -a_{ji} $$?