Let $f(x)=x^4+b_3 x^3+ b_2 x^2+b_1 x + b_0$.
Let $g(x)=x^4 f(1/x)$. Let $C : g(x)=y^2$.
$C$ is birationally equivalent to $f(x)=y^2$.
The constant coefficient of $g(x)$ is $1$ since $f$ is monic and $(0,1)$ is on $C$.
On the internet we found reduction quartic with square coefficient to Weierstrass model of the elliptic curve with point of infinite order.
One family of failures are $f(x)=x^4+b_2 x^2 + b_0$.
Q1 Is every sufficiently general monic quartic rational square infinitely often?
Q2 Is this known?
sagemath session with the reduction:
sage: K.<x>=QQ[]
sage: f=x^4+5*x^3+x^2+13*x+2;g=numerator(x^4*f(1/x))
sage: E,phi,psi,poi=quarToEll(g)
sage: P2=3*E(poi);P2.order()
+Infinity
sage: Pq=psi[0](P2.xy()),psi[1](P2.xy())
sage: factor(f(1/Pq[0]))
2^-16 * 13^-4 * 137^2 * 5940889^2
def quarToEll(pol,v0=None,q0=None):
# if v^2=a*u^4+b*u^3+c*u^2+d*u+q^2 (i.e. with rat point (0,q))
# this function gives Weierstrass equation and maps
# result is in the format [ell,[x,y],[u,v]] where ell
# is the Weierstrass elliptic curve
# [x,y] are given in terms of u,v and [u,v] given in terms
# of x,y
qq,d,c,b,a=pol.coefficients(sparse=False) #pol.coeffs()
#if v0 != None:
# q=v0
#else:
try:
if not qq.is_square():
print ('non square')
return []
#q=ZZ(qq).isqrt()
except: pass
pr2=PolynomialRing(pol.base_ring(),'z1')
z1=pr2.gen()
if q0 is None:
polr=z1**2-qq
rots=polr.roots(multiplicities=False)
q=rots[0]
else: q=q0
a1=d/q
a2=c-d**2/(4*q**2)
a3=2*q*b
a4=-4*q**2*a;
a6=a2*a4
eli=[a1,a2,a3,a4,a6]
ell=EllipticCurve(pol.parent().base_ring(),eli)
prxy=PolynomialRing(pol.parent().base_ring(),'x,y')
x,y=prxy.gens()
pruv=PolynomialRing(pol.parent().base_ring(),'u,v')
u,v=pruv.gens()
P1=[(2*q*(v+q)+d*u)/u**2,(4*q**2*(v+q)+2*q*(d*u+c*u**2)-d**2*u**2/(2*q))/u**3]
f=(2*q*(x+c)-d**2/(2*q))/y
g=-q+f*(f*x-d)/(2*q)
P2=[f,g]
point1= [-a2,a1*a2-a3]
return [ell,P1,P2,point1]