Related papers: Qutrit Dichromatic Calculus and Its Universality
It is shown that quantized irreducible flag manifolds possess a canonical $q$-analogue of the de Rham complex. Generalizing the well known situation for the standard Podle\'s' quantum sphere this analogue is obtained as the universal…
Quantum computing in terms of geometric phases, i.e. Berry or Aharonov-Anandan phases, is fault-tolerant to a certain degree. We examine its implementation based on Zeeman coupling with a rotating field and isotropic Heisenberg interaction,…
Recent completeness results on the ZX-Calculus used a third-party language, namely the ZW-Calculus. As a consequence, these proofs are elegant, but sadly non-constructive. We address this issue in the following. To do so, we first describe…
Universal quantum computation may be realized based on quantum walk, by formulating it as a scattering problem on a graph. In this paper, we simulate quantum gates through electric circuits, following a recent report that a one-dimensional…
Quantum computation in solid state quantum dots faces two significant challenges: Decoherence from interactions with the environment and the difficulty of generating local magnetic fields for the single qubit rotations. This paper presents…
We describe in detail how to perform universal fault-tolerant quantum computation on a 2-D color code, making use of only nearest neighbor interactions. Three defects (holes) in the code are used to represent logical qubits. Triple defect…
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…
We study the resources required to achieve universal quantum computing via the gate sets that provide the fundamental instructions from which quantum algorithms are built. While single-gate universal sets are known, they rely on precisely…
Non-adiabatic holonomic quantum computation is a method used to implement high-speed quantum gates with non-Abelian geometric phases associated with paths in state space. Due to their noise tolerance, these phases can be used to construct…
Graphical calculi for representing interacting quantum systems serve a number of purposes: compositionally, intuitive graphical reasoning, and a logical underpinning for automation. The power of these calculi stems from the fact that they…
The quantum computing paradigm in photonics currently relies on the multi-port interference in linear optical devices, which is intrinsically based on probabilistic measurements outcome and thus non-deterministic. Devising a fully…
As was shown by Leutwyler and Smilga, the fact that chiral symmetry is broken and the existence of a effective finite volume partition function leads to an infinite number of sum rules for the eigenvalues of the Dirac operator in QCD. In…
Let $U_q(\hat{\cal G})$ be a quantized affine Lie algebra. It is proven that the universal R-matrix $R$ of $U_q(\hat{\cal G})$ satisfies the celebrated conjugation relation $R^\dagger=TR$ with $T$ the usual twist map. As applications, braid…
Qudit, a high-dimensional quantum system, provides a larger Hilbert space to process the quantum information and has shown remarkable advantages over the qubit counterparts. It is a great challenge to realize the high fidelity universal…
We present an architecture for early fault-tolerant quantum computers based on the smallest interesting colour code (Earl Campbell, 2016). It realizes a universal logical gate set consisting of single-qubit measurements and preparations in…
The topological color code and the toric code are two leading candidates for realizing fault-tolerant quantum computation. Here we show that the color code on a $d$-dimensional closed manifold is equivalent to multiple decoupled copies of…
We propose a universal set of single- and two-qubit quantum gates acting on a hybrid qubit formed by coupling a quantum dot spin qubit to a $\mathbb{Z}_{2m}$ parafermion qubit with arbitrary integer $m$. The special case $m=1$ reproduces…
We explore the utility of $d=8$ qudits, qu8its, for quantum simulations of the dynamics of 1+1D SU(3) lattice quantum chromodynamics, including a mapping for arbitrary numbers of flavors and lattice size and a re-organization of the…
Quantum algorithms for unstructured search problems rely on the preparation of a uniform superposition, traditionally achieved through Hadamard gates. However, this incidentally creates an auxiliary search space consisting of nonsensical…
Diagrammatic representations of quantum algorithms and circuits offer novel approaches to their design and analysis. In this work, we describe extensions of the ZX-calculus especially suitable for parameterized quantum circuits, in…