Related papers: Emulating Quantum Interference with Generalized Is…

Generative models offer a direct way of modeling complex data. Energy-based models attempt to encode the statistical correlations observed in the data at the level of the Boltzmann weight associated with an energy function in the form of a…

Instantaneous quantum polynomial-time (IQP) computation is a class of quantum computation consisting only of commuting two-qubit gates and is not universal in the sense of standard quantum computation. Nevertheless, it has been shown that…

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 show how to fully characterize a quantum process in an open quantum system. We particularize the procedure to the case of a universal two-qubit gate in a quantum computer. We illustrate the method with a numerical simulation of a quantum…

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…

A new method for simulation of a binary homogeneous Markov process using a quantum computer was proposed. This new method allows using the distinguished properties of the quantum mechanical systems -- superposition, entanglement and…

For quantum computation using photons, performing deterministic quantum gate operations is a challenge due to the probabilistic nature of the photon-photon interaction. Encoding qubits in multiple degrees-of-freedom of photons and…

A scheme of universal quantum computation on a chain of qubits is described that does not require local control. All the required operations, an Ising-type interaction and spatially uniform simultaneous one-qubit gates, are…

We show that recent experiments in hybrid qubit-oscillator devices that measure the phase-space characteristic function of the oscillator via the qubit can be seen through the lens of functional calculus and path integrals, drawing a clear…

We propose a new implementation of a universal set of one- and two-qubit gates for quantum computation using the spin states of coupled single-electron quantum dots. Desired operations are effected by the gating of the tunneling barrier…

Richard Feynman's observation that quantum mechanical effects could not be simulated efficiently on a computer led to speculation that computation in general could be done more efficiently if it used quantum effects. This speculation…

Universal set of quantum gates are realized from the conduction-band electron spin qubits of quantum dots embedded in a microcavity via two-channel Raman interaction. All of the gate operations are independent of the cavity mode states,…

This thesis focuses on quantum information processing using the superconducting device, especially, on realizing quantum gates and algorithms in open quantum systems. Such a device is constructed by transmon-type superconducting qubits…

Quantum logic gates must perform properly when operating on their standard input basis states, as well as when operating on complex superpositions of these states. Experiments using superconducting qubits have validated the truth table for…

With gates of a quantum computer designed to encode multi-dimensional vectors, projections of quantum computer states onto specific qubit states can produce kernels of reproducing kernel Hilbert spaces. We show that quantum kernels obtained…

Quantum computer architectures impose restrictions on qubit interactions. We propose efficient circuit transformations that modify a given quantum circuit to fit an architecture, allowing for any initial and final mapping of circuit qubits…

A new model of quantum computation is considered, in which the connections between gates are programmed by the state of a quantum register. This new model of computation is shown to be more powerful than the usual quantum computation, e. g.…

The Grassmann representation for the system of qubits, is considered. The treatment is based on natural description of the qubits system as fermions and uses coherent states of fermions. The quantum logic gates are represented in two forms…

Near-term quantum computers are limited by the decoherence of qubits to only being able to run low-depth quantum circuits with acceptable fidelity. This severely restricts what quantum algorithms can be compiled and implemented on such…

Usually models for quantum computations deal with unitary gates on pure states. In this paper we generalize the usual model. We consider a model of quantum computations in which the state is an operator of density matrix and the gates are…