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

Rapid progress in the CMOS technology for the past 25 years has increased the
vulnerability of processors towards faults. Subsequently, focus of computer architects shifted …

Solving optimization problems on near term quantum devices requires developing error
mitigation techniques to cope with hardware decoherence and dephasing processes. We …

We report results for the computation of relativistic effects in quantum many-body systems
using quantum annealers. An average accuracy of 98.9% in the fine-structure splitting of …

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

We present a protocol to encode and decode arbitrary quantum states in the parity
architecture with constant circuit depth using measurements, local nearest-neighbor and …

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 tools and methods to generalize parity compilation to digital quantum computing
devices with arbitrary connectivity graphs and construct circuit implementations for the …

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 …

Evidence is presented for a reentrant quantum paraelectric (QPE) state preceded by a
dipole glass (DG) phase with a nonclassical exponent in the quantum critical regime of SrF e …