Search for: All records

Recent experiments of chemical reactions in optical cavities have shown great promise to alter and steer chemical reactions, but still remain poorly understood theoretically. In particular, the origin of resonant effects between the cavity and certain vibrational modes in the collective limit is still subject to active research. In this paper, we study the unimolecular dissociation reactions of many molecules, collectively interacting with an infrared cavity mode, through their vibrational dipole moment. We find that the reaction rate can slow down by increasing the number of aligned molecules, if the cavity mode is resonant with a vibrational mode of the molecules. We also discover a simple scaling relation that scales with the collective Rabi splitting, to estimate the onset of reaction rate modification by collective vibrational strong coupling and numerically demonstrate these effects for up to 10 4 molecules. 

Abstract Variational quantum algorithms have the potential for significant impact on high-dimensional optimization, with applications in classical combinatorics, quantum chemistry, and condensed matter. Nevertheless, the optimization landscape of these algorithms is generally nonconvex, leading the algorithms to converge to local, rather than global, minima and the production of suboptimal solutions. In this work, we introduce a variational quantum algorithm that couples classical Markov chain Monte Carlo techniques with variational quantum algorithms, allowing the former to provably converge to global minima and thus assure solution quality. Due to the generality of our approach, it is suitable for a myriad of quantum minimization problems, including optimization and quantum state preparation. Specifically, we devise a Metropolis–Hastings method that is suitable for variational quantum devices and use it, in conjunction with quantum optimization, to construct quantum ensembles that converge to Gibbs states. These performance guarantees are derived from the ergodicity of our algorithm’s state space and enable us to place analytic bounds on its time-complexity. We demonstrate both the effectiveness of our technique and the validity of our analysis through quantum circuit simulations for MaxCut instances, solving these problems deterministically and with perfect accuracy, as well as large-scale quantum Ising and transverse field spin models of up to 50 qubits. Our technique stands to broadly enrich the field of variational quantum algorithms, improving and guaranteeing the performance of these promising, yet often heuristic, methods.