Synthesis of Multivalued Quantum Logic Circuits by Elementary Gates

Abstract

We propose the generalized controlled X (GCX) gate as the two-qudit elementary gate, and based on Cartan decomposition, we also give the one-qudit elementary gates. Then we discuss the physical implementation of these elementary gates and show that it is feasible with current technology. With these elementary gates many important qudit quantum gates can be synthesized conveniently. We provide efficient methods for the synthesis of various kinds of controlled qudit gates and greatly simplify the synthesis of existing generic multi-valued quantum circuits. Moreover, we generalize the quantum Shannon decomposition (QSD), the most powerful technique for the synthesis of generic qubit circuits, to the qudit case. A comparison of ququart (d=4) circuits and qubit circuits reveals that using ququart circuits may have an advantage over the qubit circuits in the synthesis of quantum circuits.

9 pages, 14 figures, 2 tables. Expanded version of quant-ph/1105.5485

References in corpus (5)

• Coupling Superconducting Qubits via a Cavity Bus
• Quantum computing with trapped ions
• Synthesis of Quantum Logic Circuits
• Control and Tomography of a Three Level Superconducting Artificial Atom
• Generation of high-fidelity controlled-not logic gates by coupled superconducting qubits

Cited by in corpus (30)

• Qudits and high-dimensional quantum computing
• Quantum Information Scrambling in a Superconducting Qutrit Processor
• Quantifying the magic of quantum channels
• Universal qudit gate synthesis for transmons
• Arithmetic Circuits for Multilevel Qudits Based on Quantum Fourier Transform
• Normal form for single-qutrit Clifford+T operators and synthesis of single-qutrit gates
• Prospects for Simulating a Qudit Based Model of (1+1)d Scalar QED
• Universal quantum multi-qubit entangling gates with auxiliary spaces
• Asymptotically Improved Circuit for $d$-ary Grover's Algorithm with Advanced Decomposition of $n$-qudit Toffoli Gate
• Primitive Quantum Gates for an SU(3) Discrete Subgroup: $\Sigma (36\times 3)$
• Optimal synthesis of multivalued quantum circuit
• Decomposition of bipartite and multipartite unitary gates into the product of controlled unitary gates
• One-Dimensional Lazy Quantum walk in Ternary System
• Qudit Dicke state preparation
• QuDiet: A Classical Simulation Platform for Qubit-Qudit Hybrid Quantum Systems
• Circuit Design for $k$-coloring Problem and Its Implementation in Any Dimensional Quantum System
• Efficient characterization of qudit logical gates with gate set tomography using an error-free Virtual-Z-gate model
• Spin-s Dicke states and their preparation
• Building Qutrit Diagonal Gates from Phase Gadgets
• Multi-Valued Quantum Neurons
• Mixed-Dimensional Qudit State Preparation Using Edge-Weighted Decision Diagrams
• Moving Quantum States without SWAP via Intermediate Higher Dimensional Qudits
• Group Sparse Matrix Optimization for Efficient Quantum State Transformation
• Phase context decomposition of diagonal unitaries for higher-dimensional systems
• Cost of Locally Approximating High-Dimensional Ground States of Contextual Quantum Models
• Synthesis and upper bound of Schmidt rank of the bipartite controlled-unitary gates
• Optimizing Quantum Transformation Matrices: A Block Decomposition Approach for Efficient Gate Reduction
• Physically motivated decompositions of single-qutrit gates
• Constructing all qutrit controlled Clifford+T gates in Clifford+T
• Implementation of the quantum Fourier transform on a hybrid qubit-qutrit NMR quantum emulator