Using Spectral Graph Theory to Map Qubits onto Connectivity-Limited Devices
TLDR
An efficient heuristic for mapping the logical qubits of quantum algorithms to the physical qubitsof connectivity-limited devices is proposed, adding a minimal number of connectivity-compliant SWAP gates.Abstract:
We propose an efficient heuristic for mapping the logical qubits of quantum algorithms to the physical qubits of connectivity-limited devices, adding a minimal number of connectivity-compliant SWAP gates. In particular, given a quantum circuit, we construct an undirected graph with edge weights a function of the two-qubit gates of the quantum circuit. Taking inspiration from spectral graph drawing, we use an eigenvector of the graph Laplacian to place logical qubits at coordinate locations. These placements are then mapped to physical qubits for a given connectivity. We primarily focus on one-dimensional connectivities, and sketch how the general principles of our heuristic can be extended for use in more general connectivities.read more
Citations
More filters
Journal ArticleDOI
Qubit Mapping Based on Subgraph Isomorphism and Filtered Depth-Limited Search
TL;DR: This paper proposes an efficient method by selecting an initial mapping that takes into consideration the similarity between the architecture graph of the given NISQ device and a graph induced by the input logical circuit, and searching for a most useful SWAP combination that makes executable as many as possible two-qubit gates in the logical circuit.
Proceedings ArticleDOI
Realizing quantum algorithms on real quantum computing devices
TL;DR: This paper provides an introduction and overview into this domain and describes corresponding methods, also referred to as compilers, mappers, synthesizers, transpilers, or routers.
Journal ArticleDOI
Qubit Mapping Based on Subgraph Isomorphism and Filtered Depth-Limited Search
TL;DR: In this paper, the authors proposed a SWAP-based algorithm for logical quantum circuits to Noisy Intermediate-Scale Quantum (NISQ) devices, which takes into account the similarity between the architecture graph of the given NISQ device and a graph induced by the input logical circuit and searches for a most useful SWAP combination that makes executable as many as possible two-qubit gates in the logical circuit.
Proceedings ArticleDOI
Quantum circuit optimization for multiple QPUs using local structure
TL;DR: This work considers simple strategies of using EPR-mediated remote gates and teleporting qubits between clusters as necessary and develops optimizations at compile-time that leverage local structure in a quantum circuit so as to minimize inter-cluster operations at runtime.
Journal ArticleDOI
An improved heuristic technique for nearest neighbor realization of quantum circuits in 2D architecture
Anirban Bhattacharjee,Chandan Bandyopadhyay,Philipp Niemann,Bappaditya Mondal,Rolf Drechsler,Hafizur Rahaman +5 more
TL;DR: A heuristic design technique for efficient transformation of quantum circuits to NN based designs in 2D configuration based on initial qubit mapping policy is shown.
References
More filters
Journal ArticleDOI
Quantum Mechanics Helps in Searching for a Needle in a Haystack
TL;DR: In this article, a phone directory containing $N$ names arranged in completely random order is presented, and the desired phone number can be obtained in only O(sqrt{N})$ accesses to the database.
Journal ArticleDOI
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
TL;DR: In this paper, the authors considered factoring integers and finding discrete logarithms, two problems that are generally thought to be hard on classical computers and that have been used as the basis of several proposed cryptosystems.
Posted Content
A Quantum Approximate Optimization Algorithm
TL;DR: A quantum algorithm that produces approximate solutions for combinatorial optimization problems that depends on a positive integer p and the quality of the approximation improves as p is increased, and is studied as applied to MaxCut on regular graphs.
Proceedings ArticleDOI
RevLib: An Online Resource for Reversible Functions and Reversible Circuits
TL;DR: RevLib is introduced, an online resource for reversible functions and reversible circuits that provides a large database of functions with respective circuit realizations and tools are introduced to support researchers in evaluating their algorithms and documenting their results.
Proceedings ArticleDOI
Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices
Gushu Li,Yufei Ding,Yuan Xie +2 more
TL;DR: A SWAP-based Bidirectional heuristic search algorithm (SABRE) is proposed, applicable to NISQ devices with arbitrary connections between qubits, which outperforms the best known algorithm with exponential speedup and comparable or better results on various benchmarks.