Demonstration of Two-Qubit Algorithms with a Superconducting Quantum Processor
L. DiCarlo, J. M. Chow, J. M. Gambetta, Lev S. Bishop, B. R. Johnson, D. I. Schuster, J. Majer, A. Blais, L. Frunzio, S. M. Girvin, R. J. Schoelkopf
I Methods
I.2 cQED Theory
The Tavis-Cummings 31 Hamiltonian generalized to multi-level transmon qubits 30 is
Acknowledgements We thank V. Manucharyan and E. Boaknin for experimental contributions, and M. H. Devoret, I. L. Chuang and A. Nunnenkamp for discussions. This work was supported by LPS/NSA under ARO Contract No. W911NF-05-1-0365, and by the NSF under Grants No. DMR-0653377 and No. DMR-0603369. We acknowledge additional support from CIFAR, MRI, MITACS, and NSERC (JMG), NSERC, CIFAR, and the Alfred P. Sloan Foundation (AB), and from CNR-Istituto di Cibernetica, Pozzuoli, Italy (LF).