unitaryfoundation/metriq-app

Big-O complexity metrics

Open

#405 opened on Jan 28, 2022

View on GitHub
 (1 comment) (0 reactions) (0 assignees)JavaScript (30 forks)github user discovery
help wantedquestion

Repository metrics

Stars
 (34 stars)
PR merge metrics
 (PR metrics pending)

Description

For reporting big-O complexity of quantum (or adjacent) algorithms, we can't generally rely on just a numerical metric value.

How do we programmatically collect and compare big-O for algorithms? How do we graphically present the state-of-the-art in terms of big-O complexity?

Contributor guide

Research direction
Investigate existing methods for collecting and comparing Big O complexity of quantum algorithms, and explore graphical presentation techniques (e.g., heatmaps, comparison charts). Look for libraries or tools that parse algorithm descriptions and extract complexity. Evaluate how Metriq's current architecture can be extended to include this feature.
Tech stack
javascript
Domain
full stack
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
3
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
3-5 days
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Active
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Needs investigation
Prerequisites
Big O notationquantum computing basics
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
30