regenerate after: Merge branch 'main' of github.com:lsd-ucsc/lsd-ucsc…

….github.io
lsd-ucsc · Oct 9, 2023 · 2ad100e · 2ad100e
1 parent 43a351f
commit 2ad100e
Show file tree

Hide file tree

Showing 3 changed files with 8 additions and 9 deletions.
diff --git a/index.xml b/index.xml
@@ -60,7 +60,7 @@
 &lt;tr&gt;
 &lt;td&gt;&lt;a href=&#34;#oct-20&#34;&gt;Oct. 20&lt;/a&gt;&lt;/td&gt;
 &lt;td&gt;Adrian Lehmann&lt;/td&gt;
-&lt;td&gt;TBD&lt;/td&gt;
+&lt;td&gt;VyZX: Formal Verification of a Graphical Language&lt;/td&gt;
 &lt;/tr&gt;
 
 &lt;tr&gt;
@@ -192,11 +192,11 @@ publication list, blog, and other information at &lt;a href=&#34;https://harriso
 
 &lt;p&gt;&lt;strong&gt;Speaker:&lt;/strong&gt; Adrian Lehmann&lt;/p&gt;
 
-&lt;p&gt;&lt;strong&gt;Title:&lt;/strong&gt; TBD&lt;/p&gt;
+&lt;p&gt;&lt;strong&gt;Title:&lt;/strong&gt; VyZX: Formal Verification of a Graphical Language&lt;/p&gt;
 
-&lt;p&gt;&lt;strong&gt;Abstract:&lt;/strong&gt; TBD&lt;/p&gt;
+&lt;p&gt;&lt;strong&gt;Abstract:&lt;/strong&gt; Mathematical representations of graphs often resemble adjacency matrices or lists, representations that facilitate whiteboard reasoning and algorithm design. In the realm of proof assistants, inductive representations effectively define semantics for formal reasoning. This highlights a gap where algorithm design and proof assistants require a fundamentally different structure of graphs. To address this gap, we present VyZX, a verified library for reasoning about inductively defined graphical languages. These inductive constructs arise naturally from category theory definitions. A key goal for VyZX is to verify the ZX calculus, a graphical language for reasoning about categorical quantum mechanics. Used as a more general model than the standard quantum circuit model, the ZX calculus equips its construction “ZX-diagrams” with a collection of diagrammatic rewrite rules that preserve the graph&amp;rsquo;s semantic interpretation. The ZX calculus has been shown to be useful for building quantum error correction, quantum compilers, and for general graphical reasoning. In VyZX using an initial set of rules proven through their semantics, we proceed to prove facts about the ZX calculus by only appealing to statements about the ZX calculus using standard proof assistant techniques. VyZX integrates easily with the proof engineer&amp;rsquo;s workflow through visualization, automation and verified conversion of quantum circuits to ZX diagrams.&lt;/p&gt;
 
-&lt;p&gt;&lt;strong&gt;Bio:&lt;/strong&gt; TBD&lt;/p&gt;
+&lt;p&gt;&lt;strong&gt;Bio:&lt;/strong&gt; Adrian Lehmann is a PhD student at the University of Chicago adivsed by John Reppy working with Robert Rand. His interests lie in programming languages: compilation, verification, and using PL for better software engineering. He’s currently exploring applying these techniques to quantum computing.&lt;/p&gt;
 
 &lt;h1 id=&#34;oct-27&#34;&gt;Oct. 27&lt;/h1&gt;
 

diff --git a/lsd-seminar/2023fa/index.html b/lsd-seminar/2023fa/index.html
@@ -241,7 +241,7 @@ <h1 itemprop="name">Languages, Systems, and Data Seminar (Fall 2023)</h1>
 <tr>
 <td><a href="#oct-20">Oct. 20</a></td>
 <td>Adrian Lehmann</td>
-<td>TBD</td>
+<td>VyZX: Formal Verification of a Graphical Language</td>
 </tr>
 
 <tr>
@@ -373,11 +373,11 @@ <h1 id="oct-20">Oct. 20</h1>
 
 <p><strong>Speaker:</strong> Adrian Lehmann</p>
 
-<p><strong>Title:</strong> TBD</p>
+<p><strong>Title:</strong> VyZX: Formal Verification of a Graphical Language</p>
 
-<p><strong>Abstract:</strong> TBD</p>
+<p><strong>Abstract:</strong> Mathematical representations of graphs often resemble adjacency matrices or lists, representations that facilitate whiteboard reasoning and algorithm design. In the realm of proof assistants, inductive representations effectively define semantics for formal reasoning. This highlights a gap where algorithm design and proof assistants require a fundamentally different structure of graphs. To address this gap, we present VyZX, a verified library for reasoning about inductively defined graphical languages. These inductive constructs arise naturally from category theory definitions. A key goal for VyZX is to verify the ZX calculus, a graphical language for reasoning about categorical quantum mechanics. Used as a more general model than the standard quantum circuit model, the ZX calculus equips its construction “ZX-diagrams” with a collection of diagrammatic rewrite rules that preserve the graph&rsquo;s semantic interpretation. The ZX calculus has been shown to be useful for building quantum error correction, quantum compilers, and for general graphical reasoning. In VyZX using an initial set of rules proven through their semantics, we proceed to prove facts about the ZX calculus by only appealing to statements about the ZX calculus using standard proof assistant techniques. VyZX integrates easily with the proof engineer&rsquo;s workflow through visualization, automation and verified conversion of quantum circuits to ZX diagrams.</p>
 
-<p><strong>Bio:</strong> TBD</p>
+<p><strong>Bio:</strong> Adrian Lehmann is a PhD student at the University of Chicago adivsed by John Reppy working with Robert Rand. His interests lie in programming languages: compilation, verification, and using PL for better software engineering. He’s currently exploring applying these techniques to quantum computing.</p>
 
 <h1 id="oct-27">Oct. 27</h1>
 

diff --git a/themes/academic b/themes/academic