Daksh Shami

PhD student in Computer Science, University of Wisconsin-Madison

Portrait of Daksh Shami
“Nothing in life is to be feared, it is only to be understood. Now is the time to understand more, so that we may fear less.”

Marie Curie

I’m a first-year PhD student at UW-Madison, advised by Prof. Charles Yuan, working on quantum algorithms and quantum programming languages. I want to find out which classically intractable problems in science can be solved by a quantum computer, and how ideas from programming languages can help us solve them.

I believe quantum computing is in its “x86” era where the hardware is improving quickly, but our understanding of how to program quantum computers hasn’t caught up. That means more than putting nicer interfaces on today’s circuit-level programs, which still leave us thinking gate by gate (imagine programming a linear equation with just x86 assembly, and how tedious that would be!)

It means building abstractions that tell us, from the program itself, whether a quantum computer can solve the problem efficiently, without anyone having to reason about superposition, interference and entanglement.

In review

Compiling Matrix Formulas to Quantum Block Encodings

Realizing the promise of quantum applications such as chemistry or fluid dynamics requires building quantum circuits that efficiently encode and manipulate exponentially large matrices. This process forces researchers to grapple with the reality that a matrix expressible as one equation on paper can map to thousands of bit-level quantum logic gates, historically written by hand. Even worse, it often ends with a discovery that the needed resources grow so quickly with matrix size that the quantum algorithm loses its asymptotic speedup.

In this work, we present MARBLE, a language that automatically synthesizes an efficient circuit from the publication-style formula for the entries of a matrix. MARBLE algebraically rewrites programs into symbolic combinations of simpler matrices that have known circuit realizations. It analyzes costs of possible representations, notably the subnormalization term that dominates time complexity. It then emits an OpenQASM circuit and certifies whether its cost is poly-logarithmic in problem size, as required by quantum algorithms.

When evaluated on quantum applications ranging from fluid dynamics to physical Hamiltonians, MARBLE matches or surpasses 37 of 39 published baselines. On the low end, it automatically matches many theoretically optimal circuits, and on the high end, it improves on a published construction in fluid dynamics by 10,487× in subnormalization. MARBLE produces exponentially smaller circuits than the leading tool FABLE, and it successfully compiles matrices whose dimensions exceed 2100 within five seconds on a laptop.

Curriculum vitae Download CV (PDF)

Education

PhD, Computer Science, University of Wisconsin-Madison2026-present

BA, Computer Science & Mathematics, Reed College2018-2022

Research

Compiling Matrix Formulas to Quantum Block EncodingsIn review

Prior work experience

Senior Software Engineer, Meta2025-2026

Software Engineer, Google2022-2025