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 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 …

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 …

Quantum communication represents a revolutionary advancement over classical information
theory, which leverages unique quantum mechanics properties like entanglement to achieve …

Efficiently mapping quantum circuits onto hardware is an integral part of the quantum
compilation process, wherein a quantum circuit is modified in accordance with the stringent …

We show how to realize a general quantum circuit involving gates between arbitrary pairs of
qubits by means of geometrically local quantum operations and efficient classical …

Non-Clifford gates are frequently exclusively implemented on fault-tolerant architectures by
first distilling magic states in specialised magic-state factories. In the rest of the architecture …