Related papers: Qudit lattice surgery
This paper introduces a novel abstraction for programming quantum operations, specifically projective Cliffords, as functions over the qudit Pauli group. Generalizing the idea behind Pauli tableaux, we introduce a type system and lambda…
In this paper we look at 3D lattice models that are generalizations of the state sum model used to define the Kuperberg invariant of 3-manifolds. The partition function is a scalar constructed as a tensor network where the building blocks…
ZW-calculus is a useful graphical language for pure qubit quantum computing. It is via the translation of the completeness of ZW-calculus that the first proof of completeness of ZX-calculus was obtained. A d-level generalisation of qubit…
We study quotients of the magmatic operad, that is the free nonsymmetric operad over one binary generator. In the linear setting, we show that the set of these quotients admits a lattice structure and we show an analog of the Grassmann…
Holistic resource estimates are essential for guiding the development of fault-tolerant quantum algorithms and the computers they will run on. This is particularly true when we focus on highly-constrained early fault-tolerant devices. Many…
In this paper we introduce a new class of integrable 3D lattice models, possessing continuous families of commuting layer-to-layer transfer matrices. Algebraically, this commutativity is based on a very special construction of local…
Magic states are a foundational resource for universal quantum computation. To survive in a realistic noisy environment, magic states must be prepared fault-tolerantly and protected by a quantum error-correcting code. The recent discovery…
We analyze a class of quantum operations based on a geometrical representation of $d-$level quantum system (or qudit for short). A sufficient and necessary condition of complete positivity, expressed in terms of the quantum Fourier…
With a focus on universal quantum computing for quantum simulation, and through the example of lattice gauge theories, we introduce rather general quantum algorithms that can efficiently simulate certain classes of interactions consisting…
We prove that universal quantum computation can be realized---using only linear optics and $\chi^{(2)}$ (three-wave mixing) interactions---in any $(n+1)$-dimensional qudit basis of the $n$-pump-photon subspace. First, we exhibit a strictly…
Designs for quantum error correction depend strongly on the connectivity of the qubits. For solid state qubits, the most straightforward approach is to have connectivity constrained to a planar graph. Practical considerations may also…
We report on an ongoing project to parametrize the Fixed-Point Dirac operator for massless quarks, using a very general construction which has arbitrarily many fermion offsets and gauge paths, the complete Clifford algebra and satisfies all…
Recent developments in mapping lattice gauge theories relevant to the Standard Model onto digital quantum computers identify scalable paths with well-defined quantum compilation challenges toward the continuum. As an entry point to these…
In this work, we introduce a method to construct fault-tolerant measurement-based quantum computation (MBQC) architectures and numerically estimate their performance over various types of networks. A possible application of such a paradigm…
By resorting to the Fock--Bargmann representation, we incorporate the quantum Weyl--Heisenberg ($q$-WH) algebra into the theory of entire analytic functions. The main tool is the realization of the $q$--WH algebra in terms of finite…
We propose a scheme for quantum computation in optical lattices. The qubits are encoded in the spacial wavefunction of the atoms such that spin decoherence does not influence the computation. Quantum operations are steered by shaking the…
We introduce group surface codes, which are a natural generalization of the $\mathbb{Z}_2$ surface code, and equivalent to quantum double models of finite groups with specific boundary conditions. We show that group surface codes can be…
In this paper we give a complete axiomatisation of qubit ZX-calculus via elementary transformations which are basic operations in linear algebra. This formalism has two main advantages. First, all the operations of the phases are algebraic…
We present an economical dynamical control scheme to perform quantum computation on a one dimensional optical lattice, where each atom encodes one qubit. The model is based on atom tunneling transitions between neighboring sites of the…
To formulate the universal constraints of quantum statistics data of generic long-range entangled quantum systems, we introduce the geometric-topology surgery theory on spacetime manifolds where quantum systems reside, cutting and gluing…