Weak equivalence over forcing notions We know there are several definitions about forcing equivalence which imply that two forcings notions can be equivalent or not. In general we like to know the similarity between generic extensions by different forcings. Among them, we are familiar with complete embedding, densely embedding and so on. As a matter of fact If $\mathbb P$ and $\mathbb Q$ are two forcing notions, let's call them equivalent if their Boolean completion are isomorphic as Boolean algebras, then if it is the case we have V[G]=V[H], for any $\mathbb P$- generic filter $G$ and $\mathbb{Q}$- generic filter $H$.
I am interested to understand similarity between satisfaction of generic extension by different forcing notions forcing notions, let's unpack this:


Definition:
    Fix $V\models ZFC$, Let $P$ and $Q$ be two forcing notions in $V$, we say $\mathbb P$ is weakly equivalent to $\mathbb Q$, if $V[G]\equiv V[H]$(i.e $V[G]$ is elementary equivalnet to $V[H]$), for all $G$ and $H$ which are $\mathbb {P}$- generic and $\mathbb Q$- genric filters over V, respectively.


Remark 1: Weakly equivalence probably is not definable in $V$.

Question: Is there any characterization of the above-mentioned notion based on Boolean algebras or order structure of forcings? Or at least sufficient conditions for being weakly equivalent and there is nontrivial example i.e two foricngs which are not equivalent but weakly equivalent.

Remark 2: By a theorem of Golshani and Mitchell, there is a model of $ZFC$, such that $Coll(\omega, \kappa)$ is weakly equivalent to $Coll(\omega,\lambda)$, for all $\kappa$ and $\lambda$ infinite. Thus consistently there are forcing notions which are weakly equivalent, but not equivalent.
Remark 3: Note that in Golshani-Mitchell model, trivial forcing is also weakly equivalent to collapse forcing, so it seems the situation is complicated.
 A: Let me provide the alternative kind of example. 
Theorem. If ZFC is consistent, then there is a model of ZFC in which any two weakly equivalent forcing notions are forcing equivalent. 
Proof. Consider a pointwise definable
model $M$ that remains definable in all its set-forcing extensions,
such as a pointwise definable model of $V=L$. Suppose that $\newcommand\P{\mathbb{P}}\P\equiv\newcommand\Q{\mathbb{Q}}\Q$ are weakly equivalent. I claim that $\P$ and $\Q$ are forcing equivalent, in the sense
that they give rise to the same forcing extensions. 
To see this, suppose that $G\subset\P$ and $H\subset\Q$ are $M$-generic. The theory of $M[G]$ includes the assertion that
the universe was obtained by forcing over $M$ with the poset $\P$,
and this is expressible since $M$ is definable in $M[G]$ and $\P$ is definable in $M$. Thus, since $M[H]$ has the same theory, it follows that this statement is also true in $M[H]$, and so $M[H]=M[G']$ for some $M$-generic
filter $G'\subset\P$. So every forcing extension by $\Q$ can be realized as a forcing extension by $\P$ and vice versa, and so the forcing notions are equivalent. QED
Let me remark further that your notion of equivalence applies only to forcing notions
$\newcommand\P{\mathbb{P}}\P$ with the property that all conditions
force the same sentences, since in particular every forcing
extension by $\P$ itself must have the same theory. Let us call
these the sententially homogeneous forcing notions. These are the forcing notions $\P$ with $\P\equiv\P$. Note that $\P\equiv\Q$ implies $\P\equiv\P$ and $\Q\equiv\Q$.
In the model of my proof, two forcing notions are weakly equivalent $\P\equiv\Q$ just in case they are each sententially homogeneous and $\P$ and $\Q$ are forcing equivalent. So it is relatively consistent with ZFC that weak equivalence is the restriction of a definable relation to the class of forcing notions to which it applies, the sententially homogeneous forcing notions. Meanwhile, I suspect that the question of whether a forcing notion is sententially homogeneous is not generally expressible in the language of set theory.
Aside. You said that two forcing notions are equivalent if and only
if their Boolean algebras are isomorphic, but that is too strong,
since a large lottery sum of a partial order with itself is forcing
equivalent, in the sense that it gives rise to exactly the same forcing extensions, but the Boolean algebra is much larger (and has a bad chain condition and so on). The solution is to restrict the forcing to
the cone below a condition. You want to say that two notions are
equivalent, if they give rise to exactly the same forcing
extensions, and this can be expressed in terms of their Boolean
algebras by the assertion: below any respective conditions in their
Boolean algebras, one can find still deeper isomorphic lower cones. See my
related blog post, Common forcing extension via different forcing
notions.
