Quantum computers are expected to surpass the computational capabilities of classical
computers during this decade and have transformative impact on numerous industry sectors …

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

Constrained optimization problems are ubiquitous in science and industry. Quantum
algorithms have shown promise in solving optimization problems, yet none of the current …

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

We introduce parity quantum optimization with the aim of solving optimization problems
consisting of arbitrary $ k $-body interactions and side conditions using planar quantum chip …

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 …

Constraints make hard optimization problems even harder to solve on quantum devices
because they are implemented with large energy penalties and additional qubit overhead …

We show how to efficiently decompose a parameterized multi-qubit Pauli (PMQP) gate into
native parameterized two-qubit Pauli (P2QP) gates minimizing both the circuit depth and the …

We present tools and methods to generalize parity compilation to digital quantum computing
devices with arbitrary connectivity graphs and construct circuit implementations for the …