Related papers: On the generation of sequential unitary gates from…
We show that quantum theory allows for transformations of black boxes that cannot be realized by inserting the input black boxes within a circuit in a pre-defined causal order. The simplest example of such a transformation is the classical…
This work introduces and characterizes quantum sequential circuits (QSCs) as a hardware-oriented paradigm for quantum computing, built upon a novel foundational element termed the quantum transistor. Unlike conventional qubit-based…
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.…
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.…
Suppose that a quantum circuit with K elementary gates is known for a unitary matrix U, and assume that U^m is a scalar matrix for some positive integer m. We show that a function of U can be realized on a quantum computer with at most…
Proofs are given that the quantum-mechanical description of the LC -circuit with a time dependent external source can be readily established by starting from a more general discretization rule of the electric charge. For this purpose one…
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 general class of discrete unitary models are described whose behavior in the continuum limit corresponds to a many-body Schrodinger equation. On a quantum computer, these models could be used to simulate quantum many-body systems with an…
We construct quantum circuits for solving one-dimensional Schr\"odinger equations. Simulations of three typical examples, i.e., harmonic oscillator, square-well and Coulomb potential, show that reasonable results can be obtained with eight…
Since Deutsch (1985), quantum computers have been modeled exclusively in the language of state vectors and the Schroedinger equation. We present a complementary view of quantum circuits inspired by the path integral formalism of quantum…
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 universal quantum computer is a device capable of simulating any physical system and represents a major goal for the field of quantum information science. Algorithms performed on such a device are predicted to offer significant gains…
When considering a sequent-style proof system for quantum programs, there are certain elements of quantum mechanics that we may wish to capture, such as phase, dynamics of unitary transformations, and measurement probabilities. Traditional…
We have shown that quantum systems on finite-dimensional Hilbert spaces are equivalent under local transformations. Using these transformations give rise to a gauge group that connects the hamiltonian operators associated with each quantum…
A simple construction is presented which allows computing the transition amplitude of a quantum circuit to be encoded as computing the permanent of a matrix which is of size proportional to the number of quantum gates in the circuit. This…
In the last few years, theoretical study of quantum systems serving as computational devices has achieved tremendous progress. We now have strong theoretical evidence that quantum computers, if built, might be used as a dramatically…
Representations of quantum computations are almost always based on a tensor product $\otimes$-structure. This coincides with what we are able to execute in our experiments, as well as what we observe in Nature, but it makes certain familiar…
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…
Exact solutions of time-dependent Schr\"odinger equation in presence of time-dependent potential is defined by point transformation and separation of variables. Energy and Heisenberg uncertainty relation are pursued for time-independent…
Quantum computers allow to solve efficiently certain problems that are intractable for classical computers. For the realization of a quantum computer, a qubit design as the basic building block is a nontrivial starting point. We propose the…