Related papers: Holonomic quantum computation in decoherence-free …
Quantum Fourier transform is of primary importance in many quantum algorithms. In order to eliminate the destructive effects of decoherence induced by couplings between the quantum system and its environment, we propose a robust scheme for…
Nonadiabatic holonomic quantum computation (NHQC) leverages non-Abelian geometric phases within a nonadiabatic framework to achieve fast and robust quantum gate operations. However, the practical implementation of NHQC is challenged by the…
Because of using geometric phases, nonadiabatic geometric gates have the robustness against control errors. On the other hand, decoherence still affects nonadiabatic geometric gates, which is a key factor in reducing their fidelities. In…
In this thesis we provide a uniform treatment of two non-adiabatic geometric phases for dynamical systems of mixed quantum states, namely those of Uhlmann and of Sj\"{o}qvist et al. We develop a holonomy theory for the latter which we also…
If suitable quantum optical interactions were available, transforming optical field mode operators in a nonlinear fashion, the all-photonics platform could be one of the strongest contenders for realizing a quantum computer. Unlike other,…
The surface code is currently the primary proposed method for performing quantum error correction. However, despite its many advantages, it has no native method to fault-tolerantly apply non-Clifford gates. Additional techniques are…
One of the most challenging problems for the realization of a scalable quantum computer is to design a physical device that keeps the error rate for each quantum processing operation low. These errors can originate from the accuracy of…
A large-scalable quantum computer model, whose qubits are represented by the subspace subtended by the ground state and the single exciton state on semiconductor quantum dots, is proposed. A universal set of quantum gates in this system may…
We analyze the possibility and efficiency of non-holonomic control over quantum devices with exponentially large number of Hilbert space dimensions. We show that completely controllable devices of this type can be assembled from elementary…
We propose an encoding for topological quantum computation utilizing quantum representations of mapping class groups. Leakage into a non-computational subspace seems to be unavoidable for universality in general. We are interested in the…
Non-adiabatic holonomic quantum computation has received increasing attention due to its robustness against control errors. However, all the previous schemes have to use at least two sequentially implemented gates to realize a general…
We investigate how to concatenate different decoherence-free subspaces (DFSs) to realize scalable universal fault-tolerant quantum computation. Based on tunable $XXZ$ interactions, we present an architecture for scalable quantum computers…
We revisit the question of universality in quantum computing and propose a new paradigm. Instead of forcing a physical system to enact a predetermined set of universal gates (e.g., single-qubit operations and CNOT), we focus on the…
We propose a novel symmetrization procedure to beat decoherence for oscillator-assisted quantum gate operations. The enacted symmetry is related to the global geometric features of qubits transformation based on ancillary oscillator modes,…
An efficient and intuitive framework for universal quantum computation is presented that uses pairs of spin-1/2 particles to form logical qubits and a single physical interaction, Heisenberg exchange, to produce all gate operations. Only…
The physical resources available to access and manipulate the degrees of freedom of a quantum system define the set $\cal A$ of operationally relevant observables. The algebraic structure of $\cal A$ selects a preferred tensor product…
Quantum error avoiding codes are constructed by exploiting a geometric interpretation of the algebra of measurements of an open quantum system. The notion of a generalized Dirac operator is introduced and used to naturally construct…
The advancement of information processing into the realm of quantum mechanics promises a transcendence in computational power that will enable problems to be solved which are completely beyond the known abilities of any "classical"…
The stabilizing properties of one-error correcting jump codes are explored under realistic non-ideal conditions. For this purpose the quantum algorithm of the tent-map is decomposed into a universal set of Hamiltonian quantum gates which…
We show how it is possible to realize quantum computations on a system in which most of the parameters are practically unknown. We illustrate our results with a novel implementation of a quantum computer by means of bosonic atoms in an…