Pith. sign in

REVIEW 2 cited by

Decomposition of Multi-controlled Special Unitary Single-Qubit Gates

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 2302.06377 v1 pith:ULX3ULHG submitted 2023-02-13 quant-ph cs.ET

classification quant-phcs.ET
keywords gatesmulti-controlledquantumcnotdecompositionnumbercircuitgate
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Multi-controlled unitary gates have been a subject of interest in quantum computing since its inception, and are widely used in quantum algorithms. The current state-of-the-art approach to implementing n-qubit multi-controlled gates involves the use of a quadratic number of single-qubit and CNOT gates. However, linear solutions are possible for the case where the controlled gate is a special unitary SU(2). The most widely-used decomposition of an n-qubit multi-controlled SU(2) gate requires a circuit with a number of CNOT gates proportional to 28n. In this work, we present a new decomposition of n-qubit multi-controlled SU(2) gates that requires a circuit with a number of CNOT gates proportional to 20n, and proportional to 16n if the SU(2) gate has at least one real-valued diagonal. This new approach significantly improves the existing algorithm by reducing the number of CNOT gates and the overall circuit depth. As an application, we show the use of this decomposition for sparse quantum state preparation. Our results are further validated by demonstrating a proof of principle on a quantum device accessed through quantum cloud services.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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.

  2. Quantum algorithms for second-order boundary value problems

    quant-ph 2026-07 conditional novelty 5.5 of 10

    Second-order operators from exterior calculus become star-local relaxation updates that compile into reusable quantum circuits for div–grad and curl–curl problems.

Pith tools