Compilation of Entangling Gates for High-Dimensional Quantum Systems
arXiv:2301.04155 · doi:10.1145/3566097.3567930
Abstract
Most quantum computing architectures to date natively support multi-valued logic, albeit being typically operated in a binary fashion. Multi-valued, or qudit, quantum processors have access to much richer forms of quantum entanglement, which promise to significantly boost the performance and usefulness of quantum devices. However, much of the theory as well as corresponding design methods required for exploiting such hardware remain insufficient and generalizations from qubits are not straightforward. A particular challenge is the compilation of quantum circuits into sets of native qudit gates supported by state-of-the-art quantum hardware. In this work, we address this challenge by introducing a complete workflow for compiling any two-qudit unitary into an arbitrary native gate set. Case studies demonstrate the feasibility of both, the proposed approach as well as the corresponding implementation (which is freely available at https://github.com/cda-tum/qudit-entanglement-compilation).
arXiv comment7 pages, 3 figures, 1 table
References in corpus (36)
- SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
- Array Programming with NumPy
- Quantum entanglement
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Variational Quantum Algorithms
- Noisy intermediate-scale quantum (NISQ) algorithms
- Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
- Photonic quantum information processing: a review
- 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
- Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
- Theory of overparametrization in quantum neural networks
- Reducing T-count with the ZX-calculus
- Asymptotically Optimal Quantum Circuits for d-level Systems
- Qutrit randomized benchmarking
- Native qudit entanglement in a trapped ion quantum processor
- Computational speed-up in a single qudit NMR quantum information processor
- Computational speed-up with a single qudit
- An alternative quantum fidelity for mixed states of qudits
- Implementing quantum control for unknown subroutines
- State-independent experimental tests of quantum contextuality in a three dimensional system
- Certification and Quantification of Multilevel Quantum Coherence
- Compiling quantum algorithms for architectures with multi-qubit gates
- Solving correlation clustering with QAOA and a Rydberg qudit system: a full-stack approach
- Composite parameterization and Haar measure for all unitary and special unitary groups
- A Wavelength-Insensitive, Multispecies Entangling Gate for Group-2 Atomic Ions
- Global Quantum Circuit Optimization
- Linear optical demonstration of quantum speed-up with a single qudit
- Qufinite ZX-calculus: a unified framework of qudit ZX-calculi
- A quantum compiler for qudits of prime dimension greater than 3
- Universal quantum computation and quantum error correction with ultracold atomic mixtures