English
Related papers

Related papers: Universal quantum gates

200 papers

We study the computation power of lattices composed of two dimensional systems (qubits) on which translationally invariant global two-qubit gates can be performed. We show that if a specific set of 6 global two qubit gates can be performed,…

Quantum Physics · Physics 2014-03-06 G. Ivanyos , S. Massar , A. B. Nagy

We present a probabilistic quantum processor for qudits. The processor itself is represented by a fixed array of gates. The input of the processor consists of two registers. In the program register the set of instructions (program) is…

Quantum Physics · Physics 2009-11-07 Mark Hillery , Vladimir Buzek , Mario Ziman

A set of universal quantum gates is a vital part of the theory of quantum computing, but is absent in the developing theory of Relativistic Quantum Information (RQI). Yet, the Unruh--DeWitt (UDW) detector formalism can be elevated to…

Quantum Physics · Physics 2024-02-16 Eric Aspling , Michael Lawler

In this paper we generalize the usual model of quantum computer to a model in which the state is an operator of density matrix and the gates are general superoperators (quantum operations), not necessarily unitary. A mixed state (operator…

Quantum Physics · Physics 2007-05-23 Vasily E. Tarasov

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

Quantum Physics · Physics 2007-12-20 Ping Dong , Ming Yang , Zhuo-Liang Cao

A universal quantum computing scheme, with a universal set of logical gates, is proposed based on networks of 1D quantum systems. The encoding of information is in terms of universal features of gapped phases, for which effective field…

Quantum Physics · Physics 2019-07-24 Dong-Sheng Wang

A universal set of quantum gates is constructed for the recently developed jump-error correcting quantum codes. These quantum codes are capable of correcting errors arising from the spontaneous decay of distinguishable qubits into…

Quantum Physics · Physics 2007-05-23 G. Alber , M. Mussinger , A. Delgado

We determine the minimal number of qubits that it is necessary to have access to in order to transform Dicke states into other Dicke states. In general, the number of qubits in Dicke states cannot be increased via transformation gates by…

We present a criterion that serves as the basis for a polynomial-time algorithm to decide whether a finite set of qudit gates exponentiated by some Hamiltonians is universal. Our approach formulates universality in Lie algebraic terms and…

Quantum Physics · Physics 2026-04-30 Yinuo Xue , Qian Chen , Jing-Song Huang

Hybrid qubits have recently drawn intensive attention in quantum computing. We here propose a method to implement a universal controlled-phase gate of two hybrid qubits via two three-dimensional (3D) microwave cavities coupled to a…

Quantum Physics · Physics 2019-10-23 Chui-Ping Yang , Zhen-Fei Zheng , Yu Zhang

Quantum gates are the building blocks of quantum circuits, which in turn are the cornerstones of quantum information processing. In this work, we theoretically investigate a single-step implementation of both a universal two- (CNOT) and…

Quantum Physics · Physics 2024-07-01 Luiz O. R. Solak , Daniel Z. Rossatto , Celso J. Villas-Boas

We revisit the question of universality in quantum computing and propose a new paradigm. Instead of forcing a physical system to enact a predetermined set of universal gates (e.g., single-qubit operations and CNOT), we focus on the…

Quantum Physics · Physics 2016-09-08 D. Bacon , J. Kempe , D. P. DiVincenzo , D. A. Lidar , K. B. Whaley

The quantum Fourier transform (QFT) is a powerful tool in quantum computing. The main ingredients of QFT are formed by the Walsh-Hadamard transform H and phase shifts P(.), both of which are 2x2 unitary matrices as operators on the…

Quantum Physics · Physics 2007-05-23 Charles M. Bowden , Goong Chen , Zijian Diao , Andreas Klappenecker

Nielsen [quant-ph/0108020] showed that universal quantum computation is possible given quantum memory and the ability to perform projective measurements on up to 4-qubits. We describe an improved method that requires only 2-qubit…

Quantum Physics · Physics 2007-05-23 D. W. Leung

Simulating physical systems on near-term quantum computers often requires preparing states within constrained subspaces, like those with fixed particle number or spin. We use Lie algebraic techniques to prove that hardware-efficient gates…

Quantum Physics · Physics 2026-05-05 Andreas Stergiou , Nicolas PD Sawaya

Universal gate sets for quantum computation, when single and two qubit operations are accessible, include both Hermitian and non-Hermitian gates. Here we utilize the fact that any single-qubit operator may be implemented as two Hermitian…

Quantum Physics · Physics 2025-12-03 Ben Zindorf , Sougato Bose

We first consider various methods for the indirect implementation of unitary gates. We apply these methods to rederive the universality of 4-qubit measurements based on a scheme much simpler than Nielsen's original construction…

Quantum Physics · Physics 2007-05-23 Debbie W. Leung

Quantum information carriers, just like most physical systems, naturally occupy high-dimensional Hilbert spaces. Instead of restricting them to a two-level subspace, these high-dimensional (qudit) quantum systems are emerging as a powerful…

We provide an analytic way to implement any arbitrary two-qubit unitary operation, given an entangling two-qubit gate together with local gates. This is shown to provide explicit construction of a universal quantum circuit that exactly…

Quantum Physics · Physics 2009-11-07 Jun Zhang , Jiri Vala , Shankar Sastry , K. Birgitta Whaley

This note proves that arbitrary local gates together with any entangling bipartite gate V are universal. Previously this was known only when access to both V and V^{-1} was given, or when approximate universality was demanded.

Quantum Physics · Physics 2009-08-07 Aram W. Harrow