resource-estimation

Qᴜᴀʟᴛʀᴀɴ is a Python library for expressing and analyzing Fault Tolerant Quantum algorithms.

Quantum Resource Estimate Format

A non-Clifford gate cost assessment library of quantum phase estimation algorithms for quantum chemistry

Multi-code QEC resource estimator for Qiskit circuits

Reference implementation of Dürr–Høyer quantum minimum finding and computed arithmetic oracles vs. QROM lookup tables in Qiskit, featuring FTQC Clifford+T resource scaling.

A fault-tolerant resource compiler: map a Clifford+T circuit to a surface-code lattice-surgery layout and optimise the magic-state factory ratio to minimise spacetime volume.

Python-based demonstration of a mineral resource estimation workflow using synthetic drill-hole data, showcasing variography, ordinary kriging, block modelling, and resource classification for educational and portfolio purposes.

A browser-native platform for estimating the physical resources required to run quantum algorithms on fault-tolerant quantum computers, powered by Microsoft's Q# WebAssembly engine.

Auditable browser-native Verilog RTL resource estimation & FPGA development board selector

Digital AJL circuit compiler and resource-estimation code companion for Jones-polynomial research

Lightweight, exact surface-code quantum error correction overhead calculator. How many physical qubits does one logical qubit cost? By Tech4Biz Solutions.

Transparent Python workflow for experimental variograms, simple kriging, and block bootstrap uncertainty in resource-style grids.

Quantitative resource and cost modelling for fault-tolerant quantum computing, including a Shor / RSA-2048 physical-qubit estimate.

Microsoft Azure Quantum — independent third-party profile of a public API surface, by API Evangelist. Microsoft Azure Quantum is Microsoft's cloud quantum computing service — an open, multi-vendor platform that provides access to quantum hardware from IonQ, Quantinuum, Pasqal, and Rigetti alongside Microsoft's own Q# programming language, Quantum D

Implemented a large-scale quantum algorithm that breaks a 256-bit Elliptic Curve Cryptography and analyzed the applicability of the algorithm in the presence of fault-tolerant quantum computers.

Measurements on the ECDSA.fail benchmark, the leanest known reversible circuit for secp256k1 point addition: the search cost the score does not count. The circuit is the community's; the instruments are mine, including a validated 9.2x checker and a classical pre-filter. Three findings filed upstream. Built with help from Claude Code.