.png){kind=icon}
.png){kind=icon}
Return
Qudit Quantum Programming with Projective Cliffords
.png){kind=icon}
PRE
AI
DOI：10.1145/3776646.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 calculus for projective Cliffords called )Pc that captures well-formed Clifford operations via a Curry-Howard correspondence with a particular encoding of the Clifford and Pauli groups. In )Pc, users write functions that encode projective Cliffords P -> UPU dagger, and such functions are compiled to circuits executable on modern quantum computers that transform quantum states |q > into U |q >, up to a global phase. Importantly, the language captures not just qubit operations, but qud it operations for any dimension d. Throughout the paper we explore what it means to program with projective Cliffords through a number of examples and a case study focusing on stabilizer error correcting codes.
Keywords:
Quantum computing
Clifford
Pauli
Qudits
Linear types
Journal
P
IF:
2.8
Papers:
308
Citations:
4.7K