Abstract

Simple Quantum Integro-Differential Solver (SQuIDS) is a C++ code designed to solve semi-analytically the evolution of a set of density matrices and scalar functions. This is done efficiently by expressing all operators in an SU(N) basis. SQuIDS provides a base class from which users can derive new classes to include new non-trivial terms from the right hand sides of density matrix equations. The code was designed in the context of solving neutrino oscillation problems, but can be applied to any problem that involves solving the quantum evolution of a collection of particles with Hilbert space of dimension up to six. New version program summaryProgram Title: SQuIDSCPC Library link to program files:http://dx.doi.org/10.17632/hnchbtnybs.1Developer’s respository link:https://github.com/jsalvado/SQuIDSLicensing provisions: GNU Lesser General Public License, version 3.Programming language: C++11.External routines: GNU Scientific Library (http://www.gnu.org/software/gsl/).Journal reference of previous version: Comput. Phys. Commun. 196 (2015) 569–591Does the new version supersede the previous version?: Yes.Nature of problem: Solve the evolution of open quantum systems of Hilbert space dimension N with self interactions and interaction with classical fields.Solution method: The algebra is implemented as a C++ object and is embedded into the GSL ordinary differential equation solver.Reasons for the new version: Added new features and improved runtime.Summary of revisions:•Library names have been moved into the ‘squids’ namespace.•Support for extraction of SU vectors and basis transformations to GSL matrices.•Implementation of matrix exponentiation for use cases like evolution with non-diagonalized Hamiltonians.•Implementation of a number of useful matrix operations on SU vectors, including applying arbitrary unitary transformations, extracting real and imaginary components, transposition, and generalized, weighted rotations.•Support for obtaining the eigensystem which diagonalizes an SU_vector.•Explicit disallowance of creating or manipulating SU(1) vectors, which are degenerate with scalars.•A fix to a severe issue in the use of the GSL ODE interface, now giving good output for much less stringent tolerance values.•Optimization of element-wise operations on SU vectors without the need to allocate temporary storage.•Redesign of SU vector operations for vectorizability, including optimized allocation of element storage with optimal alignment.•Implementation of a more efficient version of SU vector time evolution which can share initialization costs across multiple evolutions by the same operator over the same time interval.•A more precise definition of the meter.•Improvements to configuration and build system.•Clean up of capitalization for file and class names.•Rearrangement of project files to a more standard layout.•Elimination of memory leaks.•Limited support for the Intel and Portland Group compilers. These should not be considered guaranteed to work, but have been given minimal testing and appear compile the library correctly.•Added additional unit conversions to SQuIDS constants.Additional comments including restrictions and unusual features: The code is only implemented up to Hilbert spaces of dimension six, but a Mathematica notebook is provided in order to generate higher dimensional solutions. Furthermore, only ordinary differential equation solution methods that require only the first derivative can be used. Acknoledgements CAA is supported by NSF grant PHY-1912764. JS acknowledges financial support from EU Networks FP10ITN ELUSIVES (H2020-MSCA-ITN-2015-674896) and INVISIBLES-PLUS (H2020-MSCA-RISE2015-690575), by the MINECO grant FPA2016-76005-C2-1-P and by the Maria de Maeztu grant MDM-2014-0367 of ICCUB.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.