相关论文: Exact gate-sequences for universal quantum computa…

We propose a method for decomposing continuous-variable operations into a universal gate set, without the use of any approximations. We fully characterize a set of transformations admitting exact decompositions and describe a process for…

Scalable quantum computation in realistic devices requires that precise control can be implemented efficiently in the presence of decoherence and operational errors. We propose a general constructive procedure for designing robust unitary…

We propose a feasible scheme to achieve quantum computation based on geometric manipulation of ensembles of atoms, and analyze it for neutral rubidium atoms magnetically trapped in planoconcave microcavities on an atom chip. The geometric…

High-fidelity quantum gates are essential for large-scale quantum computation, which can naturally be realized in a noise-resilient way. Geometric manipulation and decoherence-free subspace encoding are promising ways toward robust quantum…

Universal computation of a quantum system consisting of superpositions of well-separated coherent states of multiple harmonic oscillators can be achieved by three families of adiabatic holonomic gates. The first gate consists of moving a…

Quantum algorithms profit from the interference of quantum states in an exponentially large Hilbert space and the fact that unitary transformations on that Hilbert space can be broken down to universal gates that act only on one or two…

The quantum circuit model allows gates between any pair of qubits yet physical instantiations allow only limited interactions. We address this problem by providing an interaction graph together with an efficient method for compiling quantum…

Quantum processors which combine the long decoherence times of spin qubits together with fast optical manipulation of excitons have recently been the subject of several proposals. I show here that arbitrary single- and entangling two-qubit…

We propose a hybrid quantum computing scheme where qubit degrees of freedom for computation are combined with quantum continuous variables for communication. In particular, universal two-qubit gates can be implemented deterministically…

To bring the quantum computing capacities to the personal edge devices, the optimum approach is to have simple non-error corrected personal devices that offload the computational tasks to scalable quantum computers via edge servers with…

In order to demonstrate non-trivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to understand how to decompose a desired quantum computation into the shortest possible sequence…

While all quantum algorithms can be expressed in terms of single-qubit and two-qubit gates, more expressive gate sets can help reduce the algorithmic depth. This is important in the presence of gate errors, especially those due to…

We investigate the characteristics of purely electrostatic interactions with external gates in constructing full single qubit manipulations. The quantum bit is naturally encoded in the spatial wave function of the electron system.…

There is currently a tremendous interest in developing practical applications of NISQ processors without the overhead required by full error correction. Quantum information processing is especially challenging within the gate model, as…

Geometric phase that manifests itself in number of optic and nuclear experiments is shown to be a useful tool for realization of quantum computations in so called holonomic quantum computer model (HQCM). This model is considered as an…

The use of multilevel information carriers, also known as qudits, is a promising path for exploring scalability of quantum computing devices. Here we present a proof-of-principle realization of a quantum processor register that uses…

We consider a generic elementary gate sequence which is needed to implement a general quantum gate acting on n qubits -- a unitary transformation with 4^n degrees of freedom. For synthesizing the gate sequence, a method based on the…

A key requirement to perform simulations of large quantum systems on near-term quantum hardware is the design of quantum algorithms with short circuit depth that finish within the available coherence time. A way to stay within the limits of…

We propose a new class of unconventional geometric gates involving nonzero dynamic phases, and elucidate that geometric quantum computation can be implemented by using these gates. Comparing with the conventional geometric gate operation,…

The power of a quantum circuit is determined through the number of two-qubit entangling gates that can be performed within the coherence time of the system. In the absence of parallel quantum gate operations, this would make the quantum…