Given a binary quadratic program, what is the name for the relaxation where the binary constraints are relaxed to $[0,1]$ box constraints?
For LPs this is normally called LP-Relaxation. However, since the problem is a BQP, is there an appropriate name for it?
It is called the QP relaxation or quadratic relaxation. More generally, relaxing integrality yields the continuous relaxation.