Phase context decomposition of diagonal unitaries for higher-dimensional systems

Abstract

We generalize an efficient decomposition method for diagonal operators by Welch et al. to qudit systems. The phase-context aware method focusses on cascaded entanglers whose decomposition into multi-controlled INC-gates can be optimized by the choice of a proper signed base-$d$ representation for the natural numbers. While the gate count of the best known decomposition method for general diagonal operators on qubit systems scales with $\mathcal{O}(2^n)$, the circuits synthesized by the Welch algorithm for diagonal operators with $k$ distinct phases are upper-bounded by $\mathcal{O}(n^{2}k)$, which is generalized to $\mathcal{O}(d{n}^{2}k)$ for the qudit case in this paper.

6 pages

References in corpus (9)

• Polynomial-time quantum algorithm for the simulation of chemical dynamics
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
• Both Toffoli and Controlled-NOT need little help to do universal quantum computation
• Time-efficient implementation of quantum search with qudits
• Quantum Commuting Circuits and Complexity of Ising Partition Functions
• Diagonal quantum circuits: their computational power and applications
• A quantum algorithm for additive approximation of Ising partition functions
• Commuting quantum circuits: efficient classical simulations versus hardness results
• Efficient Circuits for Exact-Universal Computations with Qudits

Cited by in corpus (3)

• Arithmetic Circuits for Multilevel Qudits Based on Quantum Fourier Transform
• Optimized synthesis of circuits for diagonal unitary matrices with reflection symmetry
• Approximate real-time evolution operator for potential with one ancillary qubit and application to first-quantized Hamiltonian simulation