Adaptive Compilation of Multi-Level Quantum Operations

Abstract

Quantum computers have the potential to solve some important industrial and scientific problems with greater efficiency than classical computers. While most current realizations focus on two-level qubits, the underlying physics used in most hardware is capable of extending the concepts to a multi-level logic - enabling the use of qudits, which promise higher computational power and lower error rates. Based on a strong theoretical backing and motivated by recent physical accomplishments, this also calls for methods and tools for compiling quantum circuits to those devices. To enable efficient qudit compilation, we introduce the concept of an energy coupling graph for single-qudit systems and provide an adaptive algorithm that leverages this representation for compiling arbitrary unitaries. This leads to significant improvements over the state-of-the-art compilation scheme and, additionally, provides an option to trade-off worst-case costs and run-time. The developed compiler is available via github.com/cda-tum/qudit-compilation under an open-source license.

arXiv comment8 pages, 4 figures

References in corpus (24)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Multi-particle entanglement of hot trapped ions
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Photonic quantum information processing: a review
• Qudits and high-dimensional quantum computing
• A compact ion-trap quantum computing demonstrator
• A universal qudit quantum processor with trapped ions
• Multi-photon entanglement in high dimensions
• Operating Quantum States in Single Magnetic Molecules: Implementation of Grover's Quantum Algorithm
• Beating the channel capacity limit for superdense coding with entangled ququarts
• The structure of multidimensional entanglement in multipartite systems
• Asymptotically Optimal Quantum Circuits for d-level Systems
• Qutrit randomized benchmarking
• Computational speed-up with a single qudit
• Computational speed-up in a single qudit NMR quantum information processor
• State-independent experimental tests of quantum contextuality in a three dimensional system
• Criteria for Exact Qudit Universality
• Certification and Quantification of Multilevel Quantum Coherence
• Scalable quantum computing with qudits on a graph
• Parallelism for Quantum Computation with Qudits
• Characterization of Control in a Superconducting Qutrit Using Randomized Benchmarking
• Valence bond solid formalism for d-level one-way quantum computation
• Efficient Circuits for Exact-Universal Computations with Qudits

Cited by in corpus (4)

• The MQT Handbook: A Summary of Design Automation Tools and Software for Quantum Computing
• Efficient realization of quantum algorithms with qudits
• Generalized Toffoli gate decomposition using ququints: Towards realizing Grover's algorithm with qudits
• Scaling W state circuits in the qudit Clifford hierarchy