Rolling quantum dice with a superconducting qubit

TL;DR

This paper demonstrates that using Platonic solids enables high-precision implementation and characterization of larger quantum gate sets, advancing the control of quantum states for quantum computing.

Contribution

It introduces a novel approach using Platonic solids to implement and characterize larger quantum gate sets with low error, surpassing previous Clifford-only methods.

Findings

All gates tested can be implemented with low error.

The method allows arbitrary quantum state manipulation with high precision.

Potential for improved quantum algorithm design.

Abstract

One of the key challenges in quantum information is coherently manipulating the quantum state. However, it is an outstanding question whether control can be realized with low error. Only gates from the Clifford group -- containing $\pi$, $\pi/2$, and Hadamard gates -- have been characterized with high accuracy. Here, we show how the Platonic solids enable implementing and characterizing larger gate sets. We find that all gates can be implemented with low error. The results fundamentally imply arbitrary manipulation of the quantum state can be realized with high precision, providing new practical possibilities for designing efficient quantum algorithms.