Skip to content

Commit

Permalink
[skip ci] Update docs
Browse files Browse the repository at this point in the history
  • Loading branch information
CircleCI builder committed Apr 11, 2024
1 parent 6156e24 commit 2aee471
Show file tree
Hide file tree
Showing 3 changed files with 7 additions and 6 deletions.
3 changes: 2 additions & 1 deletion _modules/oitg/circuits/protocols/process_tomo/analyse.html
View file
Original file line number Diff line number Diff line change
Expand Up @@ -473,7 +473,8 @@ <h1>Source code for oitg.circuits.protocols.process_tomo.analyse</h1><div class=
<span class="c1"># For large systems, we would probably want to write the multiplications</span>
<span class="c1"># with the inverse in terms of linalg.solve instead, but just calculating</span>
<span class="c1"># the inverse avoids tensor product index gymnastics for now.</span>
<span class="n">lambda_inv</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">kron</span><span class="p">(</span><span class="n">np</span><span class="o">.</span><span class="n">linalg</span><span class="o">.</span><span class="n">inv</span><span class="p">(</span><span class="n">lambda_</span><span class="p">),</span> <span class="n">np</span><span class="o">.</span><span class="n">eye</span><span class="p">(</span><span class="n">pure_state_dimension</span><span class="p">))</span>
<span class="n">lambda_inv</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">kron</span><span class="p">(</span><span class="n">np</span><span class="o">.</span><span class="n">linalg</span><span class="o">.</span><span class="n">inv</span><span class="p">(</span><span class="n">np</span><span class="o">.</span><span class="n">complex128</span><span class="p">(</span><span class="n">lambda_</span><span class="p">)),</span>
<span class="n">np</span><span class="o">.</span><span class="n">eye</span><span class="p">(</span><span class="n">pure_state_dimension</span><span class="p">))</span>

<span class="n">new_choi</span> <span class="o">=</span> <span class="n">lambda_inv</span> <span class="o">@</span> <span class="n">diluted_grad</span> <span class="o">@</span> <span class="n">choi</span> <span class="o">@</span> <span class="n">diluted_grad</span> <span class="o">@</span> <span class="n">lambda_inv</span>
<span class="k">if</span> <span class="n">negative_log_likelihood</span><span class="p">(</span><span class="n">choi_predictor</span><span class="p">,</span> <span class="n">observation_vec</span><span class="p">,</span>
Expand Down
8 changes: 4 additions & 4 deletions _modules/oitg/circuits/protocols/process_tomo/generate.html
View file
Original file line number Diff line number Diff line change
Expand Up @@ -144,16 +144,16 @@ <h1>Source code for oitg.circuits.protocols.process_tomo.generate</h1><div class
<span class="p">(</span><span class="n">Gate</span><span class="p">(</span><span class="s2">&quot;rx&quot;</span><span class="p">,</span> <span class="p">(</span><span class="n">np</span><span class="o">.</span><span class="n">pi</span><span class="p">,</span> <span class="p">),</span> <span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="p">)),</span> <span class="p">),</span> <span class="c1"># -z</span>
<span class="p">]</span>

<span class="k">def</span> <span class="nf">fiducial_pairs</span><span class="p">(</span><span class="nb">locals</span><span class="p">):</span>
<span class="k">def</span> <span class="nf">make_combinations</span><span class="p">(</span><span class="n">qubit_seqs</span><span class="p">):</span>
<span class="k">return</span> <span class="p">[</span>
<span class="nb">tuple</span><span class="p">(</span>
<span class="n">chain</span><span class="o">.</span><span class="n">from_iterable</span><span class="p">(</span>
<span class="n">remap_operands</span><span class="p">(</span><span class="n">seq</span><span class="p">,</span> <span class="p">{</span><span class="mi">0</span><span class="p">:</span> <span class="n">i</span><span class="p">})</span> <span class="k">for</span> <span class="p">(</span><span class="n">i</span><span class="p">,</span> <span class="n">seq</span><span class="p">)</span> <span class="ow">in</span> <span class="nb">enumerate</span><span class="p">(</span><span class="n">seqs</span><span class="p">)))</span>
<span class="k">for</span> <span class="n">seqs</span> <span class="ow">in</span> <span class="n">product</span><span class="p">(</span><span class="nb">locals</span><span class="p">,</span> <span class="n">repeat</span><span class="o">=</span><span class="n">num_qubits</span><span class="p">)</span>
<span class="k">for</span> <span class="n">seqs</span> <span class="ow">in</span> <span class="n">product</span><span class="p">(</span><span class="n">qubit_seqs</span><span class="p">,</span> <span class="n">repeat</span><span class="o">=</span><span class="n">num_qubits</span><span class="p">)</span>
<span class="p">]</span>

<span class="k">return</span> <span class="p">[(</span><span class="n">prep</span><span class="p">,</span> <span class="n">measure</span><span class="p">[::</span><span class="o">-</span><span class="mi">1</span><span class="p">])</span> <span class="k">for</span> <span class="n">prep</span> <span class="ow">in</span> <span class="n">fiducial_pairs</span><span class="p">(</span><span class="n">fiducials</span><span class="p">)</span>
<span class="k">for</span> <span class="n">measure</span> <span class="ow">in</span> <span class="n">fiducial_pairs</span><span class="p">(</span><span class="n">fiducials</span><span class="p">[:</span><span class="mi">3</span><span class="p">])]</span></div>
<span class="k">return</span> <span class="p">[(</span><span class="n">prep</span><span class="p">,</span> <span class="n">measure</span><span class="p">[::</span><span class="o">-</span><span class="mi">1</span><span class="p">])</span> <span class="k">for</span> <span class="n">prep</span> <span class="ow">in</span> <span class="n">make_combinations</span><span class="p">(</span><span class="n">fiducials</span><span class="p">)</span>
<span class="k">for</span> <span class="n">measure</span> <span class="ow">in</span> <span class="n">make_combinations</span><span class="p">(</span><span class="n">fiducials</span><span class="p">[:</span><span class="mi">3</span><span class="p">])]</span></div>

</pre></div>

Expand Down
2 changes: 1 addition & 1 deletion _modules/oitg/results.html
View file
Original file line number Diff line number Diff line change
Expand Up @@ -303,7 +303,7 @@ <h1>Source code for oitg.results</h1><div class="highlight"><pre>


<span class="k">def</span> <span class="nf">parse_magic</span><span class="p">(</span><span class="n">rid</span><span class="p">):</span>
<span class="n">match</span> <span class="o">=</span> <span class="n">re</span><span class="o">.</span><span class="n">match</span><span class="p">(</span><span class="s2">&quot;^([a-zA-Z]+_)?([0-9]{1,9})$&quot;</span><span class="p">,</span> <span class="n">rid</span><span class="p">)</span>
<span class="n">match</span> <span class="o">=</span> <span class="n">re</span><span class="o">.</span><span class="n">match</span><span class="p">(</span><span class="s2">&quot;^([a-zA-Z0-9_]+_)?([0-9]{1,9})$&quot;</span><span class="p">,</span> <span class="n">rid</span><span class="p">)</span>
<span class="k">if</span> <span class="ow">not</span> <span class="n">match</span><span class="p">:</span>
<span class="k">return</span> <span class="kc">None</span>
<span class="n">exp</span><span class="p">,</span> <span class="n">rid</span> <span class="o">=</span> <span class="n">match</span><span class="o">.</span><span class="n">groups</span><span class="p">()</span>
Expand Down

0 comments on commit 2aee471

Please sign in to comment.