Pith. sign in

REVIEW 1 cited by

Quantum Circuits for General Multiqubit Gates

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 quant-ph/0404089 v3 pith:ROGCFDYT submitted 2004-04-14 quant-ph

Mikko Mottonen , Juha J. Vartiainen , Ville Bergholm , Martti M. Salomaa This is my paper · ORCID
classification quant-ph
keywords gategateselementarygeneralquantumsequenceactingcircuits
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We consider a generic elementary gate sequence which is needed to implement a general quantum gate acting on n qubits -- a unitary transformation with 4^n degrees of freedom. For synthesizing the gate sequence, a method based on the so-called cosine-sine matrix decomposition is presented. The result is optimal in the number of elementary one-qubit gates, 4^n, and scales more favorably than the previously reported decompositions requiring 4^n-2^n+1 controlled NOT gates.

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. A 12-CNOT Double Qubit Excitation Gate

    quant-ph 2026-08 conditional novelty 5.0 of 10

    First reported 12-CNOT decomposition of the double qubit excitation operator, improving CNOT count, CNOT depth, and total depth over prior 13-CNOT circuits.

Pith tools