Related papers: Realization of Arbitrary Gates in Holonomic Quantu…

In a previous publication [1] we showed that it is possible to implement universal quantum computation with the anisotropic XY-Heisenberg exchange acting as a single interaction. To achieve this we used encodings of the states of the…

Geometric phase is a promising element to induce high-fidelity and robust quantum operations due to its built-in noise-resilience feature. Unfortunately, its practical applications are usually circumscribed by requiring complex interactions…

A quantum unitary gate is realized in this paper by perturbing a free charged particle in a one-dimensional box with a time- and position-varying electric field. The perturbed Hamiltonian is composed of a free particle Hamiltonian plus a…

Quantum logic decomposition refers to decomposing a given quantum gate to a set of physically implementable gates. An approach has been presented to decompose arbitrary diagonal quantum gates to a set of multiplexed-rotation gates around z…

We explore the implementation of hybridly protected quantum operations combining the merits of holonomy, dynamical decoupling approach and dephasing-free feature based on a simple and experimentally achievable spin model. The implementation…

One of the key challenges in quantum information is coherently manipulating the quantum state. However, it is an outstanding question whether control can be realized with low error. Only gates from the Clifford group -- containing $\pi$,…

Quantum circuits currently constitute a dominant model for quantum computation. Our work addresses the problem of constructing quantum circuits to implement an arbitrary given quantum computation, in the special case of two qubits. We…

We give quantum circuits that simulate an arbitrary two-qubit unitary operator up to global phase. For several quantum gate libraries we prove that gate counts are optimal in worst and average cases. Our lower and upper bounds compare…

We consider how the Hamiltonian Quantum Computing scheme introduced in [arXiv:1509.01278] can be implemented using a 2D array of superconducting transmon qubits. We show how the scheme requires the engineering of strong attractive…

We demonstrate a quadratic phase gate for one-way quantum computation in the continuous-variable regime. This canonical gate, together with phase-space displacements and Fourier rotations, completes the set of universal gates for realizing…

We study in detail the algebraic structures underlying quantum circuits generated by CNOT gates. Our results allow us to propose polynomial-time heuristics to reduce the number of gates used in a given CNOT circuit and we also give…

Systems of linear equations are used to model a wide array of problems in all fields of science and engineering. Recently, it has been shown that quantum computers could solve linear systems exponentially faster than classical computers,…

The hybrid approach to quantum computation simultaneously utilizes both discrete and continuous variables which offers the advantage of higher density encoding and processing powers for the same physical resources. Trapped ions, with…

A practical quantum computer must be capable of performing high fidelity quantum gates on a set of quantum bits (qubits). In the presence of noise, the realization of such gates poses daunting challenges. Geometric phases, which possess…

Universal quantum computation may be realized based on quantum walk, by formulating it as a scattering problem on a graph. In this paper, we simulate quantum gates through electric circuits, following a recent report that a one-dimensional…

Given a quantum algorithm, it is highly nontrivial to devise an efficient sequence of physical gates implementing the algorithm on real hardware and incorporating topological quantum error correction. In this paper, we present a first step…

We argue that the analog nature of quantum computing makes the usual design approach of constructing complicated logical operations from many simple gates inappropriate. Instead, we propose to design multi-spin quantum gates in which the…

The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the…

Geometric phases accompanying adiabatic processes in quantum systems can be utilized as unitary gates for quantum computation. Optimization of control of the adiabatic process naturally leads to the isoholonomic problem. The isoholonomic…

We discuss and experimentally demonstrate a probabilistic Hadamard gate for coherent state qubits. The scheme is based on linear optical components, non-classical resources and the joint projective action of a photon counter and a homodyne…