mirror of https://github.com/intel/intel-qs.git
116 lines
36 KiB
HTML
116 lines
36 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.11"/>
|
|
<title>Intel qHiPSTER: qureg/qureg_applydiag.cpp Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<script type="text/javascript">
|
|
$(document).ready(function() { init_search(); });
|
|
</script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">Intel qHiPSTER
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.11 -->
|
|
<script type="text/javascript">
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
</script>
|
|
<div id="navrow1" class="tabs">
|
|
<ul class="tablist">
|
|
<li><a href="index.html"><span>Main Page</span></a></li>
|
|
<li><a href="pages.html"><span>Related Pages</span></a></li>
|
|
<li><a href="modules.html"><span>Modules</span></a></li>
|
|
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
|
|
<li><a href="annotated.html"><span>Data Structures</span></a></li>
|
|
<li class="current"><a href="files.html"><span>Files</span></a></li>
|
|
<li>
|
|
<div id="MSearchBox" class="MSearchBoxInactive">
|
|
<span class="left">
|
|
<img id="MSearchSelect" src="search/mag_sel.png"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
alt=""/>
|
|
<input type="text" id="MSearchField" value="Search" accesskey="S"
|
|
onfocus="searchBox.OnSearchFieldFocus(true)"
|
|
onblur="searchBox.OnSearchFieldFocus(false)"
|
|
onkeyup="searchBox.OnSearchFieldChange(event)"/>
|
|
</span><span class="right">
|
|
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
|
|
</span>
|
|
</div>
|
|
</li>
|
|
</ul>
|
|
</div>
|
|
<div id="navrow2" class="tabs2">
|
|
<ul class="tablist">
|
|
<li><a href="files.html"><span>File List</span></a></li>
|
|
<li><a href="globals.html"><span>Globals</span></a></li>
|
|
</ul>
|
|
</div>
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div id="nav-path" class="navpath">
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_4ab131b591b993d07872bcc398a0ac1c.html">qureg</a></li> </ul>
|
|
</div>
|
|
</div><!-- top -->
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">qureg_applydiag.cpp</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="qureg__applydiag_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">//------------------------------------------------------------------------------</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Copyright 2017 Intel Corporation</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">//</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// You may obtain a copy of the License at</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">//</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// See the License for the specific language governing permissions and</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// limitations under the License.</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">//------------------------------------------------------------------------------</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> </div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include "<a class="code" href="qureg_8hpp.html">qureg.hpp</a>"</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include "<a class="code" href="highperfkernels_8hpp.html">highperfkernels.hpp</a>"</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="keyword">template</span> <<span class="keyword">class</span> Type></div><div class="line"><a name="l00021"></a><span class="lineno"><a class="line" href="classQbitRegister.html#abbcd74dfdb4ffa563f1e80d297201a29"> 21</a></span> <span class="keywordtype">void</span> <a class="code" href="classQbitRegister.html#abbcd74dfdb4ffa563f1e80d297201a29">QbitRegister<Type>::applyDiagSimp</a>(<span class="keywordtype">unsigned</span> qubit1, <span class="keywordtype">unsigned</span> qubit2, <a class="code" href="classopenqu_1_1TinyMatrix.html">TM4x4<Type></a> <span class="keyword">const</span> &<a class="code" href="highperfkernels_8cpp.html#a55aace691be1a8a57eec700a41d42ade">m</a>)</div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> {</div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  <span class="keywordtype">int</span> myrank = <a class="code" href="classopenqu_1_1mpi_1_1Environment.html#a1c0c48f8af817320768ef3a1c9b98854">openqu::mpi::Environment::rank</a>();</div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  <span class="keywordtype">int</span> nprocs = <a class="code" href="classopenqu_1_1mpi_1_1Environment.html#acfe5d7c4784f10856304f07cb93dac08">openqu::mpi::Environment::size</a>();</div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  <a class="code" href="interface__api__memory_8cpp.html#a8a7796dc492015686a15b44dfa64e347">Type</a> d00 = m[0][0],</div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  d11 = m[1][1],</div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  d22 = m[2][2],</div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  d33 = m[3][3];</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> </div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> </div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  std::size_t src_glb_start = <a class="code" href="utils_8hpp.html#a2d1ace2be4b6d58d3260b1b5fd1d63e0">UL</a>(myrank) * localSize();</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="keywordflow">for</span> (std::size_t i = 0; i < localSize(); i++)</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  {</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="keywordflow">if</span>(check_bit(src_glb_start + i, qubit1) == 0 &&</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  check_bit(src_glb_start + i, qubit2) == 0 )</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  state[i] *= d00;</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span>(check_bit(src_glb_start + i, qubit1) == 0 &&</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  check_bit(src_glb_start + i, qubit2) == 1 )</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  state[i] *= d11;</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span>(check_bit(src_glb_start + i, qubit1) == 1 &&</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  check_bit(src_glb_start + i, qubit2) == 0 )</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  state[i] *= d22;</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keywordflow">else</span> </div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  state[i] *= d33;</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  }</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> }</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> </div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="keyword">template</span> <<span class="keyword">class</span> Type></div><div class="line"><a name="l00049"></a><span class="lineno"><a class="line" href="classQbitRegister.html#a70e1d4b9c959323a1b29a9462d066d17"> 49</a></span> <span class="keywordtype">void</span> <a class="code" href="classQbitRegister.html#a70e1d4b9c959323a1b29a9462d066d17">QbitRegister<Type>::applyDiag</a>(<span class="keywordtype">unsigned</span> qubit1_, <span class="keywordtype">unsigned</span> qubit2_, <a class="code" href="classopenqu_1_1TinyMatrix.html">TM4x4<Type></a> <span class="keyword">const</span> &<a class="code" href="highperfkernels_8cpp.html#a55aace691be1a8a57eec700a41d42ade">m</a>)</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> {</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="comment">// flush fusion buffers</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keywordflow">if</span> (fusion == <span class="keyword">true</span>) {</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  applyFusedGates();</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  }</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> </div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <a class="code" href="highperfkernels_8cpp.html#a3c5c1de356c65cc2bfca5046ecd71e6d">assert</a>(qubit1_ < nqbits);</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordtype">unsigned</span> qubit1 = (*permutation)[qubit1_];</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <a class="code" href="highperfkernels_8cpp.html#a3c5c1de356c65cc2bfca5046ecd71e6d">assert</a>(qubit1 < nqbits);</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <a class="code" href="highperfkernels_8cpp.html#a3c5c1de356c65cc2bfca5046ecd71e6d">assert</a>(qubit2_ < nqbits);</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordtype">unsigned</span> qubit2 = (*permutation)[qubit2_];</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <a class="code" href="highperfkernels_8cpp.html#a3c5c1de356c65cc2bfca5046ecd71e6d">assert</a>(qubit2 < nqbits);</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> </div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordtype">int</span> myrank = <a class="code" href="classopenqu_1_1mpi_1_1Environment.html#a1c0c48f8af817320768ef3a1c9b98854">openqu::mpi::Environment::rank</a>();</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordtype">int</span> nprocs = <a class="code" href="classopenqu_1_1mpi_1_1Environment.html#acfe5d7c4784f10856304f07cb93dac08">openqu::mpi::Environment::size</a>();</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordtype">unsigned</span> log2_nprocs = <a class="code" href="namespaceopenqu.html#a9cbfc48ff8a69fa8618c4eeaad4f2765">openqu::ilog2</a>(<a class="code" href="classopenqu_1_1mpi_1_1Environment.html#acfe5d7c4784f10856304f07cb93dac08">openqu::mpi::Environment::size</a>());</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  std::size_t M = nqbits - log2_nprocs;</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  std::size_t delta1 = 1 << qubit1;</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  std::size_t delta2 = 1 << qubit2;</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> </div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <a class="code" href="interface__api__memory_8cpp.html#a8a7796dc492015686a15b44dfa64e347">Type</a> d00 = m[0][0],</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  d11 = m[1][1],</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  d22 = m[2][2],</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  d33 = m[3][3];</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  std::size_t src_glb_start = <a class="code" href="utils_8hpp.html#a2d1ace2be4b6d58d3260b1b5fd1d63e0">UL</a>(myrank) * localSize();</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordtype">bool</span> controlled = (d00 == 1. && d11 == 1.);</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> </div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  </div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="preprocessor"> #if 0</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="comment">// currently disabled. controlled part is done inline inside controlled gate</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">if</span> (controlled == <span class="keyword">true</span>) {</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="comment">// controlled 2-qubit diagonal gate</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordflow">if</span> (qubit1 < M && qubit2 < M) {</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  printf(<span class="stringliteral">"here1\n"</span>);</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordtype">unsigned</span> delta1_ = std::min(delta1, delta2);</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordtype">unsigned</span> delta2_ = std::max(delta1, delta2);</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <a class="code" href="classopenqu_1_1TinyMatrix.html">TM2x2<Type></a> m2x2;</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  m2x2[0][0] = d22;</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  m2x2[0][1] = 0.;</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  m2x2[1][0] = 0.;</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  m2x2[1][1] = d33;</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  Loop_TN(state, </div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  0<a class="code" href="utils_8hpp.html#a2d1ace2be4b6d58d3260b1b5fd1d63e0">UL</a>, localSize(), 2<a class="code" href="utils_8hpp.html#a2d1ace2be4b6d58d3260b1b5fd1d63e0">UL</a> * delta2_,</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  0<a class="code" href="utils_8hpp.html#a2d1ace2be4b6d58d3260b1b5fd1d63e0">UL</a>, delta2_, 2<a class="code" href="utils_8hpp.html#a2d1ace2be4b6d58d3260b1b5fd1d63e0">UL</a> * delta1_,</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  delta1_, 2<a class="code" href="utils_8hpp.html#a2d1ace2be4b6d58d3260b1b5fd1d63e0">UL</a>*delta1_, delta2_,</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  m2x2, NULL);</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  </div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (qubit1 >= M && qubit2 < M) {</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  printf(<span class="stringliteral">"here2\n"</span>);</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">if</span> (check_bit(src_glb_start, qubit1) != 0) {</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordflow">for</span> (std::size_t j = 0; j < localSize(); j += 2 * delta2) {</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordflow">for</span> (std::size_t k = 0; k < delta2; ++k) {</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  state[j + k ] *= d22;</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  state[j + k + delta2 ] *= d33;</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  }</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  }</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  } </div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (qubit1 < M && qubit2 >= M) {</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <a class="code" href="interface__api__memory_8cpp.html#a8a7796dc492015686a15b44dfa64e347">Type</a> d0, d1;</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  printf(<span class="stringliteral">"here3\n"</span>);</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  d1 = (check_bit(src_glb_start, qubit2) == 0) ? d22 : d33;</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">for</span> (std::size_t j = 0; j < localSize(); j += 2 * delta1) {</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">for</span> (std::size_t k = 0; k < delta1; ++k) {</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  state[j + k + delta1 ] *= d1;</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  }</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  }</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (qubit1 >= M && qubit2 >= M) {</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  printf(<span class="stringliteral">"here4\n"</span>);</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">if</span> (check_bit(src_glb_start, qubit1) == 1 &&</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  check_bit(src_glb_start, qubit2) == 0 ) {</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">for</span> (std::size_t i = 0; i < localSize(); i++)</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  state[i] *= d22;</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (check_bit(src_glb_start, qubit1) == 1 &&</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  check_bit(src_glb_start, qubit2) == 1 ) {</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keywordflow">for</span> (std::size_t i = 0; i < localSize(); i++)</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  state[i] *= d33;</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  }</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  }</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> </div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  } <span class="keywordflow">else</span> </div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="preprocessor"> #endif</span></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  {</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="comment">// general 2-qubit diagonal gate</span></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordflow">if</span> (qubit1 < M && qubit2 < M) {</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keywordtype">unsigned</span> delta1_ = std::min(delta1, delta2);</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keywordtype">unsigned</span> delta2_ = std::max(delta1, delta2);</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordflow">for</span> (std::size_t i = 0; i < localSize(); i += 2 * delta2_)</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keywordflow">for</span> (std::size_t j = 0; j < delta2_; j += 2 * delta1_)</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keywordflow">for</span> (std::size_t k = 0; k < delta1_; ++k) {</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  state[i + j + k ] *= d00;</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  state[i + j + k + delta2 ] *= d11;</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  state[i + j + k + delta1 ] *= d22;</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  state[i + j + k + delta1 + delta2] *= d33;</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  }</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> </div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (qubit1 >= M && qubit2 < M || qubit1 < M && qubit2 >= M) {</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <a class="code" href="interface__api__memory_8cpp.html#a8a7796dc492015686a15b44dfa64e347">Type</a> d0, d1;</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordtype">unsigned</span> delta;</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">if</span> (qubit1 >= M && qubit2 < M) {</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  d0 = (check_bit(src_glb_start, qubit1) == 0) ? d00 : d22;</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  d1 = (check_bit(src_glb_start, qubit1) == 0) ? d11 : d33;</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  delta = delta2;</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  d0 = (check_bit(src_glb_start, qubit2) == 0) ? d00 : d11;</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  d1 = (check_bit(src_glb_start, qubit2) == 0) ? d22 : d33;</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  delta = delta1;</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  }</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordflow">for</span> (std::size_t j = 0; j < localSize(); j += 2 * delta) {</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keywordflow">for</span> (std::size_t k = 0; k < delta; ++k) {</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  state[j + k ] *= d0;</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  state[j + k + delta ] *= d1;</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  }</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  } </div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (qubit1 >= M && qubit2 >= M) {</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordflow">if</span> (check_bit(src_glb_start, qubit1) == 0 &&</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  check_bit(src_glb_start, qubit2) == 0 ) {</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keywordflow">for</span> (std::size_t i = 0; i < localSize(); i++)</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  state[i] *= d00;</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (check_bit(src_glb_start, qubit1) == 0 &&</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  check_bit(src_glb_start, qubit2) == 1 ) {</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordflow">for</span> (std::size_t i = 0; i < localSize(); i++)</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  state[i] *= d11;</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (check_bit(src_glb_start, qubit1) == 1 &&</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  check_bit(src_glb_start, qubit2) == 0 ) {</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordflow">for</span> (std::size_t i = 0; i < localSize(); i++)</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  state[i] *= d22;</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">for</span> (std::size_t i = 0; i < localSize(); i++)</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  state[i] *= d33;</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  }</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  }</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  }</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> </div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> }</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> </div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> <span class="keyword">template</span> <span class="keyword">class </span><a class="code" href="classQbitRegister.html">QbitRegister<ComplexSP></a>;</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> <span class="keyword">template</span> <span class="keyword">class </span><a class="code" href="classQbitRegister.html">QbitRegister<ComplexDP></a>;</div><div class="ttc" id="classopenqu_1_1mpi_1_1Environment_html_a1c0c48f8af817320768ef3a1c9b98854"><div class="ttname"><a href="classopenqu_1_1mpi_1_1Environment.html#a1c0c48f8af817320768ef3a1c9b98854">openqu::mpi::Environment::rank</a></div><div class="ttdeci">static int rank()</div><div class="ttdef"><b>Definition:</b> <a href="mpi_8cpp_source.html#l00180">mpi.cpp:180</a></div></div>
|
|
<div class="ttc" id="highperfkernels_8cpp_html_a55aace691be1a8a57eec700a41d42ade"><div class="ttname"><a href="highperfkernels_8cpp.html#a55aace691be1a8a57eec700a41d42ade">m</a></div><div class="ttdeci">template __attribute__((noinline)) void Loop_DN(std template __attribute__((noinline)) void Loop_DN(std std::size_t std::size_t std::size_t std::size_t std::size_t std::size_t std::size_t std::size_t std::size_t TM2x2< Type > const & m</div><div class="ttdef"><b>Definition:</b> <a href="highperfkernels_8cpp_source.html#l00394">highperfkernels.cpp:394</a></div></div>
|
|
<div class="ttc" id="classopenqu_1_1mpi_1_1Environment_html_acfe5d7c4784f10856304f07cb93dac08"><div class="ttname"><a href="classopenqu_1_1mpi_1_1Environment.html#acfe5d7c4784f10856304f07cb93dac08">openqu::mpi::Environment::size</a></div><div class="ttdeci">static int size()</div><div class="ttdef"><b>Definition:</b> <a href="mpi_8cpp_source.html#l00191">mpi.cpp:191</a></div></div>
|
|
<div class="ttc" id="highperfkernels_8hpp_html"><div class="ttname"><a href="highperfkernels_8hpp.html">highperfkernels.hpp</a></div></div>
|
|
<div class="ttc" id="interface__api__memory_8cpp_html_a8a7796dc492015686a15b44dfa64e347"><div class="ttname"><a href="interface__api__memory_8cpp.html#a8a7796dc492015686a15b44dfa64e347">Type</a></div><div class="ttdeci">ComplexDP Type</div><div class="ttdef"><b>Definition:</b> <a href="interface__api__memory_8cpp_source.html#l00025">interface_api_memory.cpp:25</a></div></div>
|
|
<div class="ttc" id="classopenqu_1_1TinyMatrix_html"><div class="ttname"><a href="classopenqu_1_1TinyMatrix.html">openqu::TinyMatrix</a></div><div class="ttdoc">A small matrix with dimensions fixed at compile time. </div><div class="ttdef"><b>Definition:</b> <a href="tinymatrix_8hpp_source.html#l00044">tinymatrix.hpp:44</a></div></div>
|
|
<div class="ttc" id="classQbitRegister_html_a70e1d4b9c959323a1b29a9462d066d17"><div class="ttname"><a href="classQbitRegister.html#a70e1d4b9c959323a1b29a9462d066d17">QbitRegister::applyDiag</a></div><div class="ttdeci">void applyDiag(unsigned qubit1, unsigned qubit2, TM4x4< Type > const &m)</div><div class="ttdef"><b>Definition:</b> <a href="qureg__applydiag_8cpp_source.html#l00049">qureg_applydiag.cpp:49</a></div></div>
|
|
<div class="ttc" id="highperfkernels_8cpp_html_a3c5c1de356c65cc2bfca5046ecd71e6d"><div class="ttname"><a href="highperfkernels_8cpp.html#a3c5c1de356c65cc2bfca5046ecd71e6d">assert</a></div><div class="ttdeci">assert(((c22-c21)%c23)==0)</div></div>
|
|
<div class="ttc" id="classQbitRegister_html_abbcd74dfdb4ffa563f1e80d297201a29"><div class="ttname"><a href="classQbitRegister.html#abbcd74dfdb4ffa563f1e80d297201a29">QbitRegister::applyDiagSimp</a></div><div class="ttdeci">void applyDiagSimp(unsigned qubit1, unsigned qubit2, TM4x4< Type > const &m)</div><div class="ttdef"><b>Definition:</b> <a href="qureg__applydiag_8cpp_source.html#l00021">qureg_applydiag.cpp:21</a></div></div>
|
|
<div class="ttc" id="qureg_8hpp_html"><div class="ttname"><a href="qureg_8hpp.html">qureg.hpp</a></div></div>
|
|
<div class="ttc" id="namespaceopenqu_html_a9cbfc48ff8a69fa8618c4eeaad4f2765"><div class="ttname"><a href="namespaceopenqu.html#a9cbfc48ff8a69fa8618c4eeaad4f2765">openqu::ilog2</a></div><div class="ttdeci">unsigned int ilog2(Integral n)</div><div class="ttdoc">returns the logarithm base 2 of a non-zero integer </div><div class="ttdef"><b>Definition:</b> <a href="bitops_8hpp_source.html#l00082">bitops.hpp:82</a></div></div>
|
|
<div class="ttc" id="utils_8hpp_html_a2d1ace2be4b6d58d3260b1b5fd1d63e0"><div class="ttname"><a href="utils_8hpp.html#a2d1ace2be4b6d58d3260b1b5fd1d63e0">UL</a></div><div class="ttdeci">#define UL(x)</div><div class="ttdef"><b>Definition:</b> <a href="utils_8hpp_source.html#l00034">utils.hpp:34</a></div></div>
|
|
<div class="ttc" id="classQbitRegister_html"><div class="ttname"><a href="classQbitRegister.html">QbitRegister</a></div><div class="ttdef"><b>Definition:</b> <a href="qureg_8hpp_source.html#l00068">qureg.hpp:68</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
<!-- start footer part -->
|
|
<hr class="footer"/><address class="footer"><small>
|
|
Generated on Mon Nov 6 2017 10:53:55 for Intel qHiPSTER by  <a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/>
|
|
</a> 1.8.11
|
|
</small></address>
|
|
</body>
|
|
</html>
|