Before revision:  We show that there is a bounded-error quantum algorithm that determines all connected components of G after making O(\log(n) ^5 ) many cut queries.
After revision:  We show that there is a bounded-error quantum algorithm that determines all connected components of G after making O(\log(n) ^6 ) many cut queries.