Related papers: Fast binomial-code holonomic quantum computation w…
We show how to realize, by means of non-abelian quantum holonomies, a set of universal quantum gates acting on decoherence-free subspaces and subsystems. In this manner we bring together the quantum coherence stabilization virtues of…
Quantum computers require error correction to achieve universal quantum computing. However, current decoding of quantum error-correcting codes relies on classical computation, which is slower than quantum operations in superconducting…
By using transitionless quantum driving algorithm (TQDA), we present an efficient scheme for the shortcuts to the holonomic quantum computation (HQC). It works in decoherence-free subspace (DFS) and the adiabatic process can be speeded up…
Bosonic codes represent a promising route toward quantum error correction in continuous-variable systems, with direct relevance to experimental platforms such as circuit QED and optomechanics. However, their preparation and stabilization…
In the context of Rydberg anti-blockade, this paper proposes a new scheme for a high-fidelity controlled-unitary gate based on non-adiabatic holonomic quantum computation. Under specific detuning and interaction conditions, the scheme…
Bosonic cat qubits stabilized by two-photon driven dissipation benefit from exponential suppression of bit-flip errors and an extensive set of gates preserving this protection. These properties make them promising building blocks of a…
We propose a scheme to achieve quantum computation with neutral atoms whose interactions are catalyzed by single photons. Conditional quantum gates, including an $N$-atom Toffoli gate and nonlocal gates on remote atoms, are obtained through…
Hamiltonian moments in Fourier space - expectation values of the unitary evolution operator under a Hamiltonian at different times - provide a convenient framework to understand quantum systems. They offer insights into the energy…
The high-speed implementation and robustness against of non-adiabatic holonomic quantum computation provide a new idea for overcoming the difficulty of quantum system interacting with the environment easily decoherence, which realizing…
Quantum gates, which are the essential building blocks of quantum computers, are very fragile. Thus, to realize robust quantum gates with high fidelity is the ultimate goal of quantum manipulation. Here, we propose a nonadiabatic geometric…
We present a numerical study of the robustness of a specific class of non-abelian holonomic quantum gates . We take into account the parametric noise due to stochastic fluctuations of the control fields which drive the time-dependent…
Quantum error correction protocols have been developed to offset the high sensitivity to noise inherent in quantum systems. However, much is still unknown about the behaviour of a quantum error-correcting code under general noise, including…
Quantum computers are inherently affected by noise. While in the long-term error correction codes will account for noise at the cost of increasing physical qubits, in the near-term the performance of any quantum algorithm should be tested…
Bosonic rotation codes, introduced here, are a broad class of bosonic error-correcting codes based on phase-space rotation symmetry. We present a universal quantum computing scheme applicable to a subset of this class--number-phase…
While 2-level systems, aka qubits, are a natural choice to perform a logical quantum computation, the situation is less clear at the physical level. Encoding information in higher-dimensional physical systems can indeed provide a first…
Scaling up quantum computers to attain substantial speedups over classical computing requires fault tolerance. Conventionally, protocols for fault-tolerant quantum computation demand excessive space overheads by using many physical qubits…
We analyse an implementation of a quantum computer using bosonic atoms in an optical lattice. We show that, even though the number of atoms per site and the tunneling rate between neighbouring sites is unknown, one may perform a universal…
We construct a unified operator framework for quantum holonomies generated from bosonic systems. For a system whose Hamiltonian is bilinear in the creation and annihilation operators, we find a holonomy group determined only by a set of…
Geometric manipulation of a quantum system offers a method for fast, universal, and robust quantum information processing. Here, we propose a scheme for universal all-geometric quantum computation using non-adiabatic quantum holonomies. We…
We propose a feasible scheme to achieve holonomic quantum computation in a decoherence-free subspace (DFS) with trapped ions. By the application of appropriate bichromatic laser fields on the designated ions, we are able to construct two…