Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0512034

Quantum Information Processing with Low-Dimensional Systems

Alexander Yu. Vlasov

Published Dec 5, 2005• 2 citations
arXivHTMLPDF

Abstract

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 arbitrary entangled state of these k systems. Preparation and arbitrary transformations of states are possible with universal set of quantum gates and for any d may be suggested such gates acting only on single systems and neighbouring pairs. Here are revisited methods of construction of Hamiltonians for such universal set of gates and as a concrete new example is considered case with qutrits. Quantum tomography is also revisited briefly.

DOI
10.48550/arxiv.quant-ph/0512034

Related papers

Algebra of quantum computations with higher dimensional systems

Alexander Y. Vlasov

Here is discussed application of the Weyl pair to construction of universal set of quantum gates for high-dimensional quantum system. An application of Lie algebras (Hamiltonians) for construction of universal gates is revisited first. It is shown next, how for quantum computation with qubits can be used two-dimensional analog of this Cayley-Weyl matrix algebras, i.e. Clifford algebras, and discussed well known applications to product operator formalism in NMR, Jordan-Wigner construction in fermionic quantum computations. It is introduced universal set of quantum gates for higher dimensional system ("qudit"), as some generalization of these models. Finally it is briefly mentioned possible application of such algebraic methods to design of quantum processors (programmable gates arrays) and dsicussed generalization to quantum computation wiht continuous variables.

arXiv:quant-ph/0210049•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jul 23, 2003•20 citations

Generalised Quantum Gates for Qudits and their Application in Quantum Fourier Transform

Francesco Pudda, Mario Chizzini, Crippa, Luca

Quantum computing with qudits, quantum systems with $d > 2$ levels, offers a powerful extension beyond qubits, expanding the computational possibilities of quantum systems, allowing the simplification of the implementation of several algorithms and, possibly, providing a foundation for optimised error correction. In this work, we propose a novel formulation of qudit gates that is universally applicable for any number of levels $d$, without restrictions on the dimensionality. By extending the mathematical framework of quantum gates to arbitrary dimensions, we derive explicit gate operations that form a universal set for quantum computation on qudits of any size. We demonstrate the validity of our approach through the implementation of the Quantum Fourier Transform (QFT) for arbitrary $d$, verifying both the correctness and utility of our generalized gates. This novel methodology broadens the design space for quantum algorithms and fault-tolerant architectures, paving the way for advancements in qudit-based quantum computing.

arXiv:2410.05122•Oct 7, 2024•17 citations

Universal quantum gates

Jean-Luc Brylinski, Ranee Kathryn Brylinski

Abstract 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-qudit gates exactly. We show that (i) and (ii) are equivalent conditions on V , and they hold if and only if V is not a primitive gate. Here we say V is primitive if it transforms any decomposable tensor into a decomposable tensor. We discuss some applications and also relations with work of other authors.

Chapman & Hall/CRC eBooks•Feb 14, 2002•234 citations

Criteria for exact qudit universality

Gavin K. Brennen, Dianne Prost O’Leary, Stephen S. Bullock

We describe criteria for implementation of quantum computation in qudits. A qudit is a -dimensional system whose Hilbert space is spanned by states \ensuremath{\mid}0⟩, \ensuremath{\mid}1⟩, \dots{}, . An important earlier work [] describes how to exactly simulate an arbitrary unitary on multiple qudits using a parameter family of single qudit and two qudit gates. That technique is based on the spectral decomposition of unitaries. Here we generalize this argument to show that exact universality follows given a discrete set of single qudit Hamiltonians and one two-qudit Hamiltonian. The technique is related to the -matrix decomposition of numerical linear algebra. We consider a generic physical system in which the single qudit Hamiltonians are a small collection of and . A coupling graph results taking nodes 0, \dots{}, and edges are allowed Hamiltonians. One qudit exact universality follows iff this graph is connected, and complete universality results if the two-qudit Hamiltonian is also allowed. We discuss implementation in the eight dimensional ground electronic states of and construct an optimal gate sequence using Raman laser pulses.

arXiv:quant-ph/0407223•Physical Review A•May 16, 2005•101 citations

Probabilistic implementation of universal quantum processors

Mark S. Hillery, Vladimír Bužek, Mário Ziman

We present a probabilistic quantum processor for qudits on a single qudit of dimension N. 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 encoded. This program is applied to the data register. The processor can perform any operation on a single qudit of dimension N with a certain probability. For a general unitary operation, the probability is ${1/N}^{2},$ but for more restricted sets of operators the probability can be higher. In fact, this probability can be independent of the dimension of the qudit Hilbert space of the qudit under some conditions.

arXiv:quant-ph/0106088•Physical Review A•Jan 3, 2002•82 citations

Universal simulation of Hamiltonian dynamics for quantum systems with finite-dimensional state spaces

Michael A. Nielsen, Michael J. Bremner, Jennifer L. Dodd +2 more

What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? Dodd et al. [Phys. Rev. A 65, 040301(R) (2002)] provided a partial solution to this problem in the form of an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling N-qubit Hamiltonian, and local unitaries. We extend this result to the case where the component systems are qudits, that is, have D dimensions. As a consequence we explain how universal quantum computation can be performed with any fixed two-body entangling N-qudit Hamiltonian, and local unitaries.

arXiv:quant-ph/0109064•Physical Review A•Aug 30, 2002•134 citations
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 arbitrary entangled state of these k systems. Preparation and arbitrary transformations of states are possible with universal set of quantum gates and for any d may be suggested such gates acting only on single systems and neighbouring pairs. Here are revisited methods of construction of Hamiltonians for such universal set of gates and as a concrete new example is considered case with qutrits. Quantum tomography is also revisited briefly.
Here is discussed application of the Weyl pair to construction of universal set of quantum gates for high-dimensional quantum system. An application of Lie algebras (Hamiltonians) for construction of universal gates is revisited first. It is shown next, how for quantum computation with qubits can be used two-dimensional analog of this Cayley-Weyl matrix algebras, i.e. Clifford algebras, and discussed well known applications to product operator formalism in NMR, Jordan-Wigner construction in fermionic quantum computations. It is introduced universal set of quantum gates for higher dimensional system ("qudit"), as some generalization of these models. Finally it is briefly mentioned possible application of such algebraic methods to design of quantum processors (programmable gates arrays) and dsicussed generalization to quantum computation wiht continuous variables.
Quantum computing with qudits, quantum systems with d>2d > 2d>2 levels, offers a powerful extension beyond qubits, expanding the computational possibilities of quantum systems, allowing the simplification of the implementation of several algorithms and, possibly, providing a foundation for optimised error correction. In this work, we propose a novel formulation of qudit gates that is universally applicable for any number of levels ddd, without restrictions on the dimensionality. By extending the mathematical framework of quantum gates to arbitrary dimensions, we derive explicit gate operations that form a universal set for quantum computation on qudits of any size. We demonstrate the validity of our approach through the implementation of the Quantum Fourier Transform (QFT) for arbitrary ddd, verifying both the correctness and utility of our generalized gates. This novel methodology broadens the design space for quantum algorithms and fault-tolerant architectures, paving the way for advancements in qudit-based quantum computing.
Abstract 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-qudit gates exactly. We show that (i) and (ii) are equivalent conditions on V , and they hold if and only if V is not a primitive gate. Here we say V is primitive if it transforms any decomposable tensor into a decomposable tensor. We discuss some applications and also relations with work of other authors.
We describe criteria for implementation of quantum computation in qudits. A qudit is a -dimensional system whose Hilbert space is spanned by states \ensuremath{\mid}0⟩, \ensuremath{\mid}1⟩, \dots{}, . An important earlier work [] describes how to exactly simulate an arbitrary unitary on multiple qudits using a parameter family of single qudit and two qudit gates. That technique is based on the spectral decomposition of unitaries. Here we generalize this argument to show that exact universality follows given a discrete set of single qudit Hamiltonians and one two-qudit Hamiltonian. The technique is related to the -matrix decomposition of numerical linear algebra. We consider a generic physical system in which the single qudit Hamiltonians are a small collection of and . A coupling graph results taking nodes 0, \dots{}, and edges are allowed Hamiltonians. One qudit exact universality follows iff this graph is connected, and complete universality results if the two-qudit Hamiltonian is also allowed. We discuss implementation in the eight dimensional ground electronic states of and construct an optimal gate sequence using Raman laser pulses.
We present a probabilistic quantum processor for qudits on a single qudit of dimension N. 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 encoded. This program is applied to the data register. The processor can perform any operation on a single qudit of dimension N with a certain probability. For a general unitary operation, the probability is 1/N2,{1/N}^{2},1/N2, but for more restricted sets of operators the probability can be higher. In fact, this probability can be independent of the dimension of the qudit Hilbert space of the qudit under some conditions.
What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? Dodd et al. [Phys. Rev. A 65, 040301(R) (2002)] provided a partial solution to this problem in the form of an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling N-qubit Hamiltonian, and local unitaries. We extend this result to the case where the component systems are qudits, that is, have D dimensions. As a consequence we explain how universal quantum computation can be performed with any fixed two-body entangling N-qudit Hamiltonian, and local unitaries.