Pith. sign in

REVIEW 1 cited by

New Circuit for Quantum Adder by Constant

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 2501.07060 v1 pith:56ZYIN2F submitted 2025-01-13 quant-ph

classification quant-ph
keywords circuitconstantproposequantumt-countusesadderaddition
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We propose a new circuit for in-place addition of a classical $n$-bit constant to a quantum $n$-qubit integer modulo $2^n$. Our circuit uses $n-3$ ancilla qubits and has a T-count of $4n-5$. We also propose controlled version of this circuit that uses $n-2$ ancillas and has a T-count of $11n-15$. We implement these circuits in Q#.

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. QRTlib: A Library for Fast Quantum Real Transforms

    quant-ph 2025-10 conditional novelty 6.0 of 10

    A new Qiskit library implements quantum Hartley, cosine, and sine transforms, with an LCU-based Hartley circuit whose leading gate-complexity term is four times smaller than the previous best.

Pith tools