Pith. sign in

REVIEW 1 cited by

Reversible Circuit Optimization via Leaving the Boolean Domain

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 1103.0215 v2 pith:PXLDBAPA submitted 2011-03-01 quant-ph cs.ET

Dmitri Maslov , Mehdi Saeedi This is my paper
classification quant-phcs.ET
keywords quantumcircuitreversibleauxiliarycircuitsdesignsgatesinside
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

For years, the quantum/reversible circuit community has been convinced that: a) the addition of auxiliary qubits is instrumental in constructing a smaller quantum circuit; and, b) the introduction of quantum gates inside reversible circuits may result in more efficient designs. This paper presents a systematic approach to optimizing reversible (and quantum) circuits via the introduction of auxiliary qubits and quantum gates inside circuit designs. This advances our understanding of what may be achieved with a) and b).

Discussion (0). Sign in 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. Multi-Controlled Quantum Gates in Linear Nearest Neighbor

    quant-ph 2025-05 conditional novelty 6.0 of 10

    Multi-controlled X and SU(2) gates on linear-nearest-neighbor qubit arrays require at most 4k+8n-16 and 4k+8n-14 CNOT gates, respectively, improving earlier bounds.

Pith tools