abstract: Quantum SAT is a natural generalization of k-Satisfiability and has been proven to be QMA-complete, hence among the most difficult problems for a quantum computer. We introduce a natural measure for defining a random ensemble and find a SAT and UNSAT phases separated by a phase transition. The nature and the precise location of the transition are under current investigation.