This repository has been archived by the owner on Apr 16, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 12
/
news.html
513 lines (474 loc) · 23.2 KB
/
news.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html xmlns="https://www.w3.org/1999/xhtml">
<head>
<title>ITensor - Intelligent Tensor Library</title>
<meta http-equiv="content-language" content="en" />
<meta http-equiv="content-type" content="text/html; charset=UTF-8" />
<link rel="icon" href="favicon.ico"/>
<link rel="stylesheet" href="style.css" type="text/css"/>
<!--<script type="text/javascript" src="scripts/jquery-1.6.2.min.js"></script>-->
<script src="https://ajax.googleapis.com/ajax/libs/jquery/1.6/jquery.min.js" type="text/javascript"></script>
<script type="text/javascript">$(document).ready(function(){});</script>
<script type="text/javascript" src="scripts/jquery.corner.js"></script>
<style type="text/css">
</style>
</head>
<body>
<div id="main">
<div id="navbar" class="rounded">
<ul>
<li><a href="index.html">Home</a> </li>
<li><a class="thispage" href="news.html">News</a> </li>
<li><a href="docs.cgi">Learn</a> </li>
<li><a href="docs.cgi?page=codes">Codes</a> </li>
<li><a href="support/">Discuss</a> </li>
<li><a href="about.html">About ITensor</a></li>
</ul>
</div>
<div id="banner">
<img src="ITensor.png" /></br>
</div>
<div class="full section rounded"> <h2>Latest News</h2> </div>
<a name="ITensorPaper"></a><br/>
<div class="full newsitem">
<h3>The ITensor Paper</h3>
<h2>(Aug 2020) </h2>
<p>
Following closely on the heels of the release of ITensor in the Julia language,
we have recently written a paper about ITensor, its philosophy, design, and distinctive
features. The paper is titled "The ITensor Software Library for Tensor Network Calculations" and
has been submitted for review at a new
journal <a href="https://scipost.org/SciPostPhysCodeb/about" target="_blank">SciPost Physics Codebases</a>. You can view the preprint at this link:
<a href="https://arxiv.org/abs/2007.14822" target="_blank">https://arxiv.org/abs/2007.14822</a>.
</p>
<p>
Citing this paper is now the preferred way to cite ITensor if you use it to produce
data or other results for a publication.
You may use the following BibTex entry to cite in LaTeX documents:
<div class="full screenshot">
<pre>
@misc{itensor,
title={The \mbox{ITensor} Software Library for Tensor Network Calculations},
author={Matthew Fishman and Steven R. White and E. Miles Stoudenmire},
year={2020},
eprint={2007.14822},
archivePrefix={arXiv}
}
</pre>
</div>
</p>
</div> <!--end newsitem-->
<a name="Julia"></a><br/>
<div class="full newsitem">
<h3>Julia Version of ITensor Released</h3>
<h2>(May 2020) </h2>
<p>
The Julia-language version of ITensor has just been officially released!
</p>
<img src="julia-logo-color.png" style="padding: 0px; float:right; margin:10px;" width="150px" />
<p>
This latest version of ITensor—the Julia library <a href="https://github.com/ITensor/ITensors.jl" target="_blank">ITensors.jl</a>—is a
port of the ITensor Library into the <a href="https://julialang.org" target="_blank">Julia programming language</a>. (Not a wrapper around the
C++ version!) Julia is a unique language which offers the productivity of languages such
as python, but the speed of languages such as Fortran or C++. It also has a built-in package
management system, composable multi-threading support, excellent GPU libraries, and many
more compelling features.
</p>
<p>
This new version of ITensor, on the other hand, offers continuity with the C++ interface
and feature set which has allowed our users to <a href="https://itensor.org/papers">productively</a> create state-of-the-art tensor network calculations. Thanks to those of our users who helped us by adding useful features or making comments which helped us to get the port and release done in just a year's time.
</p>
<p>
For more information about the Julia version of ITensor, check out the following resources:
<ul>
<li>In-depth <a href="https://itensor.github.io/ITensors.jl/stable/">documentation pages</a></li>
<li>The Julia section of the itensor.org <a href="docs.cgi?vers=julia">Learn Pages</a></li>
<li>Github repo for <a href="https://github.com/ITensor/ITensors.jl">ITensors.jl</a></li>
</ul>
</p>
</div> <!--end newsitem-->
<a name="v3.1"></a><br/>
<div class="full newsitem">
<h3>ITensor Version 3.1 Released</h3>
<h2>(Nov 2019) </h2>
<p>
Version 3.1.0 of ITensor has just been released!
</p>
<p>
The major improvement included in this new version is
that operations involving block sparse (quantum number
conserving) ITensors are now much faster, especially
when the block sizes are small relative to the overall
dimensions of the ITensor. Other optimizations
include skipping over costly zero-initializations of
tensors that will be immediately overwritten.
</p>
<p>
This update also includes many bug fixes, as well as
smaller features. For the entire list of changes
see the <a href="docs.cgi?page=changelog#v3.1.0">changelog</a>.
</p>
</div> <!--end newsitem-->
<a name="v3.0"></a><br/>
<div class="full newsitem">
<h3>ITensor Version 3.0 Released</h3>
<h2>(May 2019) </h2>
<p>
Version 3.0.0 of ITensor has just been released!
</p>
<p>
This new major release of ITensor
makes a number of significant changes, such as streamlining block-sparse and dense
tensors (IQTensor and ITensor) into a single type (ITensor);
a new system for tagging indices with short strings;
and including names with quantum numbers to allow quantum numbers defined "locally"
to be sensibly mixed together within one global calculation.
</p>
<table style="float:right;">
<tr><td><img width="100px" src="people/MatthewFishman.jpg"/></td></tr>
<tr><td class="caption"><center>Matt Fishman</center></td></tr>
</table>
<p>
This release has been spearheaded by the new co-lead-developer of ITensor, Matt
Fishman, who also holds the position of Associate Data Scientist at the Flatiron
Institute Center for Computational Quantum Physics. Thanks to the support of the
Simons Foundation in hiring Matt, ITensor is now improving at a significantly faster pace.
</p>
<p>
Version 3 of ITensor includes many other significant changes, such as switching to
the C++17 standard, which brings in many productivity enhancing features like
multiple return values. Also various interfaces and algorithms
throughout ITensor have been made more consistent and many functions which were
previously templates have been simplified to become plain functions.
</p>
<p>
For help converting from version 2 to version 3, see the <a href="docs.cgi?page=upgrade2to3&vers=cppv3">upgrade guide</a>.
</p>
<p>
For even more details, see the <a href="docs.cgi?page=changelog#v3.0.0">changelog</a>.
</p>
</div> <!--end newsitem-->
<a name="v2.1"></a><br/>
<div class="full newsitem">
<h3>Version 2.1 Released</h3>
<h2>(Jun 1, 2017) </h2>
<p>
Version 2.1.0 of ITensor is out! This version includes some powerful new
features, as well as a raft of small improvements and bug fixes.
</p>
<p>
One notable improvement is that an AutoMPO can now include terms with operators
acting on more than two sites. And the default AutoMPO backend uses a compression
algorithm to ensure that the resulting MPO dimension is as small as possible without
losing accuracy. Combined with the ability of AutoMPO to handle arbitrary range
interactions, such as for making MPOs for quasi-2D systems, ITensor is now more
useful than ever for setting up advanced DMRG and MPS calculations.
</p>
<p>
Another useful change is that the SiteSet system has been overhauled internally.
This make it much easier to define custom Hilbert spaces, possibly with different
types of degrees of freedom on different sites.
</p>
<p>
Some other important internal changes include switching to 64 bit Index ID numbers
to avoid collisions in heavy-duty calculations, and improved internal handling of
scalar tensors.
</p>
<p>
For even more details, see the <a href="docs.cgi?page=changelog#v2.1.0">changelog</a>.
</p>
</div> <!--end newsitem-->
<a name="autompo"></a><br/>
<div class="full newsitem">
<h3>AutoMPO Official Release</h3>
<h2>(May 30, 2017) </h2>
<p>
With the upcoming release of ITensor
<a href="docs.cgi?page=changelog">version 2.1</a>, the AutoMPO feature is
officially out of the beta testing phase. AutoMPO is a very
powerful feature that lets you construct MPOs (and IQMPOs)
from human-readable input, similar to pencil-and-paper
notation. AutoMPO can even be used to produce an MPO
approximating the <i>exponential</i> of a sum of operators!
</p>
<table style="float:right;">
<tr><td><img width="100px" src="AK_photo.jpg"/></td></tr>
<tr><td class="caption">Anna Keselman</td></tr>
</table>
<p>
We would especially like to thank
<a href="https://scholar.google.com/citations?user=CwAaF74AAAAJ&hl=en">Anna Keselman</a>
for her work on AutoMPO. While a graduate student at the Weizmann Institute,
she expanded AutoMPO to include a new backend that
can handle operators acting on any number of sites and which
optimizes the size of the resulting MPO using a series of SVDs.
Anna will be pursuing the next phase of her career as a joint
Station Q and KITP postdoc in Santa Barbara.
</p>
<p>
For more information on AutoMPO and some examples see the
<a href="docs.cgi?page=classes/autompo">documentation page</a>.
</p>
<p>
For an example of how to use the toExpH function to exponentiate
an AutoMPO, see the above documentation page or the following
<a href="docs.cgi?page=formulas/tevol_mps_mpo">code formula</a>.
</p>
</div>
<a name="newsletter"></a><br/>
<div class="full newsitem">
<h3>ITensor Newsletter</h3>
<h 2>(May 23, 2017) </h2>
<p>
The ITensor website now has a page where you can sign up for the ITensor Newsletter. This
newsletter will be sent by email only very occasionally, only a handful of times
a year, and will announce major new ITensor features or additional resources.
Visit the <a href="email.html">sign-up page</a> to join the list.
</p>
</div>
<a name="codes"></a><br/><br/>
<div class="full newsitem">
<h3>New ITensor Codes Page</h3>
<h2>(May 19, 2017) </h2>
<p>
The ITensor website has a new page featuring
<a href="http://itensor.org/codes.html">ITensor codes</a>.
We plan to feature high-quality, open-source codes based on ITensor, including advanced
physics algorithms and packages for extending ITensor itself.
The initial batch of codes includes finite temperature DMRG; real-space parallel DMRG; and tensor
network machine learning.
</p>
<p>
If you have a code you have created using ITensor, or if you are making a code that
extends ITensor but is still in "beta" form, please post your code on Github or Bitbucket
and contact <a href="about.html">Miles Stoudenmire</a> to have your code listed on our site.
Codes that are of high enough quality and of general use will be considered for eventual
inclusion in a future release of ITensor.
</p>
</div>
<a cname="simons_summer_2016"></a>
<div class="full newsitem">
<h3>ITensor at the Simons Many-Electron Summer School 2016</h3>
<h2>(Jun 18, 2016) </h2>
<p>
The Simons <a href="" target="_blank">Collaboration on the Many-Electron Problem</a>
is holding its third-annual summer school this June at Stony Brook University.
This year the school involves a weekend workshop beforehand on developing quality
codeo for physics research. The main topic of the school will be tensor network methods.
ITensor will be featured in both parts of the school, alongside two other collaboration
projects: <a href="http://alpscore.org/" target="_blank">ALPSCore</a> and <a href="https://triqs.ipht.cnrs.fr" target="_blank">TRIQS</a>.
</p>
</div>
<a name="fermion_string"></a>
<div class="full newsitem">
<a href="docs.cgi?page=tutorials/fermions"><h3>Tutorial on Fermions and Jordan-Wigner Transformations</h3></a>
<h2>(Apr 20, 2016) </h2>
<p>
One difficulty with ITensor (which we hope to remedy in future versions) is that to work
with fermionic operators acting on different sites, you must map them to bosonic
operators using the Jordan-Wigner transformation.
</p>
<p>
Because this transformation can be tricky to get right, we have added a
<a href="docs.cgi?page=tutorials/fermions">detailed tutorial</a>, which
even includes the case of fermions with spin. Please email Miles if
you would like to see extra examples in this tutorial or additional
steps in greater detail.
</p>
</div>
<a name="discuss"></a>
<div class="full newsitem">
<h3>New Discussion Forum</h3>
<h2>(Mar 25, 2016) </h2>
<p>
Along with the new release of ITensor, we have added a <a href="support/">discussion forum</a> to the website.
This forum works similarly to Stack Exchange, where you can vote on questions and answers.
Please create an account and post a question.
</p>
<p>
When writing a post, you can indent code text by 4 spaces to have it be automatically formatted (different font and highlighting).
You can also delimit latex by @@...latex...@@ for inline latex or by <br/>
$$<br/>
...latex...<br/>
$$ <br/>
for latex on its own separate line.
</p>
</div>
<a name="version2"></a>
<div class="full newsitem">
<h3>ITensor Version 2.0 Released</h3>
<h2>(Mar 25, 2016) </h2>
<p>
The latest release of ITensor comes with a major overhaul of ITensor and IQTensor internals.
Tensor storage is now handled by a set of independent storage types, which can have completely
arbitrary layouts and behaviors. This paves the way for future support for even more sparse
tensor types, in addition to the currently support ones such as diagonal tensors. For example,
"combiners" are no longer a separate type, but are now just a special case of an ITensor
or IQTensor with "combiner storage".
</p>
<p>
The new version also includes a new low-level linear algebra library as a foundation for ITensor.
This library revolves around a simple tensor type with indices having a fixed order.
Matrices and vectors are treated as special cases of tensors.
</p>
<p>
For more details on the update, see the <a href="http://itensor.org/docs.cgi?page=changelog#v2.0.0">changelog</a>.
</p>
<p>
For help upgrading your code to the new version, see the <a href="http://itensor.org/docs.cgi?page=v2transition_guide">transition guide</a>.
</p>
<p>
For a deeper discussion of the new ITensor internals, read about the <a href="http://itensor.org/docs.cgi?page=articles/storage">new storage system</a>.
</p>
</div>
<a name="sherbrooke2016"></a>
<div class="full newsitem">
<h3>ITensor at 2016 Sherbrooke Summer School</h3>
<h2>(Jan 11, 2016) </h2>
<p>
The <a href="http://pitp.physics.ubc.ca/confs/sherbrooke2016/index.html" target="_blank">International Summer School on Computational Quantum Materials</a> will again be featuring lectures on using ITensor
to implement matrix product state (e.g. DMRG) methods. Following lectures by U. Schollwoeck on MPS and DMRG,
Miles Stoudenmire will present two lectures, 1.5 hours each, with
hands-on demos of ITensor. Please register or notify your students about this opportunity to discuss details
of ITensor with Miles in person and to attend a great summer school with many distinguished speakers.
Deadline for registration is Feb 1, 2016.
</p>
</div>
<a name="version1.1"></a>
<div class="full newsitem">
<h3>ITensor Version 1.1—C++11 and more</h3>
<h2>(May 16, 2015) </h2>
<p>
Spring brings another new release of ITensor (<a href="https://github.com/ITensor/ITensor" target="_blank">Github link</a>).
Version 1.1.0 is the first to require C++11 compiler support, which allows us to make the library nicer to use and more
memory safe. The internals have been reworked for better efficiency and stability.
</p>
<p>
This release also brings a major new feature: AutoMPO. The AutoMPO class makes it simple to create MPOs for many common Hamiltonians, including
on two-dimensional lattices (see the front page for an example of usage). AutoMPO is also quite useful for creating
other MPOs which are sums of local operators. For more details about this release, see the <a href="docs.cgi?page=changelog#v1.1.0">changelog</a>.
</p>
</div>
<a name="version1.0"></a>
<div class="full newsitem">
<h3>ITensor Gets a Spring Clean</h3>
<h2>(May 27, 2014) </h2>
<p>
ITensor version 1.0 has just been released (<a href="https://github.com/ITensor/ITensor" target="_blank">Github link</a>) with
many improvements, such as automatic sparsity for ITensors and IQTensors; no more boost dependence when compiling with C++11;
a more consistent interface for MPS methods; a new infinite DMRG code; new facilities for printing; and much more. For more details, take a look at the
<a href="docs.cgi?page=changelog#v1.0.0">changelog</a>.
</p>
</div>
<a name="periodic"></a>
<div class="full newsitem">
<h3>Should you use periodic boundary conditions with DMRG?</h3>
<h2>(Apr. 28, 2014) </h2>
<p>
Are periodic boundary conditions the best way to eliminate edge effects? Aren't correlation function measurements the "standard" and best
approach to detecting symmetry breaking? The answer may surprise you. Fully periodic boundary conditions impose a steep cost within DMRG,
and one can make the case that they are needed only in rare circumstances.
Open boundaries can even be a superior choice for other numerical methods such as quantum Monte Carlo.
For more, see the <a href="http://itensor.org/docs.cgi?page=periodic">full article</a>.
</p>
</div>
<a name="sherbrooke"></a>
<div class="full newsitem">
<h3>Hands-On With ITensor at Sherbrooke Summer School</h3>
<h2>(Dec. 17, 2013) </h2>
<p>
The ITensor Library will be featured as part of the Sherbrooke <a href="http://pitp.physics.ubc.ca/confs/sherbrooke2014/index.html" target="_blank">International Summer School on Computational Methods for Quantum Materials</a> taking place May 26 to June 6, 2014. Following Uli Schollwöck's tutorials on modern DMRG theory and practice, Miles Stoudenmire will give two talks on the practical implementation of DMRG and matrix product states using ITensor. This will include hands-on tutorials on getting started with ITensor and applying ITensor to real research problems.
</p>
</div>
<a name="parallelizing"></a>
<div class="full newsitem">
<h3>Parallelizing DMRG Across Real Space</h3>
<h2> (Apr. 22, 2013) </h2>
<img src="timing.png" style="padding: 0px; border: 1px solid gray; background: white; float:right; margin:10px;" width="350px" />
<p>
Although DMRG is a one-dimensional method, its power and efficiency have made it surprisingly effective for studying two-dimensional
lattice models. Recent DMRG results for the <a href="http://www.sciencemag.org/content/332/6034/1173.abstract" target="_blank">kagome lattice antiferromagnet</a> have reinvigorated the
search for realistic quantum spin liquids. DMRG was also the workhorse behind new sophisticated <a href="http://link.aps.org/doi/10.1103/PhysRevLett.110.067208" target="_blank">measurements</a> of <a href="http://dx.doi.org/10.1038/nphys2465" target="_blank">topological order</a>.
But two-dimensional DMRG calculations are computationally very demanding.
</p>
<p>
DMRG's success in 1d and 2d can be attributed to its ideal characteristics including robust convergence and exponential scaling of accuracy with
computational cost.
Yet one feature it lacked was parallelism, where a single DMRG calculation could be split across multiple computers.
</p>
<p>
Now this problem has been solved using insights based on matrix product states. Performing a
matrix product state gauge transformation at the real-space boundary between two blocks provides an orthonormal
basis for independent DMRG calculations within each block, then a way to merge the results afterward.
Repeating this procedure across N blocks enables a single DMRG calculation to run almost N times
faster. (See figure above.) Using the ITensor Library made it possible to rapidly develop and test the algorithm;
all of the demanding benchmark calculations used ITensor as well.
</p>
<p>
Read the full paper <a href="http://link.aps.org/doi/10.1103/PhysRevB.87.155137">here</a>.
</p>
<p>
Note: although the method was developed explicitly using tensors and matrix product states,
it should be straightforward to implement in conventional DMRG codes and only requires modifying the DMRG algorithm at block boundaries.
</p>
</div>
<a name="dft"></a>
<div class="full newsitem">
<h3>Studying Density Functional Theory in a 1D Laboratory</h3>
<h2> (Aug. 22, 2012) </h2>
<!--<img src="dft_plot.png" width="450px" style="float:right;"/>-->
<img src="dft_plot.png" style="padding: 0px; border: 1px solid gray; background: white; float:right; margin:10px;" width="450px" />
<p>
At the heart of the enormously successful density functional theory (DFT) method lies a functional that gives the ground state energy of any system provided only its density. Can this exact energy functional be written down? What are its key properties?
</p>
<p>
Except for a handful of small systems, computing the exact functional in three dimensions is too difficult to permit a systematic study of its properties.
However, a recent <a href="http://link.aps.org/doi/10.1103/PhysRevLett.109.056402">paper</a> in <em>Physical Review Letters</em>
shows that in one dimension—thanks to the power of density matrix renormalization group (DMRG) calculations
and the flexibility of the ITensor Library—one can calculate the exact densities of a wide variety of continuum, long-range interacting systems
consisting of long chains of artificial atoms.
</p>
<p>
From these exact densities, it is relatively straightforward to calculate the exact density functional and a host of other quantities of interest in DFT.
In the future, this 1d laboratory should be useful for studying popular density-functional approximations and exploring improved functionals which could be applied to strongly correlated systems in 3d.
</p>
<p>
Read the paper <a href="http://link.aps.org/doi/10.1103/PhysRevLett.109.056402">here</a>.
</p>
</div>
<div class="full newsitem">
<h3>Majorana Fermions Thrive in the Hostile World of Electrons </h3>
<h2> (Sept. 19, 2011) </h2>
<img src="majorana.png">
<p>
Recently, there has been a surge in proposals to observe exotic
fractional particles known as Majorana fermions using rather
conventional condensed matter systems. Producing and controlling
these particles would be a key step toward building a robust quantum
computer. In one of the simplest setups, Majorana fermions could be
produced by applying a magnetic field to certain superconducting nanowires.
But our present theoretical understanding leaves out many of the
complications expected in a realistic nanowire experiment.
</p>
<p>
In a recent <a href="http://prb.aps.org/abstract/PRB/v84/i1/e014503">paper</a>
produced using extensive ITensor Library simulations, we take the important step
of reintroducing the fact that electrons repel one another. The key issue
is the extent to which the Majorana fermions survive these more realistic
conditions. Although we find that electron interactions make them more fragile
to thermal fluctuations, interactions ultimately result in a net gain since
they make the Majoranas more robust to electron density fluctuations and allow
them to appear at weaker magnetic fields - the latter two issues being
more pressing experimentally. In fact, we go so far as to show that a
magnetic field may not be necessary at all given the right combination of
materials properties and strong interactions.
</p>
<p>
See the <em>Physics</em> <a href="http://physics.aps.org/synopsis-for/10.1103/PhysRevB.84.014503">synopsis</a>.
</p>
</div>
<div id="footer"></div>
</div> <!--class="main"-->
<script type="text/javascript">$(function() {$('.rounded').corner("7px");});</script>
</body>
</html>