Pith. sign in

REVIEW 1 cited by

Evolving Quantum Circuits

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2210.05058 v1 pith:JCDW3F7R submitted 2022-10-11 quant-ph

classification quant-ph
keywords quantumcircuitscodecodesqubitalgorithmsanticipateapplications
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We develop genetic algorithms for searching quantum circuits, in particular stabilizer quantum error correction codes. Quantum codes equivalent to notable examples such as the 5-qubit perfect code, Shor's code, and the 7-qubit color code are evolved out of initially random quantum circuits. We anticipate evolution as a promising tool in the NISQ era, with applications such as the search for novel topological ordered states, quantum compiling, and hardware optimization.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Incorporating Quantum Advantage in Quantum Circuit Generation through Genetic Programming

    quant-ph 2025-01 conditional novelty 5.0 of 10

    Two fitness functions that reward fewer oracle calls and require superposition or entanglement gates evolve Bernstein-Vazirani and 3-qubit search circuits faster than the baseline.

Pith tools