We propose a set of protocols for verifying quantum computing at any time after the computation itself has been performed. We provide two constructions: one requires five entangled provers and a completely classical verifier; the other requires a single prover, a verifier, who is restricted to measuring qubits in the X or Z basis, and one-way quantum communication from the prover to the verifier. These results demonstrate that the verification can be achieved independently from the blindness. We also show that a constant round protocol with a single prover and a completely classical verifier is not possible, unless bounded error quantum polynomial time (BQP) is contained in the third level of the polynomial hierarchy.

It is desirable to observe synchronization of quantum systems in the quantum regime, defined by the low number of excitations and a highly nonclassical steady state of the self-sustained oscillator. Several existing proposals of observing synchronization in the quantum regime suffer from the fact that the noise statistics overwhelm synchronization in this regime. Here, we resolve this issue by driving a self-sustained oscillator with a squeezing Hamiltonian instead of a harmonic drive and analyze this system in the classical and quantum regime. We demonstrate that strong entrainment is possible for small values of squeezing, and in this regime, the states are nonclassical. Furthermore, we show that the quality of synchronization measured by the FWHM of the power spectrum is enhanced with squeezing.