A contribution, not an answer.
First, I'd rephrase the description. The original $X$ is a Poisson process with arrival rate $\lambda$. To build $Y$ you have a separate $(0,1)$ state $A$ determined by flipping a fair coin at each $X$ arrival and switching $A$ when the coin comes up heads. You put the value of $X$ into $Y$ just when the state is $1$.
My intuition says this is memoryless, hence a Poisson process.
The simulation is @Codutie 's answer suggests that the rate is $\lambda/4$. If that's true it's probably a consequence of the fact that the expected number of tosses to get the next head is $2$.
What if the coin toss to switch states is biased, with probability $p$ for heads?
Then the expected number of tosses for the next head is $1/p$. When $p$ is small you get long periods in which you accept $X$ and long periods when you don't. My intuition gives out trying to decide whether that bunching destroys the Poisson-ness. If it doesn't then I'd guess the rate to be $\lambda p/4$. Maybe that's the rate even if the process is no longer Poisson.
You could get more information by running the simulation for a biased coin with probability $p$ for heads.
Maybe someone will step up and prove something first.