相关论文: Simplified implementation of the quantum Fourier t…

Using the circulant symmetry of a Hamiltonian describing three qubits, we realize the quantum Fourier transform. This symmetry allows us to construct a set of eigenvectors independently on the magnitude of physical parameters involved in…

We propose a method for the realization of the two-qubit quantum Fourier transform (QFT) using a Hamiltonian which possesses the circulant symmetry. Importantly, the eigenvectors of the circulant matrices are the Fourier modes and do not…

Simulation of quantum systems is notoriously challenging for classical computers, while quantum hardware is naturally well-suited for this task. However, the imperfections of contemporary quantum systems poses a considerable challenge in…

We propose an implementation of the quantum fast Fourier transform algorithm in an entangled system of multilevel atoms. The Fourier transform occurs naturally in the unitary time evolution of energy eigenstates and is used to define an…

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…

We discuss a simple architecture for a quantum Toffoli gate implemented using three trapped ions. The gate, which in principle can be implemented with a single laser-induced operation, is effective under rather general conditions and is…

A quantum simulator is a well controlled quantum system that can simulate the behavior of another quantum system which may require exponentially large classical computing resources to understand otherwise. In the 1980s, Feynman proposed the…

We demonstrate the relation between a global phase of the quantum gate and the layout of energy levels of its effective Hamiltonian required for implementing the gate for minimum time. By an example of the quantum Fourier transform gate for…

We propose a method to achieve scalable quantum computation based on fast quantum gates on an array of trapped ions, without the requirement of ion shuttling. Conditional quantum gates are obtained for any neighboring ions through…

Inverse engineering of Hamiltonian (IEH) from an evolution operator is a useful technique for protocol of quantum control with potential applications in quantum information processing. In this paper we introduce a particular protocol to…

We demonstrate a method of exploring the quantum critical point of the Ising universality class using unitary maps that have recently been demonstrated in ion trap quantum gates. We reverse the idea with which Feynman conceived quantum…

In this work we propose an approach for implementing time-evolution of a quantum system using product formulas. The quantum algorithms we develop have provably better scaling (in terms of gate complexity and circuit depth) than a naive…

In this paper we develop a unified framework to study the coherent control of trapped ions subject to state-dependent forces. Taking different limits in our theory, we can reproduce two different designs of a two-qubit quantum gate --the…

The prevalent approach to executing quantum algorithms on quantum computers is to break-down the algorithms to a concatenation of universal gates, typically single and two-qubit gates. However such a decomposition results in long gate…

We develop a method to synthesize a class of entangling multi-qubit gates for a quantum computing platform with fixed Ising-type interaction with all-to-all connectivity. The only requirement on the flexibility of the interaction is that it…

We propose a technique for design of quantum Fourier transforms, and ensuing quantum algorithms, in a single interaction step by engineered Hamiltonians of circulant symmetry. The method uses adiabatic evolution and is robust against…

Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. Synthesizing the corresponding quantum circuit is typically done by breaking the evolution into small time steps, also known as…

We present an ion-lattice quantum processor based on a two-dimensional arrangement of linear surface traps. Our design features a tunable coupling between ions in adjacent lattice sites and a configurable ion-lattice connectivity, allowing…

The quantum permutation algorithm provides computational speed-up over classical algorithms in determining the parity of a given cyclic permutation. For its $n$-qubit implementations, the number of required quantum gates scales…

We investigate theoretically the speed limit of quantum gate operations for ion trap quantum information processors. The proposed methods use laser pulses for quantum gates which entangle the electronic and vibrational degrees of freedom of…