Advances in quantum computation and quantum technologies: A design automation perspective
Universal and fault-tolerant quantum computation is a promising new paradigm that may
efficiently conquer difficult computation tasks beyond the reach of classical computation. It …
efficiently conquer difficult computation tasks beyond the reach of classical computation. It …
Recursive methods for synthesizing permutations on limited-connectivity quantum computers
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 …
quantum computers with limited qubit connectivity. Two objectives are of importance: circuit …
Optimizing quantum circuit synthesis for permutations using recursion
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 …
quantum computers with limited qubit connectivity. Two objectives are of importance: circuit …
Tweedledum: a compiler companion for quantum computing
B Schmitt, G De Micheli - 2022 Design, Automation & Test in …, 2022 - ieeexplore.ieee.org
This work presents tweedledum-an extensible open-source library aiming at narrowing the
gap between high-level algorithms and physical devices by enhancing the expressive …
gap between high-level algorithms and physical devices by enhancing the expressive …
Improved Hardness-of-Approximation for Token Swapping
S Hiken, N Wein - arXiv preprint arXiv:2410.19638, 2024 - arxiv.org
We study the token swapping problem, in which we are given a graph with an initial
assignment of one distinct token to each vertex, and a final desired assignment (again with …
assignment of one distinct token to each vertex, and a final desired assignment (again with …