Pith. sign in

REVIEW 1 cited by

Quantum-gate decomposer

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 2109.13223 v1 pith:ZS44K2OW submitted 2021-09-27 quant-ph

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

Efficient decompositions of multi-qubit gates are essential in NISQ applications, where the number of gates or the circuit depth is limited. This paper presents efficient decompositions of CCZ and CCCZ gates, typical multi-qubit gates, under several qubit connectivities. We can construct the CCZ gate with only four CZ-depth when the qubit is square-shaped, including one auxiliary qubit. In T-shaped qubit connectivity, which has no closed loop, we can decompose the CCCZ gate with 17 CZ gates. While previous studies have shown a CCCZ gate decomposition with 14 CZ gates for the fully connected case, we found only four connections are sufficient for 14 CZ gates' implementation. The search for constraint-sufficient decompositions is aided by an optimization method we devised to bring the parameterized quantum circuit closer to the target quantum gate. We can apply this scheme to decompose any quantum gates, not only CCZ and CCCZ. Such decompositions of multi-qubit gates, together with the newly found CCZ and CCCZ decompositions, shorten the execution time of quantum circuits and improve the accuracy of complex quantum algorithms on near future QPUs.

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. 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