<?xml version="1.0" encoding="utf-8"?><feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en"><generator uri="https://jekyllrb.com/" version="4.4.1">Jekyll</generator><link href="https://aadipat.github.io/feed.xml" rel="self" type="application/atom+xml"/><link href="https://aadipat.github.io/" rel="alternate" type="text/html" hreflang="en"/><updated>2026-09-10T11:17:31+00:00</updated><id>https://aadipat.github.io/feed.xml</id><title type="html">blank</title><subtitle>Personal website of Aadi Patwardhan — CS &amp; Engineering (Honours) student at TU Delft, student researcher in quantum computing and AI. </subtitle><entry><title type="html">InferQ: can a database simulate a quantum computer?</title><link href="https://aadipat.github.io/blog/2026/inferq/" rel="alternate" type="text/html" title="InferQ: can a database simulate a quantum computer?"/><published>2026-09-10T00:00:00+00:00</published><updated>2026-09-10T00:00:00+00:00</updated><id>https://aadipat.github.io/blog/2026/inferq</id><content type="html" xml:base="https://aadipat.github.io/blog/2026/inferq/"><![CDATA[<p>Simulating a quantum circuit classically usually means tracking a state vector or tensor network directly, with a purpose-built simulator like Qiskit Aer doing the heavy lifting. But there’s a less obvious angle: circuit simulation is, at its core, a sequence of tensor contractions — and tensor contraction can be expressed as a <strong>join-and-aggregate SQL query</strong>. Represent two tensors as rows of <code class="language-plaintext highlighter-rouge">(i, k, val)</code> and <code class="language-plaintext highlighter-rouge">(k, j, val)</code>, join them on the shared index <code class="language-plaintext highlighter-rouge">k</code>, multiply, and sum out <code class="language-plaintext highlighter-rouge">k</code>:</p> <div class="language-sql highlighter-rouge"><div class="highlight"><pre class="highlight"><code><span class="c1">-- matrix multiplication w = A x B, expressed as a join-and-aggregate query</span>
<span class="k">SELECT</span> <span class="n">A</span><span class="p">.</span><span class="n">i</span><span class="p">,</span> <span class="n">B</span><span class="p">.</span><span class="n">j</span><span class="p">,</span> <span class="k">SUM</span><span class="p">(</span><span class="n">A</span><span class="p">.</span><span class="n">val</span> <span class="o">*</span> <span class="n">B</span><span class="p">.</span><span class="n">val</span><span class="p">)</span> <span class="k">AS</span> <span class="n">w_ij</span>
<span class="k">FROM</span> <span class="n">A</span> <span class="k">JOIN</span> <span class="n">B</span> <span class="k">ON</span> <span class="n">A</span><span class="p">.</span><span class="n">k</span> <span class="o">=</span> <span class="n">B</span><span class="p">.</span><span class="n">k</span>
<span class="k">GROUP</span> <span class="k">BY</span> <span class="n">A</span><span class="p">.</span><span class="n">i</span><span class="p">,</span> <span class="n">B</span><span class="p">.</span><span class="n">j</span><span class="p">;</span>
</code></pre></div></div> <p>That’s the whole trick — applying a gate to a quantum state is just this pattern, over and over. So: could a general-purpose relational database, with decades of engineering behind query optimization and out-of-core memory management, be a competitive quantum simulator?</p> <p>Prior work showed isolated, striking results in this direction — DuckDB simulating GHZ-state preparation out to millions of qubits under a tight memory budget. But those results were on a narrow set of highly structured circuits, and it wasn’t clear when this approach generalizes versus when it falls apart (the same study found a dense circuit like the Quantum Fourier Transform tops out at just 14 qubits under identical conditions).</p> <p><strong>InferQ</strong>, published with Andrei Ilinescu and Rihan Hai at SIGMOD 2027, is a benchmark built to answer that question systematically rather than case-by-case. It:</p> <ul> <li><strong>Generates general, compositional circuits</strong> by assembling subcircuits from a library of templates, rather than restricting to a handful of textbook circuit families.</li> <li><strong>Compiles every circuit into an RDBMS-ready SQL workload</strong>, so the same circuit can be handed directly to PostgreSQL, SQLite, DuckDB, or Umbra.</li> <li><strong>Extracts circuit and query features</strong> — static, graph-structural, SQL-level, and dynamic — so a workload can be characterized numerically, not just by eyeballing the circuit diagram.</li> <li><strong>Releases a dataset of 202,975 generated circuits</strong> with all their features, plus a web-based viewer for searching, filtering, and downloading circuits.</li> </ul> <p>Running this benchmark across four RDBMS engines and Qiskit Aer, we found RDBMSs achieve better peak memory usage than Aer on more than half of the generated circuits — the database approach isn’t a narrow party trick, it’s broadly competitive on memory. More interesting, though: using InferQ’s extracted features, simple linear and tree-based models can predict <em>which</em> engine will be faster or more memory-efficient for a given circuit with up to 95.6% (runtime) and 97.4% (memory) accuracy. That turns “should I simulate this circuit with a database or a dedicated simulator” from a case-by-case guess into a data-driven, learned decision — a small step toward automatic, workload-aware simulator selection.</p> <p>This sits right alongside my earlier work on <a href="/projects/QMPS_code/">Matrix Product State simulation</a>: both are ultimately about choosing the right computational substrate for a given circuit’s structure, whether that’s a tensor network or a relational database.</p> <p>Paper, abstract, and PDF are on the <a href="/publications/#ilinescu2026inferq">publications page</a> <a class="citation" href="#ilinescu2026inferq">(Ilinescu et al., 2026)</a>.</p>]]></content><author><name></name></author><category term="publications"/><category term="quantum-computing"/><category term="databases"/><category term="research"/><summary type="html"><![CDATA[A benchmark for running quantum circuit simulation as SQL, and when it actually beats Qiskit.]]></summary></entry><entry><title type="html">QEC lake: a data lake for quantum error correction</title><link href="https://aadipat.github.io/blog/2026/qec-lake/" rel="alternate" type="text/html" title="QEC lake: a data lake for quantum error correction"/><published>2026-06-02T00:00:00+00:00</published><updated>2026-06-02T00:00:00+00:00</updated><id>https://aadipat.github.io/blog/2026/qec-lake</id><content type="html" xml:base="https://aadipat.github.io/blog/2026/qec-lake/"><![CDATA[<p>Quantum error correction (QEC) is what makes a fault-tolerant quantum computer possible: physical qubits are noisy, so QEC codes spread logical information across many physical qubits and use repeated syndrome measurements to detect and correct errors. Decoding — turning a stream of noisy syndrome measurements into “which qubits flipped” — is increasingly done with AI models rather than hand-designed algorithms, because learned decoders can adapt to the messy, correlated noise of real hardware better than classical decoders can.</p> <p>The catch: training a good decoder needs a lot of QEC data, and that data is a mess. Every code family (surface codes, color codes, …) and every hardware platform emits data in its own schema. Datasets are scattered across incompatible repositories, often undocumented, and rarely large enough on their own. Comparing two decoders fairly is hard when they were never trained or evaluated on comparable data in the first place.</p> <p><strong>QEC lake</strong>, the paper Max de Groot, Andrei Ilinescu, Aditya Shankar, Yuandou Wang, Wenbo Sun, Floris Geerts, Rihan Hai and I demoed at VLDB 2026, is a domain-specific data lake built to fix exactly this. It:</p> <ul> <li><strong>Continuously crawls and refreshes</strong> open QEC datasets from across code families and hardware platforms into one place.</li> <li><strong>Generates new data</strong> — user-configurable simulated circuits, and synthetic variants derived from real hardware data — to fill in the gaps where real data is scarce.</li> <li><strong>Manages metadata for discovery</strong>, so a researcher can actually find the subset of data relevant to their code family, distance, and noise model instead of digging through disconnected repos.</li> <li><strong>Prepares model-ready inputs</strong>, converting heterogeneous raw data into the tabular formats tree-based models and tabular foundation models expect, plus an AI-assisted natural-language interface for exploring the data.</li> </ul> <p>At the VLDB demo, attendees ingested sources, generated new datasets on the spot, explored them through structured and natural-language queries, and exported model-ready training data — the full pipeline from “scattered QEC data” to “something a decoder can train on,” in one sitting.</p> <p>To make the underlying decoding problem tangible for a general audience (not everyone at a database conference has a quantum information background), I also built <a href="/projects/QEC_Game/">QEC Tiles: Stabilizer Rush</a>, a small browser game where you play the decoder in real time.</p> <p>Paper, abstract, and PDF are on the <a href="/publications/#patwardhan2026qeclake">publications page</a> <a class="citation" href="#patwardhan2026qeclake">(Patwardhan et al., 2026)</a>.</p>]]></content><author><name></name></author><category term="publications"/><category term="quantum-computing"/><category term="databases"/><category term="research"/><summary type="html"><![CDATA[Why AI-based QEC decoders are starved for data, and how QEC lake fixes that.]]></summary></entry><entry><title type="html">My webpage is live!</title><link href="https://aadipat.github.io/blog/2025/mywebpage/" rel="alternate" type="text/html" title="My webpage is live!"/><published>2025-07-23T00:00:00+00:00</published><updated>2025-07-23T00:00:00+00:00</updated><id>https://aadipat.github.io/blog/2025/mywebpage</id><content type="html" xml:base="https://aadipat.github.io/blog/2025/mywebpage/"><![CDATA[<p>I made this webpage using the al folio jekyll theme. I forked the repository and deployed the webpage using github pages on my username.github.io.</p> <p>In about 5 minutes, the gh-pages branch was created which I set as the deploy branch. I also needed to give read write prviledges under settings/actions/general.</p> <p>To work on it locally, I am using the dev container that they have already provided me with.</p> <p>I am excited to use this page for documenting my insights, projects and sharing them with you!</p>]]></content><author><name></name></author><category term="sample-posts"/><category term="Misc"/><summary type="html"><![CDATA[This is how I made this website!]]></summary></entry></feed>