Applications of Universal Parity Quantum Computation

TL;DR

This paper explores the use of parity encoding in quantum computation, demonstrating its advantages in reducing circuit depth for algorithms like quantum Fourier transform and addition, and proposing efficient implementations of multiqubit gates.

Contribution

It introduces a universal gate set in parity encoding, showing its practical benefits and providing methods for efficient multiqubit gate implementation and graph state preparation.

Findings

Reduced circuit depth in parity encoding implementations

Comparable multiqubit gate counts to conventional methods

Efficient strategies for graph state preparation

Abstract

We demonstrate the applicability of a universal gate set in the parity encoding, which is a dual to the standard gate model, by exploring several quantum gate algorithms such as the quantum Fourier transform and quantum addition. Embedding these algorithms in the parity encoding reduces the circuit depth compared to conventional gate-based implementations while keeping the multiqubit gate counts comparable. We further propose simple implementations of multiqubit gates in tailored encodings and an efficient strategy to prepare graph states.