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 47 tok/s
Gemini 2.5 Pro 37 tok/s Pro
GPT-5 Medium 15 tok/s Pro
GPT-5 High 11 tok/s Pro
GPT-4o 101 tok/s Pro
Kimi K2 195 tok/s Pro
GPT OSS 120B 465 tok/s Pro
Claude Sonnet 4 30 tok/s Pro
2000 character limit reached

Nonadiabatic geometric quantum computation in decoherence-free subspaces based on unconventional geometric phases (1612.08466v1)

Published 27 Dec 2016 in quant-ph

Abstract: Nonadiabatic geometric quantum computation in decoherence-free subspaces has received increasing attention due to the merits of its high-speed implementation and robustness against both control errors and decoherence. However, all the previous schemes in this direction have been based on the conventional geometric phases, of which the dynamical phases need to be removed. In this paper, we put forward a scheme of nonadiabatic geometric quantum computation in decoherence-free subspaces based on unconventional geometric phases, of which the dynamical phases do not need to be removed. Specifically, by using three physical qubits undergoing collective dephasing to encode one logical qubit, we realize a universal set of geometric gates nonadiabatically and unconventionally. Our scheme not only maintains all the merits of nonadiabatic geometric quantum computation in decoherence-free subspaces, but also avoids the additional operations required in the conventional schemes to cancel the dynamical phases.

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.