Phase context decomposition of diagonal unitaries for higher-dimensional systems
arXiv:1511.05758 · doi:10.1103/PhysRevA.93.052333
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- representation for the natural numbers. While the gate count of the best known decomposition method for general diagonal operators on qubit systems scales with , the circuits synthesized by the Welch algorithm for diagonal operators with distinct phases are upper-bounded by , which is generalized to for the qudit case in this paper.
arXiv comment6 pages
References in corpus (18)
- Elementary gates for quantum computation
- Multi-valued Logic Gates for Quantum Computation
- Polynomial-time quantum algorithm for the simulation of chemical dynamics
- Efficient Simulation of Quantum Systems by Quantum Computers
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- Asymptotically Optimal Quantum Circuits for d-level Systems
- Efficient Quantum Circuits for Diagonal Unitaries Without Ancillas
- Maximizing the Hilbert space for a finite number of distinguishable quantum states
- Both Toffoli and Controlled-NOT need little help to do universal quantum computation
- Synthesis of Multivalued Quantum Logic Circuits by Elementary Gates
- Decoupling with unitary approximate two-designs
- Time-efficient implementation of quantum search with qudits
- A Rudimentary Quantum Compiler
- 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