Pith. sign in

REVIEW 2 cited by

Quantum circuit synthesis with qudit phase gadget method

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 2504.12710 v1 pith:NUJO27O2 submitted 2025-04-17 quant-ph cs.ET

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

Current quantum devices have unutilized high-level quantum resources. More and more attention has been paid to the qudit quantum systems with larger than two dimensions to maximize the potential computing power of quantum computation. Then, a natural problem arises: How do we implement quantum algorithms on qudit quantum systems? In this work, we propose a novel qudit phase gadget method for synthesizing the qudit diagonal unitary matrices. This method is suitable for the Noisy Intermediate-Scale Quantum (NISQ) and fault-tolerant eras due to its versatility in different connectivity architectures and the optimality of its resource consumption. The method can work on any connectivity architecture with asymptotic optimal circuit depth and size. For a 10-qutrit diagonal unitary, our algorithm reduces the circuit depth form about 100000 to 500 with 300 ancillary qutrits. Further, this method can be promoted to different quantum circuit synthesis problems, such as quantum state preparation problems, general unitary synthesis problems, etc.

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. Non-Abelian dynamics on a cube: improving quantum compilation through qudit-based simulations

    quant-ph 2025-06 conditional novelty 7.0 of 10

    A qudit-based circuit for SU(2) lattice gauge theory on a cube, with improved decompositions for uniformly-controlled rotations and new elementary-gate resource estimates.

  2. Noise-Directed Adaptive Remapping for Integer Optimization: from qubits to (encoded) qudits

    quant-ph 2026-06 unverdicted novelty 6.0 of 10

    NDAR, a heuristic that turns device noise into a resource, is generalized to integer-domain optimization; qudit-native encodings are argued to be the best fit because their all-zeros attractor is always feasible and t...

Pith tools