Applications of Universal Parity Quantum Computation

Universal Quantum Computation


Our team at ParityQC (our colleagues Michael Fellner, Anette Messinger, Kilian Ender and Wolfgang Lechner) has recently been focused on finding novel approaches to universal quantum computation based on the ParityQC Architecture. In the paper “Universal Parity Quantum Computing” (previously outlined here), we proposed a universal gate set for quantum computing, with all-to-all connectivity and intrinsic robustness to bit-flip errors, based on the Parity Encoding.

The next step, which the authors present in the paper “Applications of Universal Parity Quantum Computation”, is the implementation of well-known quantum algorithms in this novel structure. The main challenge that one has to face in the implementation of these algorithms is the inter-qubit connectivity on quantum chips. This is especially pressing because a long-range and dense (ideally all-to-all) connectivity is a crucial ingredient for many key quantum algorithms. The connectivity problem is often dealt with by using resource-intensive SWAP gates, which, apart from requiring error-prone two-qubit gates, makes the parallelization of gates much more difficult. That is particularly problematic for the scalability of quantum devices beyond the NISQ-era.

An alternative way to address the connectivity issue and, as a side effect, allow for the native implementation of higher-order interactions, was introduced with the Parity Encoding. As outlined in this paper, our team studied the implementation of several essential quantum algorithms using the ParityQC Architecture. In particular, we focused on algorithms essential for Shor’s factoring algorithm: the Quantum Fourier Transform (QFT) and Quantum Addition algorithm, as well as the implementation of Grover’s Diffusion operator.

The results show that embedding these algorithms in the Parity Encoding reduces the circuit depth compared to conventional gate-based implementations, while at the same time keeping the multi-qubit gate counts comparable. Our team also presents a strategy to efficiently prepare graph states, which represent an important resource for measurement-based quantum computing.

Read the paper on Physical Review A

Back to news