English
Related papers

Related papers: Almost-Optimal Computational Basis State Transposi…

200 papers

Solid state superconducting devices coupled to coplanar transmission lines offer an exquisite architecture for quantum optical phenomena probing as well as for quantum computation implementation, being the object of intense theoretical and…

Quantum Physics · Physics 2014-06-09 O. P. de Sa Neto , M. C. de Oliveira

We give a careful proof that a parallelized version of adiabatic quantum computation can efficiently simulate universal gate model quantum computation. The proof specifies an explicit parameter-dependent Hamiltonian $H({\lambda})$ that is…

Quantum Physics · Physics 2019-02-20 Ari Mizel

The scheme for probabilistic teleportation of an N-particle state of general form is proposed. As the special cases we construct efficient quantum logic networks for implementing probabilistic teleportation of a two-particle state, a…

Quantum Physics · Physics 2007-05-23 Ting Gao , Feng-Li Yan , Zhi-Xi Wang

In this paper we explore the possibility of fundamental tests for coherent state optical quantum computing gates [T. C. Ralph, et. al, Phys. Rev. A \textbf{68}, 042319 (2003)] using sophisticated but not unrealistic quantum states. The…

Quantum Physics · Physics 2009-11-10 A. P. Lund , T. C. Ralph

With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability $p$. The…

Quantum Physics · Physics 2009-11-11 L. -M. Duan , R. Raussendorf

The speed of elementary quantum gates, particularly two-qubit gates, ultimately sets the limit on the speed at which quantum circuits can operate. In this work, we experimentally demonstrate commonly used two-qubit gates at nearly the…

The Clifford hierarchy is a nested sequence of sets of quantum gates critical to achieving fault-tolerant quantum computation. Diagonal gates of the Clifford hierarchy and 'nearly diagonal' semi-Clifford gates are particularly important:…

Quantum Physics · Physics 2021-09-15 Nadish de Silva

We propose an effective set of elementary quantum gates which provide an encoded universality and demonstrate the physical feasibility of these gates for the solid-state quantum computer based on the multi-atomic systems in the QED cavity.…

Quantum Physics · Physics 2011-09-05 Farid Ablayev , Sergey Andrianov , Sergey Moiseev , Alexander Vasiliev

We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values $(x,y)$ to $(x,x \oplus y)$) is universal in the sense that all unitary operations on arbitrarily many…

We study quantum information processing using superpositions of Fock states in superconducting resonators, as quantum $d$-level systems (qudits). A universal set of single and coupled logic gates is theoretically proposed for resonators…

Quantum Physics · Physics 2015-05-30 Frederick W. Strauch

The paper discusses the gate complexity of reversible circuits with the small number of additional inputs consisting of NOT, CNOT and 2-CNOT gates. We study Shannon's gate complexity function $L(n, q)$ for a reversible circuit implementing…

Computational Complexity · Computer Science 2018-02-08 Dmitry V. Zakablukov

Quantum compiling addresses the problem of approximating an arbitrary quantum gate with a string of gates drawn from a particular finite set. It has been shown that this is possible for almost all choices of base sets and furthermore that…

Quantum Physics · Physics 2009-11-07 Aram W. Harrow , Benjamin Recht , Isaac L. Chuang

We propose an effective realization of a complete set of elementary quantum gates in the solid-state quantum computer based on the multi-atomic coherent (MAC-) ensembles in the QED cavity. Here, we use the two-ensemble qubit encoding and…

Quantum Physics · Physics 2011-11-15 Farid Ablayev , Sergey N. Andrianov , Alexander Vasiliev , Sergey A. Moiseev

We demonstrate machine learning assisted design of a two-qubit gate in a Rydberg tweezer system. Two low-energy hyperfine states in each of the atoms represent the logical qubit and a Rydberg state acts as an auxiliary state to induce qubit…

We introduce transformation matrix connecting sets of the displaced states with different displacement amplitudes. Arbitrary pure one-mode state can be represented in new basis of the displaced number (Fock) states ( representation) by…

Quantum Physics · Physics 2016-04-04 Sergey A. Podoshvedov

We consider a quantum gate, driven by a general time-dependent Hamiltonian, that complements the state of a qubit and then adds to it an arbitrary phase shift. It is shown that the minimum operation time of the gate is tau = (h/4E)(1+2…

Quantum Physics · Physics 2007-05-23 Lev B. Levitin , Tommaso Toffoli , Zachary Walton

Quantum computation using electron spins in three coupled dot with different size is proposed. By using the energy selectivity of both photon assisted tunneling and spin rotation of electrons, logic gates are realized by static and…

Quantum Physics · Physics 2007-05-23 H. Sasakura , S. Muto

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…

Quantum Physics · Physics 2010-06-11 Alexander Yu. Vlasov

We present a full quantum treatment of a five-level atomic system coupled to two quantum and two classical light fields. The two quantum fields undergo a cross-phase modulation induced by electro-magnetically induced transparency. The…

Quantum Physics · Physics 2007-05-23 C. Ottaviani , S. Rebic , D. Vitali , P. Tombesi

Computations with a future quantum computer will be implemented through the operations by elementary quantum gates. It is now well known that the collection of 1-bit and 2-bit quantum gates are universal for quantum computation, i.e., any…

Quantum Physics · Physics 2007-05-23 G. Chen , D. A. Church , B. -G. Englert , M. S. Zubairy