Non-Adiabatic Holonomic Quantum Computation in Decoherence-Free Subspaces

TL;DR

This paper presents a method for non-adiabatic holonomic quantum computation within decoherence-free subspaces, enabling faster and robust quantum gate operations using only three qubits per logical qubit.

Contribution

It introduces a novel approach to non-adiabatic holonomic quantum computation in decoherence-free subspaces, avoiding long run-times and maintaining robustness.

Findings

Achieved universal quantum gates with three qubits per logical qubit.

Demonstrated non-adiabatic holonomic quantum computation in decoherence-free subspaces.

Provided a practical scheme for faster, robust quantum computation.

Abstract

Quantum computation that combines the coherence stabilization virtues of decoherence-free subspaces and the fault tolerance of geometric holonomic control is of great practical importance. Some schemes of adiabatic holonomic quantum computation in decoherence-free subspaces have been proposed in the past few years. However, non-adiabatic holonomic quantum computation in decoherence-free subspaces, which avoids long run-time requirement but with all the robust advantages, remains an open problem. Here, we demonstrate how to realize non-adiabatic holonomic quantum computation in decoherence-free subspaces. By using only three neighboring physical qubits undergoing collective dephasing to encode one logical qubit, we realize a universal set of quantum gates.