2026-09-23T14:30:54Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/82802022-01-13T07:54:41Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022
Uwe-Jens Wiese.
Scarlet, Benjamin S., 1974-
Massachusetts Institute of Technology. Dept. of Physics.
Massachusetts Institute of Technology. Department of Physics
2005-08-23T18:51:07Z
2005-08-23T18:51:07Z
2000
2001
http://hdl.handle.net/1721.1/8280
50419967
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Physics, February 2001.
Includes bibliographical references (p. 97-102) and index.
Numerical simulation of quantum systems develop sign problems upon the introduction of a chemical potential. The sign problem thus makes many interesting physical systems very difficult to study numerically. In this thesis, two related systems which develop sign problems in this way are considered: a D-Theory representation of a 1+1 dimensional 0(3) quantum field theory with a chemical potential, and antiferromagnetic Heisenberg quantum spin ladders in a magnetic field. In both cases, meron cluster algorithms are used to completely solve the sign problem. Using these algorithms, numerical results were generated in the two models for, respectively, the particle number as a function of the chemical potential and magnetization as a function of the external field. These results are in agreement with corresponding analytic predictions.
by Benjamin S. Scarlet.
Ph.D.
103 p.
7552639 bytes
7552395 bytes
application/pdf
application/pdf
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Physics.
Solving sign problems with meron cluster algorithms : simulating field theories at non-zero chemical potential
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="53fc6f06-3322-4368-a19d-9bb748c3aa01">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Solving sign problems with meron cluster algorithms : simulating field theories at non-zero chemical potential</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2001</PublicationDate>
<Authors>
<Author>
<DisplayName>Scarlet, Benjamin S., 1974-</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Physics.</Keyword>
<Abstract>Numerical simulation of quantum systems develop sign problems upon the introduction of a chemical potential. The sign problem thus makes many interesting physical systems very difficult to study numerically. In this thesis, two related systems which develop sign problems in this way are considered: a D-Theory representation of a 1+1 dimensional 0(3) quantum field theory with a chemical potential, and antiferromagnetic Heisenberg quantum spin ladders in a magnetic field. In both cases, meron cluster algorithms are used to completely solve the sign problem. Using these algorithms, numerical results were generated in the two models for, respectively, the particle number as a function of the chemical potential and magnetization as a function of the external field. These results are in agreement with corresponding analytic predictions.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>