Pith. sign in

REVIEW

Robust and Fast Holonomic Quantum Gates with Encoding on Superconducting Circuits

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 2004.11132 v1 pith:OSGAQKVG submitted 2020-04-23 quant-ph

classification quant-ph
keywords quantumcircuitserrorgatesrobustsuperconductingcausedcomputation
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

High-fidelity and robust quantum manipulation is the key for scalable quantum computation. Therefore, due to the intrinsic operational robustness, quantum manipulation induced by geometric phases is one of the promising candidates. However, the longer gate time for geometric operations and more physical-implementation difficulties hinder its practical and wide applications. Here, we propose a simplified implementation of universal holonomic quantum gates on superconducting circuits with experimentally demonstrated techniques, which can remove the two main challenges by introducing the time-optimal control into the construction of quantum gates. Remarkably, our scheme is also based on a decoherence-free subspace encoding, with minimal physical qubit resource, which can further immune to error caused by qubit-frequency drift, which is regarded as the main error source for large scale superconducting circuits. Meanwhile, we deliberately design the quantum evolution to eliminate gate error caused by unwanted leakage sources. Therefore, our scheme is more robust than the conventional ones, and thus provides a promising alternative strategy for scalable fault-tolerant quantum computation.

Discussion (0). Continue with ORCID to comment.

Pith tools