相关论文: Universal quantum processors with arbitrary radix …

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…

We show, within the circuit model, how any quantum computation can be efficiently performed using states with only real amplitudes (a result known within the Quantum Turing Machine model). This allows us to identify a 2-qubit (in fact…

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…

We consider continuous structures which are obtained from finite dimensional Hilbert spaces over $\mathbb{C}$ by adding some unitary operators. Quantum automata and quantum circuits are naturally interpretable in such structures. We…

A quantum theory in a finite-dimensional Hilbert space can be geometrically formulated as a proper Hamiltonian theory as explained in [2, 3, 7, 8]. From this point of view a quantum system can be described in a classical-like framework…

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,…

The characterization of quantum processes is a key tool in quantum information processing tasks for several reasons: on one hand, it allows to acknowledge errors in the implementations of quantum algorithms; on the other, it allows to…

What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? We provide an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling n-qubit…

We investigate how to carry out universal quantum computation deterministically with free electrons in decoherence-free subspace by using polarizing beam splitters, charge detectors, and single-spin rotations. Quantum information in our…

We present two universal models of quantum computation with a time-independent, frustration-free Hamiltonian. The first construction uses 3-local (qubit) projectors, and the second one requires only 2-local qubit-qutrit projectors. We build…

An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…

In this paper is presented an abstract theory of quantum processors and controllers, special kind of quantum computational network defined on a composite quantum system with two parts: the controlling and controlled subsystems. Such…

We define and construct efficient depth-universal and almost-size-universal quantum circuits. Such circuits can be viewed as general-purpose simulators for central classes of quantum circuits and can be used to capture the computational…

Most modern classical processors support so-called von Neumann architecture with program and data registers. In present work is revisited similar approach to models of quantum processors. Deterministic programmable quantum gate arrays are…

We discuss the dynamical quantum systems which turn out to be bi-unitary with respect to the same alternative Hermitian structures in a infinite-dimensional complex Hilbert space. We give a necessary and sufficient condition so that the…

We describe criteria for implementation of quantum computation in qudits. A qudit is a d-dimensional system whose Hilbert space is spanned by states |0>, |1>,... |d-1>. An important earlier work of Mathukrishnan and Stroud [1] describes how…

We discuss the problem of designing unambiguous programmable discriminators for any $n$ unknown quantum states in an $m$-dimensional Hilbert space. The discriminator is a fixed measurement which has two kinds of input registers: the program…

Quantum simulation is a promising near term application for mesoscale quantum information processors, with the potential to solve computationally intractable problems at the scale of just a few dozen interacting quantum systems. Recent…

We propose to represent both $n$--qubits and quantum gates acting on them as elements in the complex Clifford algebra defined on a complex vector space of dimension $2n.$ In this framework, the Dirac formalism can be realized in…

We propose a model of a programmable quantum processing device realizable with existing nanophotonic technologies and which can be viewed as a basis for new high performance hardware architectures. We present protocols and their physical…