We propose a universal gate set for quantum computing with all-to-all connectivity and
intrinsic robustness to bit-flip errors based on parity encoding. We show that logical …

We provide an efficient algorithm to compile quantum circuits for fault-tolerant execution. We
target surface codes, which form a two-dimensional grid of logical qubits with nearest …

We study the problem of implementing arbitrary permutations of qubits under interaction
constraints in quantum systems that allow for arbitrarily fast local operations and classical …

We bound the time necessary to implement the shift unitary on a one-dimensional ring, both
by using local Hamiltonians and those with power-law interactions. This time is constrained …

Efficiently map** quantum circuits onto hardware is integral for the quantum compilation
process, wherein a circuit is modified in accordance with a quantum processor's …

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 …

In quantum communication, the perfect state transfer (PST) is a crucial tool for transferring
information. But it is not readily applicable to communicate between any pair of vertices in an …

In superconducting architectures, limited connectivity remains a significant challenge for the
synthesis and compilation of quantum circuits. We consider models of entanglement …