angad basandrai

01 projects

01 qirc rust, quantum computing sep. 2026 - present

implemented a qir compiler and built-in state-vector simulator from scratch in rust, supporting circuit validation, optimization, and execution.
implemented multi-format output, including openqasm 3, qir, json, and hardware-specific gate-set and qubit-layout transformations.
came third in SegFault 2026.

github web docs PyPI crates.io

02 syrix rust, opengl july 2026

implemented a from-scratch browser engine in rust, integrating 6 subsystems spanning html parsing, dom representation, layout, graphics, utilities, and browser chrome.
built a rendering pipeline that converts parsed dom trees into layout boxes and display commands before rasterising pages through an opengl renderer.
implemented 4 browser interactions: url navigation, hyperlink resolution, page reload, and home-page.

03 2d physics engine c++, opengl, glfw sep. 2025 - july 2026

implemented a real-time 2d physics engine using c++, opengl, and glfw, with rk4 numerical integration.
optimised the simulation pipeline to support 1,000+ bodies at 60+ fps during real-time execution.
implemented collision detection and physics-based interactions for simulated bodies.

04 tune-ai python, peft, reinforcement learning june 2026

implemented a ppo-based prompt optimiser using qwen2.5-1.5b-instruct with lora fine-tuning and a groq-hosted llama 3.1 8b reward model.
trained the optimiser on synthetic noisy restaurant-order examples to improve prompt robustness.
used clipped policy and value losses with entropy regularisation and token-level advantage estimation.

github read more

05 PyScorch python, cuda may 2026 - june 2026

implemented a neural network library in python with cuda support for gpu-accelerated computation.
trained a neural network on mnist, achieving approximately 98% accuracy, comparable to pytorch while taking roughly twice the execution time.

iiest.wikifounder and maintainer, including its associated subwebsites

site github

arXiv moderation pending

cs.GT sep. 2026 - present preprint submitted, not yet publicly listed or peer reviewed

implemented a double oracle framework with dynamic programming best-response oracles and linear programming over the equilibrium polytope to identify safety-constrained exploitation strategies.
developed an exact solver for Colonel Blotto games containing up to 4.3 x 10¹² pure strategies without enumerating the complete strategy space.
characterised gift regions for unequal battlefield values and improved the equal-value divisibility condition from n | B to 2B/n in Z.
evaluated exploitation strategies against 4,510 human allocations from FiveThirtyEight Riddler Nation tournaments.