Iterative solutions to the steady-state density matrix for optomechanical systems

P. D. Nation, J. R. Johansson, M. P. Blencowe, and A. J. Rimberg
Phys. Rev. E 91, 013307 – Published 23 January 2015

Abstract

We present a sparse matrix permutation from graph theory that gives stable incomplete lower-upper preconditioners necessary for iterative solutions to the steady-state density matrix for quantum optomechanical systems. This reordering is efficient, adding little overhead to the computation, and results in a marked reduction in both memory and runtime requirements compared to other solution methods, with performance gains increasing with system size. Either of these benchmarks can be tuned via the preconditioner accuracy and solution tolerance. This reordering optimizes the condition number of the approximate inverse and is the only method found to be stable at large Hilbert space dimensions. This allows for steady-state solutions to otherwise intractable quantum optomechanical systems.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 16 November 2014

DOI:https://doi.org/10.1103/PhysRevE.91.013307

©2015 American Physical Society

Authors & Affiliations

P. D. Nation1,*, J. R. Johansson2, M. P. Blencowe3, and A. J. Rimberg3

  • 1Department of Physics, Korea University, Seoul 136-713, Korea
  • 2iTHES Research Group, RIKEN, Saitama 351-0198, Japan
  • 3Department of Physics and Astronomy, Dartmouth College, New Hampshire 03755, USA

  • *pnation@korea.ac.kr

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 91, Iss. 1 — January 2015

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×