Pith. sign in

Decomposition of multi-controlled special unitary single-qubit gates

4 Pith papers cite this work. Polarity classification is still indexing.

4 Pith papers citing it

citation-role summary

background 1

citation-polarity summary

fields

quant-ph 4

years

2026 2 2025 2

verdicts

UNVERDICTED 4

roles

background 1

polarities

unclear 1

representative citing papers

Quantum Search without Global Diffusion

quant-ph · 2026-04-16 · unverdicted · novelty 7.0

A recursive construction preserves O(sqrt(N)) quantum search complexity with local operations on tensor-decomposable partitions, eliminating the need for global diffusion via degeneracy in reflection angles.

Efficient Simulation of High-Level Quantum Gates

quant-ph · 2025-07-06 · unverdicted · novelty 7.0

A gadget-based simulator directly simulates high-level quantum gates via low-rank stabilizer decompositions of magic states, improving both theoretical complexity and practical runtime over standard compilation-based methods.

citing papers explorer

Showing 4 of 4 citing papers.

  • Approximate Sparse State Preparation with the Grover-Rudolph Algorithm quant-ph · 2026-04-27 · unverdicted · none · ref 25

    Two enhancements to the Grover-Rudolph algorithm reduce CNOT gates and control qubits for sparse quantum state preparation, including an approximate variant with a classically computable overlap estimate.

  • Quantum Search without Global Diffusion quant-ph · 2026-04-16 · unverdicted · none · ref 25

    A recursive construction preserves O(sqrt(N)) quantum search complexity with local operations on tensor-decomposable partitions, eliminating the need for global diffusion via degeneracy in reflection angles.

  • Efficient Simulation of High-Level Quantum Gates quant-ph · 2025-07-06 · unverdicted · none · ref 21

    A gadget-based simulator directly simulates high-level quantum gates via low-rank stabilizer decompositions of magic states, improving both theoretical complexity and practical runtime over standard compilation-based methods.

  • A penalty-free quantum algorithm to find energy eigenstates quant-ph · 2025-09-11 · unverdicted · none · ref 40

    A penalty-free, fully quantum algorithm is proposed for finding ground and excited states of many-body Hamiltonians.