reinhardtmarta/mentalist-quantum-bot

How reinhardtmarta/mentalist-quantum-bot works

This is a quantum-circuit compiler/optimizer: the benchmark entry point builds a QFT circuit and hardware coupling map, then asks MentalistBot to optimize the circuit and reports its size and depth. The bot simplifies, selects an initial layout, routes circuit slices, evaluates candidates, and negotiates layouts across slice boundaries. The README gives no additional capability details; the graph follows the sampled source, so it does not assume other integrations or runtime stages.

Main entry points: bot.py Optimizer bot · main.py Benchmark runner · layout.py Layout selector · router.py Smart grid router

Components 12

Circuit rewriting

Pattern rewriter src/rewriter.py

Other components

QFT circuit
Hardware coupling map

Connections 16

Benchmark runner → QFT circuit: builds main.py
Benchmark runner → Hardware coupling map: builds main.py
Benchmark runner → Optimizer bot: runs optimization main.py
Optimizer bot → Pattern rewriter: constructs and calls src/bot.py
Optimizer bot → Layout selector: constructs and calls src/bot.py
Optimizer bot → Smart grid router: constructs and calls src/bot.py
Optimizer bot → Circuit slicing: slices circuit src/bot.py
Optimizer bot → Boundary negotiation: negotiates layouts src/bot.py
Optimizer bot → Circuit assembly: composes winners src/bot.py
Layout selector → Compact subgraph search: searches region src/layout.py
Layout selector → Interaction graph mapping: builds graph src/layout.py
Benchmark runner → QFT circuit: passes input main.py
Benchmark runner → Hardware coupling map: passes topology main.py
Optimizer bot → Smart grid router: routes slices src/bot.py
Optimizer bot → Pattern rewriter: simplifies candidates src/bot.py
Benchmark runner → Optimizer bot: reports result main.py

Drawn by GitDiagram on November 14, 2026 from the repository's file tree, README and source files. Read as Markdown ·

How reinhardtmarta/mentalist-quantum-bot works

Main entry points: bot.py Optimizer bot · main.py Benchmark runner · layout.py Layout selector · router.py Smart grid router

Components 12

Benchmark entry

Benchmark runner main.py

Optimization orchestration

Optimizer bot src/bot.py
Circuit slicing src/bot.py
Boundary negotiation src/bot.py
Circuit assembly src/bot.py

Initial layout

Layout selector src/layout.py
Compact subgraph search src/layout.py
Interaction graph mapping src/layout.py

Circuit routing

Smart grid router src/router.py

Circuit rewriting

Pattern rewriter src/rewriter.py

Other components

QFT circuit
Hardware coupling map

Connections 16

Benchmark runner → QFT circuit: builds main.py
Benchmark runner → Hardware coupling map: builds main.py
Benchmark runner → Optimizer bot: runs optimization main.py
Optimizer bot → Pattern rewriter: constructs and calls src/bot.py
Optimizer bot → Layout selector: constructs and calls src/bot.py
Optimizer bot → Smart grid router: constructs and calls src/bot.py
Optimizer bot → Circuit slicing: slices circuit src/bot.py
Optimizer bot → Boundary negotiation: negotiates layouts src/bot.py
Optimizer bot → Circuit assembly: composes winners src/bot.py
Layout selector → Compact subgraph search: searches region src/layout.py
Layout selector → Interaction graph mapping: builds graph src/layout.py
Benchmark runner → QFT circuit: passes input main.py
Benchmark runner → Hardware coupling map: passes topology main.py
Optimizer bot → Smart grid router: routes slices src/bot.py
Optimizer bot → Pattern rewriter: simplifies candidates src/bot.py
Benchmark runner → Optimizer bot: reports result main.py

Drawn by GitDiagram on November 14, 2026 from the repository's file tree, README and source files. Read as Markdown ·