Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 71 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 18 tok/s Pro
GPT-5 High 15 tok/s Pro
GPT-4o 101 tok/s Pro
Kimi K2 196 tok/s Pro
GPT OSS 120B 467 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Robust Nonadiabatic Holonomic Quantum Gates on Decoherence-Protected Qubits (2110.02812v1)

Published 6 Oct 2021 in quant-ph and cond-mat.supr-con

Abstract: Obtaining high-fidelity and robust quantum gates is the key for scalable quantum computation, and one of the promising ways is to implement quantum gates using geometric phases, where the influence of local noises can be greatly reduced. To obtain robust quantum gates, we here propose a scheme for quantum manipulation by combining the geometric phase approach with the dynamical correction technique, where the imperfection control induced X-error can be greatly suppressed. Moreover, to be robust against the decoherence effect and the randomized qubit-frequency shift Z-error, our scheme is also proposed based on the polariton qubit, the eigenstates of the light-matter interaction, which is immune to both errors up to the second order, due to its near symmetric energy spectrum. Finally, our scheme is implemented on the superconducting circuits, which also simplifies previous implementations. Since the main errors can be greatly reduced in our proposal, it provides a promising strategy for scalable solid-state fault-tolerant quantum computation.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.