相关论文: ALEPH-QP: Universal hybrid quantum processors
Quantum computation has attracted much attention, among other things, due to its potentialities to solve classical NP problems in polynomial time. For this reason, there has been a growing interest to build a quantum computer. One of the…
In this work, we develop a novel mathematical framework for universal digital quantum computation using algebraic probability theory. We rigorously define quantum circuits as finite sequences of elementary quantum gates and establish their…
A possibility of performing the C-NOT gate operation at the ground and the first excited states of two harmonic oscillators interacting via a two-level system subject to complete control is demonstrated. The system resembles Turing machine,…
Quantized integrable systems can be made to perform universal quantum computation by the application of a global time-varying control. The action-angle variables of the integrable system function as qubits or qudits, which can be coupled…
In the first part of the work, the equivalence of quantum deterministic and probabilistic processors was investigated. A programmable quantum processor is a device able to transform input data states in a desired way. Deterministic…
Here is discussed the Hamiltonian approach to construction of deterministic universal (in approximate sense) programmable quantum circuits with qubits or any other quantum systems with dimension of Hilbert space is $n \ge 2$.
We propose a scalable scheme for optical quantum computing using measurement-induced continuous-variable quantum gates in a loop-based architecture. Here, time-bin-encoded quantum information in a single spatial mode is deterministically…
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…
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 `register' in quantum information processing -- is composition of k quantum systems, `qudits'. The dimensions of Hilbert spaces for one qudit and whole quantum register are d and d^k respectively, but we should have possibility to prepare…
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.…
Quantum computing offers advantages over classical computation, yet the precise features that set the two apart remain unclear. In the standard quantum circuit model, adding a 1-qubit basis-changing gate -- commonly chosen to be the…
An universal quantum network which can implement a general quantum computing is proposed. In this sense, it can be called the quantum central processing unit (QCPU). For a given quantum computing, its realization of QCPU is just its quantum…
Quantum programs today are written at a low level of abstraction - quantum circuits akin to assembly languages - and the unitary parts of even advanced quantum programming languages essentially function as circuit description languages.…
Operating quantum sensors and quantum computers would make data in the form of quantum states available for purely quantum processing, opening new avenues for studying physical processes and certifying quantum technologies. In this…
We present some deterministic schemes to construct universal quantum gates, that is, controlled- NOT, three-qubit Toffoli, and Fredkin gates, between flying photon qubits and stationary electron-spin qubits assisted by quantum dots inside…
We show that in quantum computation almost every gate that operates on two or more bits is a universal gate. We discuss various physical considerations bearing on the proper definition of universality for computational components such as…
A universal set of gates for (classical or quantum) computation is a set of gates that can be used to approximate any other operation. It is well known that a universal set for classical computation augmented with the Hadamard gate results…
We analyze and compare the optimality of approximate and probabilistic universal programmable quantum processors. We define several characteristics how to quantify the optimality and we study in detail performance of three types of…
We present an explicit construction of a relativistic quantum computing architecture using a variational quantum circuit approach that is shown to allow for universal quantum computing. The variational quantum circuit consists of tunable…