Rolling quantum dice with a superconducting qubit

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.

8 pages, 4 figures, including supplementary material

References in corpus (6)

• Robust randomized benchmarking of quantum processes
• High-fidelity preparation, gates, memory and readout of a trapped-ion quantum bit
• Evenly distributed unitaries: on the structure of unitary designs
• Process verification of two-qubit quantum gates by randomized benchmarking
• Unitary designs and codes
• Randomized benchmarking of single and multi-qubit control in liquid-state NMR quantum information processing

Cited by in corpus (2)

• Digital quantum simulation of fermionic models with a superconducting circuit
• Direct digital synthesis of microwave waveforms for quantum computing