We review the mathematical speed limits on quantum information processing in many-body
systems. After the proof of the Lieb–Robinson Theorem in 1972, the past two decades have …

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 …

The swap gate is a ubiquitous tool for moving information on quantum hardware, yet it can
be considered a classical operation because it does not entangle product states. Genuinely …

The speed of light $ c $ sets a strict upper bound on the speed of information transfer in both
classical and quantum systems. In nonrelativistic quantum systems, the Lieb-Robinson …

A limited number of qubits, high error rates, and limited qubit connectivity are major
challenges for effective near-term quantum computations. Quantum circuit partitioning …

Gate-level quantum circuits are often derived manually from higher level algorithms. While
this suffices for small implementations and demonstrations, ultimately automatic circuit …

Towards the practical use of quantum computers in the NISQ era, as well as the realization
of fault-tolerant quantum computers that utilize quantum error correction codes, pressing …

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 …

Geometric locality is an important theoretical and practical factor for quantum low-density
parity-check (qLDPC) codes which affects code performance and ease of physical …

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 …