Rolling quantum dice with a superconducting qubit
classification
🪐 quant-ph
cond-mat.mes-hallcond-mat.supr-con
keywords
quantumgateserrorhighrealizedstateaccuracyalgorithms
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.