The HLRB Cluster as Quantum CISC Compiler

The project encompasses matrix method developments, tailored parallelization as well as cutting-edge applications exploiting the power of the hlrb-ii cluster: fast matrix exponential algorithms using Chebyshev series are devised in view of calculating quantum dynamics of large systems. They outperform the standard Padé-approximation by a speed-up of approximately 30% in cpu time while obtaining even better accuracy. The routines are incorporated into a fully parallelized package of gradient-flow algorithms for optimal quantum control. As an application, here we present a quantum cisc compiler: it breaks large target unitary gates into modules of effective m-qubit (i.e. two-level system) interactions. We extend the standard restricted set of modules with m=1,2 (risc) to a scalable toolbox of multi-qubit optimal controls with m≤10 forming modules of complex instruction sets (cisc). Typically, the instruction code (‘experimental controls’) by our quantum cisc compiler is some three to ten times faster than by risc compilation thus dramatically saving the essential quantum coherences from unnecessary relaxative decay with time. This advantage of our method over standard universal gates is demonstrated for the indirect swap gate, the quantum Fourier transform as well as for multiply-controlled not gates.