A comprehensive graph theoretical and finite geometrical study of the commutation relations between the generalized Pauli operators of N-qudits is performed in which vertices/points correspond to the operators and edges/lines join commuting pairs of them. As per two-qubits, all basic properties and partitionings of the corresponding Pauli graph are embodied in the geometry of the generalized quadrangle of order two. Here, one identifies the operators with the points of the quadrangle and groups of maximally commuting subsets of the operators with the lines of the quadrangle. The three basic partitionings are (a) a pencil of lines and a cube, (b) a Mermin's array and a bipartite-part and (c) a maximum independent set and the Petersen graph. These factorizations stem naturally from the existence of three distinct geometric hyperplanes of the quadrangle, namely a set of points collinear with a given point, a grid and an ovoid, which answer to three distinguished subsets of the Pauli graph, namely a set of six operators commuting with a given one, a Mermin's square, and set of five mutually non-commuting operators, respectively. The generalized Pauli graph for multiple qubits is found to follow from symplectic polar spaces of order two, where maximal totally isotropic subspaces stand for maximal subsets of mutually commuting operators. The substructure of the (strongly regular) N-qubit Pauli graph is shown to be pseudo-geometric, i. e., isomorphic to a graph of a partial geometry. Finally, the (not strongly regular) Pauli graph of a two-qutrit system is introduced; here it turns out more convenient to deal with its dual in order to see all the parallels with the two-qubit case and its surmised relation with the generalized quadrangle Q(4, 3), the dual ofW(3).
We prove that on any two-dimensional lattice of qudits of a prime dimension, every translation invariant Pauli stabilizer group with local generators and with code distance being the linear system size, is decomposed by a local Clifford circuit of constant depth into a finite number of copies of the toric code (abelian discrete gauge theory) stabilizer group. This means that under local Clifford circuits the number of toric code copies is the complete invariant of topological Pauli stabilizer codes. Previously, the same conclusion was obtained under the assumption of nonchirality for qubit cod…
It is important for performance studies in quantum technologies to analyze quantum circuits in the presence of noise. We introduce an error probability tensor, a tool to track generalized Pauli error statistics of qudits within quantum circuits composed of qudit Clifford gates. Our framework is compatible with qudit stabilizer quantum error-correcting codes. We show how the error probability tensor can be applied in the most general case, and we demonstrate an error analysis of bipartite qudit repeaters with quantum error correction. We provide an exact analytical solution of the error statist…
In this chapter a quantum communication protocol with use of repeaters is presented. The protocol is constructed for qudits i.e. the generalized quantum information units. One-dit teleportation is based on the generalized Pauli-Z (phase-flip) gate's correction. This approach avoids using Pauli-X and Hadamard gates unlike in other known protocols based on quantum repeaters which were constructed for qubits and qudits. It is also important to mention that the repeaters based on teleportation protocol, described in this chapter, allow a measurement in the standard base (what simplifies the measur…
As a continuation of our previous work (arXiv:0708.4333) an algebraic geometrical study of a single $d$-dimensional qudit is made, with $d$ being {\it any} positive integer. The study is based on an intricate relation between the symplectic module of the generalized Pauli group of the qudit and the fine structure of the projective line over the (modular) ring $\bZ_{d}$. Explicit formulae are given for both the number of generalized Pauli operators commuting with a given one and the number of points of the projective line containing the corresponding vector of $\bZ^{2}_{d}$. We find, remarkably…
Following the spirit of a recent work of one of the authors (J. Phys. A: Math. Theor. 44 (2011) 045301), the essential structure of the generalized Pauli group of a qubit-qu$d$it, where $d = 2^{k}$ and an integer $k \geq 2$, is recast in the language of a finite geometry. A point of such geometry is represented by the maximum set of mutually commuting elements of the group and two distinct points are regarded as collinear if the corresponding sets have exactly $2^{k} - 1$ elements in common. The geometry comprises $2^{k} - 1$ copies of the generalized quadrangle of order two ("the doily") that…
High-dimensional degrees of freedom of photons can encode more quantum information than their two-dimensional counterparts. While the increased information capacity has advantages in quantum applications (such as quantum communication), controlling and manipulating these systems has been challenging. Here we show a method to perform lossless arbitrary high-dimensional Pauli-X gates for single photon. The X-gate consists of a cyclic permutation of qudit basis vectors, and, together with the Z gate, forms the basis for performing arbitrary transformations. We propose an implementation of such ga…
The goal of the paper is to check whether the real eigenstates of the observables in the single qudit Pauli group may lead to quantum contextuality, the property that mutually compatible and independent experiments depend on each other. We find that quantum contextuality crops up at dimension twelve in various configurations with a few rays. We use the Shannon capacity for characterizing the corresponding orthogonality graphs. Some arithmetical properties underlying the qudit contextuality are outlined.
Dynamical decoupling is a powerful technique to suppress errors in quantum systems originating from environmental couplings or from unwanted inter-particle interactions. However, it can also be used to selectively decouple specific couplings in a quantum system. We present a simple and easy-to-use general method to construct such selective decoupling schemes on qubit and qudit networks by means of (generalized) Pauli operations. As these constructed schemes can suppress Hamiltonian interactions on general qudit networks selectively, they are well suited for purposes of approximate quantum simu…
The $d^2$ Pauli operators attached to a composite qudit in dimension $d$ may be mapped to the vectors of the symplectic module $\mathcal{Z}_d^{2}$ ($\mathcal{Z}_d$ the modular ring). As a result, perpendicular vectors correspond to commuting operators, a free cyclic submodule to a maximal commuting set, and disjoint such sets to mutually unbiased bases. For dimensions $d=6,~10,~15,~12$, and 18, the fine structure and the incidence between maximal commuting sets is found to reproduce the projective line over the rings $\mathcal{Z}_{6}$, $\mathcal{Z}_{10}$, $\mathcal{Z}_{15}$, $\mathcal{Z}_6 \ti…
A very particular connection between the commutation relations of the elements of the generalized Pauli group of a $d$-dimensional qudit, $d$ being a product of distinct primes, and the structure of the projective line over the (modular) ring $\bZ_{d}$ is established, where the integer exponents of the generating shift ($X$) and clock ($Z$) operators are associated with submodules of $\bZ^{2}_{d}$. Under this correspondence, the set of operators commuting with a given one -- a perp-set -- represents a $\bZ_{d}$-submodule of $\bZ^{2}_{d}$. A crucial novel feature here is that the operators are …
Recently, a number of interesting relations have been discovered between generalised Pauli/Dirac groups and certain finite geometries. Here, we succeeded in finding a general unifying framework for all these relations. We introduce gradually necessary and sufficient conditions to be met in order to carry out the following programme: Given a group $\vG$, we first construct vector spaces over $\GF(p)$, $p$ a prime, by factorising $\vG$ over appropriate normal subgroups. Then, by expressing $\GF(p)$ in terms of the commutator subgroup of $\vG$, we construct alternating bilinear forms, which refle…
We construct a Pauli stabilizer model for every two-dimensional Abelian topological order that admits a gapped boundary. Our primary example is a Pauli stabilizer model on four-dimensional qudits that belongs to the double semion (DS) phase of matter. The DS stabilizer Hamiltonian is constructed by condensing an emergent boson in a $\mathbb{Z}_4$ toric code, where the condensation is implemented by making certain two-body measurements. We rigorously verify the topological order of the DS stabilizer model by identifying an explicit finite-depth quantum circuit (with ancillary qubits) that maps …
We derive a basis for the vector space of bounded operators acting on a $d$-dimensional system Hilbert space $C^d$. In the context of quantum computation the basis elements are identified as the generalised Pauli matrices - the error generators. As an application, we show how such matrices are used in the teleportation a single qudit.
In the paper (math-ph/0504049) Jarlskog gave an interesting simple parametrization to unitary matrices, which was essentially the canonical coordinate of the second kind in the Lie group theory (math-ph/0505047). In this paper we apply the method to a quantum computation based on multi-level system (qudit theory). Namely, by considering that the parametrization gives a complete set of modules in qudit theory, we construct the generalized Pauli matrices which play a central role in the theory and also make a comment on the exchange gate of two-qudit systems. Moreover we give an explicit constru…
We study measurements of the unitary generalization of Pauli operators. First, an analytical (constructive) solution to the eigenproblem of these operators is presented. Next, in the case of two subsystems, the Schmidt form of the eigenvectors is derived to identify measurements which are easy to implement. These results are utilized to show that quantum cryptography with two bases, when operating on a two-component qudit, can be realized with measurements on individual subsystems, assisted with classical communication. We also discuss feasible devices which perform tomography of polarisation-…
We study the commutation relations within the Pauli groups built on all decompositions of a given Hilbert space dimension $q$, containing a square, into its factors. Illustrative low dimensional examples are the quartit ($q=4$) and two-qubit ($q=2^2$) systems, the octit ($q=8$), qubit/quartit ($q=2\times 4$) and three-qubit ($q=2^3$) systems, and so on. In the single qudit case, e.g. $q=4,8,12,...$, one defines a bijection between the $σ(q)$ maximal commuting sets [with $σ[q)$ the sum of divisors of $q$] of Pauli observables and the maximal submodules of the modular ring $\mathbb{Z}_q^2$, that…
We introduce quantum hybrid gates that act on qudits of different dimensions. In particular, we develop two representative two-qudit hybrid gates (SUM and SWAP) and many-qudit hybrid Toffoli and Fredkin gates. We apply the hybrid SUM gate to generating entanglement, and find that operator entanglement of the SUM gate is equal to the entanglement generated by it for certain initial states. We also show that the hybrid SUM gate acts as an automorphism on the Pauli group for two qudits of different dimension under certain conditions. Finally, we describe a physical realization of these hybrid gat…
The techniques of low-rank matrix recovery were adapted for Quantum State Tomography (QST) previously by D. Gross et al. [Phys. Rev. Lett. 105, 150401 (2010)], where they consider the tomography of $n$ spin-$1/2$ systems. For the density matrix of dimension $d = 2^n$ and rank $r$ with $r \ll 2^n$, it was shown that randomly chosen Pauli measurements of the order $O(dr \log(d)^2)$ are enough to fully reconstruct the density matrix by running a specific convex optimization algorithm. The result utilized the low operator-norm of the Pauli operator basis, which makes it `incoherent' to low-rank ma…
We consider four-dimensional qudits as qubit pairs and their qudit Pauli operators as qubit Clifford operators. This introduces a nesting, $C_1^2 \subset C_2^4 \subset C_3^2$, where $C_n^m$ is the $n$th level of the $m$-dimensional qudit Clifford hierarchy. If we can convert between logical qubits and qudits, then qudit Clifford operators are qubit non-Clifford operators. Conversion is achieved by qubit fusion and qudit fission using stabilizer circuits that consume a resource state. This resource is a fused qubit stabilizer state with a fault-tolerant state preparation using stabilizer circui…
We study the commutation structure within the Pauli groups built on all decompositions of a given Hilbert space dimension $q$, containing a square, into its factors. The simplest illustrative examples are the quartit ($q=4$) and two-qubit ($q=2^2$) systems. It is shown how the sum of divisor function $σ(q)$ and the Dedekind psi function $ψ(q)=q \prod_{p|q} (1+1/p)$ enter into the theory for counting the number of maximal commuting sets of the qudit system. In the case of a multiple qudit system (with $q=p^m$ and $p$ a prime), the arithmetical functions $σ(p^{2n-1})$ and $ψ(p^{2n-1})$ count the…
We describe generalizations of the Pauli group, the Clifford group and stabilizer states for qudits in a Hilbert space of arbitrary dimension d. We examine a link with modular arithmetic, which yields an efficient way of representing the Pauli group and the Clifford group with matrices over the integers modulo d. We further show how a Clifford operation can be efficiently decomposed into one and two-qudit operations. We also focus in detail on standard basis expansions of stabilizer states.
The commutation relations between the generalized Pauli operators of N-qudits (i. e., N p-level quantum systems), and the structure of their maximal sets of commuting bases, follow a nice graph theoretical/geometrical pattern. One may identify vertices/points with the operators so that edges/lines join commuting pairs of them to form the so-called Pauli graph P_{p^N} . As per two-qubits (p = 2, N = 2) all basic properties and partitionings of this graph are embodied in the geometry of the symplectic generalized quadrangle of order two, W(2). The structure of the two-qutrit (p = 3, N = 2) graph…
We give explicit index-free formulae for all the degree six (and also degree four and two) algebraically independent local unitary invariant polynomials for finite dimensional k-partite pure and mixed quantum states. We carry out this by the use of graph-technical methods, which provides illustrations for this abstract topic.
How much noise can a given quantum state tolerate without losing its entanglement? For qudits of arbitrary dimension, I investigate this question for two noise models: Global white noise, where a depolarizing channel is applied to all qudits simultaneously, and local white noise, where a single qudit depolarizing channel is applied to every qudit individually. Using a unitary generalization of the Pauli group, I derive noise thresholds for stabilizer states, with an emphasis on graph states, and compare different entanglement criteria. The PPT and reduction criteria generally provide high nois…
We show a significant reduction of the number of quantum operations and the improvement of the circuit depth for the realization of the Toffoli gate by using qudits. This is done by establishing a general relation between the dimensionality of qudits and their topology of connections for a scalable multi-qudit processor, where higher qudit levels are used for substituting ancillas. The suggested model is of importance for the realization of quantum algorithms and as a method of quantum error correction codes for single-qubit operations.
One fascinating way of revealing the quantum nonlocality is the all-versus-nothing test due to Greenberger, Horne, and Zeilinger (GHZ) known as GHZ paradox. So far genuine multipartite and multilevel GHZ paradoxes are known to exist only in systems containing an odd number of particles. Here we shall construct GHZ paradoxes for an arbitrary number (greater than 3) of particles with the help of qudit graph states on a special kind of graphs, called as GHZ graphs. Based on the GHZ paradox arising from a GHZ graph, we derive a Bell inequality with two $d$-outcome observables for each observer, wh…
Graph states are generalized from qubits to collections of $n$ qudits of arbitrary dimension $D$, and simple graphical methods are used to construct both additive and nonadditive quantum error correcting codes. Codes of distance 2 saturating the quantum Singleton bound for arbitrarily large $n$ and $D$ are constructed using simple graphs, except when $n$ is odd and $D$ is even. Computer searches have produced a number of codes with distances 3 and 4, some previously known and some new. The concept of a stabilizer is extended to general $D$, and shown to provide a dual representation of an addi…
Let consider the Pauli group $\mathcal{P}_q=<X,Z>$ with unitary quantum generators $X$ (shift) and $Z$ (clock) acting on the vectors of the $q$-dimensional Hilbert space via $X|s> =|s+1>$ and $Z|s> =ω^s |s>$, with $ω=\exp(2iπ/q)$. It has been found that the number of maximal mutually commuting sets within $\mathcal{P}_q$ is controlled by the Dedekind psi function $ψ(q)=q \prod_{p|q}(1+\frac{1}{p})$ (with $p$ a prime) \cite{Planat2011} and that there exists a specific inequality $\frac{ψ(q)}{q}>e^γ\log \log q$, involving the Euler constant $γ\sim 0.577$, that is only satisfied at specific low d…
We construct multipartite graph states whose dimension is the power of a prime number. This is realized by the finite field, as well as the generalized controlled-NOT quantum circuit acting on two qudits. We propose the standard form of graph states up to local unitary transformations and particle permutations. The form greatly simplifies the classification of graph states as we illustrate up to five qudits. We also show that some graph states are multipartite maximally entangled states in the sense that any bipartite of the system produces a bipartite maximally entangled state. We further pro…
We present a unified formalism for threshold quantum secret sharing using graph states of systems with prime dimension. We construct protocols for three varieties of secret sharing: with classical and quantum secrets shared between parties over both classical and quantum channels.
Absolutely maximally entangled (AME) states are multipartite entangled states that are maximally entangled for any possible bipartition. In this paper, we study the description of AME states within the graph state formalism. The graphical representation provides an intuitive framework to visualize the entanglement in graph states, which makes them a natural candidate to describe AME states. We show two different methods of determining bipartite entanglement in graph states and use them to define various AME graph states. We further show that AME graph states exist for all number of parties, an…
The commutation relations of the generalized Pauli operators of a qubit-qutrit system are discussed in the newly established graph-theoretic and finite-geometrical settings. The dual of the Pauli graph of this system is found to be isomorphic to the projective line over the product ring Z2xZ3. A "peculiar" feature in comparison with two-qubits is that two distinct points/operators can be joined by more than one line. The multi-line property is shown to be also present in the graphs/geometries characterizing two-qutrit and three-qubit Pauli operators' space and surmised to be exhibited by any o…
In this work we present a generalization of the recently developed Hardy-like logical proof of contextuality and of the so-called KCBS contextuality inequality for any qudit of dimension greater than three. Our approach uses compatibility graphs that can only be satisfied by qudits. We find a construction for states and measurements that satisfy these graphs and demonstrate both logical and inequality based contextuality for qudits. Interestingly, the quantum violation of the inequality is constant as dimension increases. We also discuss the issue of imprecision in experimental implementations…
We describe criteria for implementation of quantum computation in qudits. A qudit is a d-dimensional system whose Hilbert space is spanned by states |0>, |1>,... |d-1>. An important earlier work of Mathukrishnan and Stroud [1] describes how to exactly simulate an arbitrary unitary on multiple qudits using a 2d-1 parameter family of single qudit and two qudit gates. Their 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 techn…
In this article, we develop an algebraic framework of axioms which abstracts various high-level properties of multi-qudit representations of generalized Clifford algebras. We further construct an explicit model and prove that it satisfies these axioms. Strengths of our algebraic framework include the minimality of its assumptions, and the readiness by which one may give an explicit construction satisfying these assumptions. In terms of applications, this algebraic framework provides a solid foundation which opens the way for developing a graphical calculus for multi-qudit representations of ge…
Robust quantum computation with d-level quantum systems (qudits) poses two requirements: fast, parallel quantum gates and high fidelity two-qudit gates. We first describe how to implement parallel single qudit operations. It is by now well known that any single-qudit unitary can be decomposed into a sequence of Givens rotations on two-dimensional subspaces of the qudit state space. Using a coupling graph to represent physically allowed couplings between pairs of qudit states, we then show that the logical depth of the parallel gate sequence is equal to the height of an associated tree. The imp…
