Pith. sign in

REVIEW

Nonadiabatic Holonomic Quantum Computation via Path Optimization

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 2205.09288 v2 pith:QZNZNHXD submitted 2022-05-19 quant-ph

Nonadiabatic Holonomic Quantum Computation via Path Optimization

classification quant-ph
keywords nhqcschemequantumcomputationgeometricdifferentevolutiongate
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Nonadiabatic holonomic quantum computation (NHQC) is implemented by fast evolution processes in a geometric way to withstand local noises. However, recent works of implementing NHQC are sensitive to the systematic noise and error. Here, we present a path-optimized NHQC (PONHQC) scheme based on the non-Abelian geometric phase, and find that a geometric gate can be constructed by different evolution paths, which have different responses to systematic noises. Due to the flexibility of the PONHQC scheme, we can choose an optimized path that can lead to excellent gate performance. Numerical simulation shows that our optimized scheme can greatly outperform the conventional NHQC scheme, in terms of both fidelity and robustness of the gates. In addition, we propose to implement our strategy on superconducting quantum circuits with decoherence-free subspace encoding with the experiment-friendly two-body exchange interaction. Therefore, we present a flexible NHQC scheme that is promising for the future robust quantum computation.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.