Recent advances in quantum computers are demonstrating the ability to solve problems at a
scale beyond brute force classical simulation. As such, a widespread interest in quantum …

We review encoding and hardware-independent formulations of optimization problems for
quantum computing. Using this generalized approach, an extensive library of optimization …

We show that universal parity quantum computing employing a recently introduced constant
depth decoding procedure is equivalent to measurement-based quantum computation …

Motivated by the prospect of a two-dimensional square-lattice geometry for semiconductor
spin qubits, we explore the realization of the parity architecture with quantum dots. We …

We present a formalism based on tracking the flow of parity quantum information to
implement algorithms on devices with limited connectivity without qubit overhead, SWAP …

We present a fault-tolerant universal quantum computing architecture based on a code
concatenation of noise-biased qubits and the parity architecture. The parity architecture can …

Lechner, Hauke, and Zoller proposed a parity-encoded spin-embedding scheme for
quantum annealing (QA) with all-to-all connectivity to avoid the issue of limited connectivity …