AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

An Innovative Genetic Algorithm for the Quantum Circuit Compilation Problem

Riccardo Rasconi, Angelo Oddi

AAAI 2019 · Learning theory and algorithms › Combinatorial and search optimization · approach: SAT and model counting solvers · 36 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
replace greedy randomized search (GRS*) with genetic algorithm over QGRH-ranked gate selectionQGRH-based solver · QCCP N=21 P=2plan score: 0.80 -> 0.87Improved
replace GRS* with GAQGRH-based solver · QCCP N=40 P=1plan score: 0.88 -> 1.00Improved
replace GRS* with GAQGRH-based solver · QCCP N=8 P=2plan score: 0.88 -> 0.87No clear effect
replace GRS* with GAQGRH-based solver · QCCP-V N=40 P=2plan score: 0.78 -> 1.00Improved
replace GRS* with GAQGRH-based solver · QCCP-X N=40 P=2plan score: 0.89 -> 1.00Improved
make initial qstate-qubit assignment variable (QCCP-V) (ablation)GA · N=40 P=2plan score: 0.82 -> 1.00Improved
make initial qstate-qubit assignment variable (QCCP-V) (ablation)GRS* · N=40 P=2plan score: 0.73 -> 0.78Improved
re-implement GRS as GRS* with less CPU timeGRS · QCCP N=40 P=1plan score: 0.72 -> 0.88Improved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy