Qubit allocation

MY Siraichi, VF Santos, C Collange… - Proceedings of the 2018 …, 2018 - dl.acm.org
In May of 2016, IBM Research has made a quantum processor available in the cloud to the
general public. The possibility of programming an actual quantum device has elicited much …

Introduction to reconfiguration

N Nishimura - Algorithms, 2018 - mdpi.com
Reconfiguration is concerned with relationships among solutions to a problem instance,
where the reconfiguration of one solution to another is a sequence of steps such that each …

On the qubit routing problem

A Cowtan, S Dilkes, R Duncan, A Krajenbrink… - arXiv preprint arXiv …, 2019 - arxiv.org
We introduce a new architecture-agnostic methodology for mapping abstract quantum
circuits to realistic quantum computing devices with restricted qubit connectivity, as …

ARQUIN: Architectures for Multinode Superconducting Quantum Computers

J Ang, G Carini, Y Chen, I Chuang, M Demarco… - ACM Transactions on …, 2024 - dl.acm.org
Many proposals to scale quantum technology rely on modular or distributed designs
wherein individual quantum processors, called nodes, are linked together to form one large …

Circuit transformations for quantum architectures

AM Childs, E Schoute, CM Unsal - arXiv preprint arXiv:1902.09102, 2019 - arxiv.org
Quantum computer architectures impose restrictions on qubit interactions. We propose
efficient circuit transformations that modify a given quantum circuit to fit an architecture …

Qubit allocation as a combination of subgraph isomorphism and token swapping

MY Siraichi, VF Santos, C Collange… - Proceedings of the ACM …, 2019 - dl.acm.org
In 2016, the first quantum processors have been made available to the general public. The
possibility of programming an actual quantum device has elicited much enthusiasm. Yet …

Approximation and hardness for token swapping

T Miltzow, L Narins, Y Okamoto, G Rote… - arXiv preprint arXiv …, 2016 - arxiv.org
Given a graph $ G=(V, E) $ with $ V=\{1,\ldots, n\} $, we place on every vertex a token $
T_1,\ldots, T_n $. A swap is an exchange of tokens on adjacent vertices. We consider the …

Gap preserving reductions between reconfiguration problems

N Ohsaka - arXiv preprint arXiv:2212.04207, 2022 - arxiv.org
Combinatorial reconfiguration is a growing research field studying problems on the
transformability between a pair of solutions of a search problem. We consider the …

The time complexity of the token swapping problem and its parallel variants

J Kawahara, T Saitoh, R Yoshinaka - … March 29–31, 2017, Proceedings 11, 2017 - Springer
The token swapping problem (TSP) and its colored version are reconfiguration problems on
graphs. This paper is concerned with the complexity of the TSP and two new variants; …

Card-based zero-knowledge proof protocols for the 15-puzzle and the token swapping problem

Y Tamura, A Suzuki, T Mizuki - Proceedings of the 11th ACM Asia Public …, 2024 - dl.acm.org
The 15-puzzle is a puzzle game played with 15 square tiles numbered from 1 to 15 on a 4×
4 board. It has been popular for generations because of its simplicity and challenge. The (w× …