Related papers: Quantum computation with scattering matrices
The discovery of an algorithm for factoring which runs in polynomial time on a quantum computer has given rise to a concerted effort to understand the principles, advantages, and limitations of quantum computing. At the same time, many…
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…
In this paper we will demonstrate the use of Feynman Diagrams for one dimensional scattering in quantum mechanics. We will evaluate the S-Matrix explicitly for the Dirac delta and finite wall potentials by summing the full series of Feynman…
We study one of multidimensional inverse scattering problems for quantum systems in a constant electric field, by utilization of the Enss-Weder time-dependent method. The main purpose of this paper is to propose some methods of sharpening…
The role of permutation gates for universal quantum computing is investigated. The \lq magic' of computation is clarified in the permutation gates, their eigenstates, the Wootters discrete Wigner function and state-dependent contextuality…
Quantum computation offers exciting new possibilities for statistics. This paper explores the use of the D-Wave machine, a specialized type of quantum computer, which performs quantum annealing. A general description of quantum annealing…
Quantum walk has been regarded as a primitive to universal quantum computation. By using the operations required to describe the single particle discrete-time quantum walk on a position space we demonstrate the realization of the universal…
We show that a universal set of gates for quantum computation with optics can be quantum teleported through the use of EPR entangled states, homodyne detection, and linear optics and squeezing operations conditioned on measurement outcomes.…
Quantum gates, that play a fundamental role in quantum computation and other quantum information processes, are unitary evolution operators $\hat U$ that act on a composite system changing its entanglement. In the present contribution we…
This is an exposition of some basic mathematical aspects of quantum logic gates. At first we established some general formulas for the case of arbitrary quantum gate A with unique restriction A^2=I. The explicit form of the generators and…
We apply quantum integration to elementary particle-physics processes. In particular, we look at scattering processes such as ${\rm e}^+{\rm e}^- \to q \bar q$ and ${\rm e}^+{\rm e}^- \to q \bar q' {\rm W}$. The corresponding probability…
We present an exact solution to the one-dimensional (1-D) scattering-from-a-barrier problem for an incident neutron described by a wave packet. As an aid to presenting our approach, we spend some time on a basic review of how wave packets…
There are various gate sets that can be used to describe a quantum computation. A particularly popular gate set in the literature on quantum computing consists of arbitrary single-qubit gates and 2-qubit CNOT gates. A CNOT gate is however…
Continuous-time quantum walk is one of the alternative approaches to quantum computation, where a universal set of quantum gates can be achieved by scattering a quantum walker on some specially-designed structures embedded in a sparse graph…
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…
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…
Most quantum computer realizations require the ability to apply local fields and tune the couplings between qubits, in order to realize single bit and two bit gates which are necessary for universal quantum computation. We present a scheme…
We present a method to create a variety of interesting gates by teleporting quantum bits through special entangled states. This allows, for instance, the construction of a quantum computer based on just single qubit operations, Bell…
We study a linear array of coupled cavities interacting with two level systems and show how to construct individually addressable qubits in this system from the long-lived atom-photon excitations (polaritons) at each site. We derive the…
We present a possible candidate of construction of a scalable, uniform and universal quantum network, which is built from quantum gates to elements of quantum circuit, again to quantum subnetworks and finally to an entire quantum network.…