Compiling Quantum Algorithms for Architectures with Multi-qubit Gates (Open Access, Publisher's Version)
Abstract
In recent years, small-scale quantum information processors have been realized in multiple physical architectures. These systems provide a universal set of gates that allow one to implement any given unitary operation. The decomposition of a particular algorithm into a sequence of these available gates is not unique. Thus, the fidelity of the implementation of an algorithm can be increased by choosing an optimized decomposition into available gates. Here, we present a method to find such a decomposition, where a small-scale ion trap quantum information processor is used as an example. We demonstrate a numerical optimization protocol that minimizes the number of required multi-qubit entangling gates by design. Furthermore, we adapt the method for state preparation, and quantum algorithms including in-sequence measurements.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 24, 2016
- Accession Number
- AD1048944
Entities
People
- Daniel Nigg
- Esteban A Martinez
- Philipp Schindler
- Rainer Blatt
- Thomas Monz
Organizations
- University of Innsbruck