Criteria for exact qudit universality
نویسندگان
چکیده
Gavin K. Brennen,* Dianne P. O’Leary, and Stephen S. Bullock National Institute of Standards and Technology, Atomic Physics Division, Gaithersburg, Maryland 20899-8420, USA University of Maryland, Department of Computer Science, Collge Park, Maryland 20742, USA National Institute of Standards and Technology, Mathematical and Computational Sciences Division, Gaithersburg, Maryland 20899-8910, USA sReceived 1 September 2004; revised manuscript received 21 December 2004; published 16 May 2005d
منابع مشابه
Universal Quantum Gates
In this paper we study universality for quantum gates acting on qudits. Qudits are states in a Hilbert space of dimension d where d can be any integer ≥ 2. We determine which 2-qudit gates V have the properties (i) the collection of all 1-qudit gates together with V produces all n-qudit gates up to arbitrary precision, or (ii) the collection of all 1-qudit gates together with V produces all n-q...
متن کاملDeciding universality of quantum gates
We say that collection of n-qudit gates is universal if there exists N0 ≥ n such that for every N ≥ N0 every N-qudit unitary operation can be approximated with arbitrary precision by a circuit built from gates of the collection. Our main result is an upper bound on the smallest N0 with the above property. The bound is roughly dn, where d is the number of levels of the base system (the ’d’ in th...
متن کاملValence bond solid formalism for d-level one-way quantum computation
The d-level or qudit one-way quantum computer (d1WQC) is described using the valence bond solid formalism and the generalised Pauli group. This formalism provides a transparent means of deriving measurement patterns for the implementation of quantum gates in the computational model. We introduce a new universal set of qudit gates and use it to give a constructive proof of the universality of d1...
متن کاملSymmetric extendibility for a class of qudit states
The concept of symmetric extendibility has recently drawn attention in the context of tolerable error rates in quantum cryptography, where it can be used to decide whether quantum states shared between two parties can be purified by means of entanglement purification with one-way classical communication only. Unfortunately, at present there exists no simple general criterion to decide whether a...
متن کاملEfficient circuits for exact-universal computationwith qudits
This paper concerns the efficient implementation of quantum circuits for qudits. We show that controlled two-qudit gates can be implemented without ancillas and prove that the gate library containing arbitrary local unitaries and one two-qudit gate, CINC, is exact-universal. A recent paper [S.Bullock, D.O’Leary, and G.K. Brennen, Phys. Rev. Lett. 94, 230502 (2005)] describes quantum circuits fo...
متن کامل