Circuit Transformations for Quantum Architectures

Understand

Quantum computer architectures impose restrictions on qubit interactions.

• We propose efficient circuit transformations that modify a given quantum circuit to fit an architecture, allowing for any initial and final mapping of circuit qubits to architecture qubits.
• To achieve this, we first consider the qubit movement subproblem and use the routing via matchings framework to prove tighter bounds on parallel routing.
• In practice, we only need to perform partial permutations, so we generalize routing via matchings to that setting.