Pith. sign in

REVIEW

Rolling quantum dice with a superconducting qubit

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1406.3364 v1 pith:RNBAAHZP submitted 2014-06-12 quant-ph cond-mat.mes-hallcond-mat.supr-con

classification quant-phcond-mat.mes-hallcond-mat.supr-con
keywords quantumgateserrorhighrealizedstateaccuracyalgorithms
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Sign in to comment.

Pith tools