We consider the problem of map** a logical quantum circuit onto a given hardware with
limited 2-qubit connectivity. We model this problem as an integer linear program, using a …

Fixed-frequency superconducting qubits demonstrate remarkable success as platforms for
stable and scalable quantum computing. Cross-resonance gates have been the workhorse …

The rapid accumulation of big data in the Internet era has gradually decelerated the
progress of Artificial Intelligence (AI). As Moore's Law approaches its limit, it is imperative to …

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 …

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 …

In Noisy Intermediate-Scale Quantum (NISQ) era devices, the output fidelity of a quantum
circuit, under plausible assumptions, decreases exponentially with its size and depth. As …

Due to the short decohorence time of qubits available in the NISQ-era, it is essential to pack
(minimize the size and or the depth of) a logical quantum circuit as efficiently as possible …

We describe a family of recursive methods for the synthesis of qubit permutations on
quantum computers with limited qubit connectivity. Two objectives are of importance: circuit …

We propose a time-independent Hamiltonian protocol for the reversal of qubit ordering in a
chain of N spins. Our protocol has an easily implementable nearest-neighbor, transverse …

The goal in quantum state transfer is to avoid the need to physically transport carriers of
quantum information. This is achieved by using a suitably engineered Hamiltonian that …