Optimality Study of Existing Quantum Computing Layout Synthesis Tools

@article{Tan2021OptimalitySO,
  title={Optimality Study of Existing Quantum Computing Layout Synthesis Tools},
  author={Bochen Tan and Jason Cong},
  journal={IEEE Transactions on Computers},
  year={2021},
  volume={70},
  pages={1363-1373}
}
  • Bochen Tan, J. Cong
  • Published 22 February 2020
  • Computer Science, Physics
  • IEEE Transactions on Computers
Layout synthesis, an important step in quantum computing, processes quantum circuits to satisfy device layout constraints. In this paper, we construct QUEKO benchmarks for this problem, which have known optimal depths and gate counts. We use QUEKO to evaluate the optimality of current layout synthesis tools, including Cirq from Google, Qiskit from IBM, <inline-formula><tex-math notation="LaTeX">$\mathsf {t}|\mathsf {ket}\rangle$</tex-math><alternatives><mml:math><mml:mrow><mml:mi mathvariant… Expand
Optimal Layout Synthesis for Quantum Computing
  • Bochen Tan, J. Cong
  • Computer Science, Physics
  • 2020 IEEE/ACM International Conference On Computer Aided Design (ICCAD)
  • 2020
TLDR
Two synthesizers are presented, one optimal and one approximate but nearly optimal, which outperforms some leading heuristic approaches and reduces time and space complexity exponentially compared to some leading optimal approaches to layout synthesis. Expand
Machine Learning Optimization of Quantum Circuit Layouts
TLDR
This work introduces QXX, a novel search-based layout method, which includes a configurable Gaussian function used to estimate the depth of the generated circuits and determine the circuit region that influences most the depth, and presents empiric evidence for the feasibility of learning the layout method using approximation. Expand
Special-Purpose Quantum Processor Design
Full connectivity of qubits is necessary for most quantum algorithms, which is difficult to directly implement on Noisy Intermediate-Scale Quantum processors. However, inserting swap gate to enableExpand
On the realistic worst case analysis of quantum arithmetic circuits
TLDR
It is shown systematically that for a practically significant range of circuit widths, ripple-carry addition circuits are more resource efficient than the carry-lookahead addition ones. Expand
Qraft: reverse your Quantum circuit and know the correct program output
TLDR
This work proposes the first work, QRAFT, to leverage the reversibility property of quantum algorithms to considerably reduce the error beyond the reduction achieved by effective circuit mapping. Expand
Using Reinforcement Learning to Perform Qubit Routing in Quantum Compilers
TLDR
A qubit routing procedure that uses a modified version of the deep Q-learning paradigm is proposed that is able to outperform the qu bit routing procedures from two of the most advanced quantum compilers currently available, on both random and realistic circuits, across near-term architecture sizes. Expand
Using Reinforcement Learning to Performbit Routing in antum Compilers
“‹bit routing” refers to the task of modifying quantum circuits so that they satisfy the connectivity constraints of a target quantum computer. Œis involves inserting SWAP gates into the circuit soExpand
A Noise-Aware Qubit Mapping Algorithm Evaluated via Qubit Interaction-Graph Criteria
Matthew Steinberg, Sebastian Feld, Carmen G. Almudever, Michael Marthaler, and Jan-Michael Reiner QuTech, Delft University of Technology, Delft, the Netherlands Quantum and Computer EngineeringExpand
A Quantum Circuit Optimization Framework Based on Pattern Matching
TLDR
The result shows that PaF provides a maximal speedup of [Formula: see text] by using few patterns, and a general pattern description format is proposed to make rewriting patterns in existing work become machine-readable. Expand
A Variation-Aware Quantum Circuit Mapping Approach Based on Multi-agent Cooperation
  • Pengcheng Zhu, Weiping Ding, Lihua Wei, Zhijin Guan, Shiguang Feng
  • Physics
  • 2021
The quantum circuit mapping approach is an indispensable part of the software stack for the noisy intermediatescale quantum device. It has a significant impact on the reliability of computationalExpand
...
1
2
...

References

SHOWING 1-10 OF 41 REFERENCES
Automated optimization of large quantum circuits with continuous parameters
TLDR
An automated methods for optimizing quantum circuits of the size and type expected in quantum computations that outperform classical computers are developed and implemented and a collection of fast algorithms capable of optimizing large-scale quantum circuits are reported. Expand
MUQUT: Multi-Constraint Quantum Circuit Mapping on NISQ Computers: Invited Paper
TLDR
This work extends the technology mapping flows to simultaneously consider the topology and gate fidelity constraints while keeping logical depth and gate count as optimization objectives, and provides a comprehensive problem formulation and multi-tier approach towards solving it. Expand
Full-Stack, Real-System Quantum Computer Studies: Architectural Comparisons and Design Insights
TLDR
This work has built the first top-to- bottom toolflow to target different qubit device technologies, including superconducting and trapped ion qubits which are the current QC front-runners, and demonstrates that leveraging microarchitecture details in the compiler improves program success rate. Expand
Automated generation of layout and control for quantum circuits
TLDR
This work investigates grid-based layouts and proposes two polynomial-time design heuristics: a greedy algorithm suitable for small, congestion-free quantum circuits and a dataflow-based analysis approach to placement and routing with implicit initial placement of qubits. Expand
Compiling Quantum Circuits to Realistic Hardware Architectures using Temporal Planners
TLDR
This work investigates the application of temporal planners to the problem of compiling quantum circuits to newly emerging quantum hardware, and generates a test suite of compilation problems for QAOA circuits of various sizes to a realistic hardware architecture. Expand
Mapping Quantum Circuits to IBM QX Architectures Using the Minimal Number of SWAP and H Operations
TLDR
This work provides a method that maps quantum circuits to IBM's QX architectures with a minimal number of SWAP and H operations, and shows by experimental evaluation that the number of operations added by IBM’s heuristic solution exceeds the lower bound by more than 100% on average. Expand
Compiling SU(4) quantum circuits to IBM QX architectures
TLDR
This work analyzes the bottlenecks of existing compilers and provides a dedicated method for compiling this kind of circuits to IBM QX architectures and shows that the proposed approach significantly outperforms IBM's own solution regarding fidelity of the compiled circuit as well as runtime. Expand
Circuit Transformations for Quantum Architectures
TLDR
This work first considers the qubit movement subproblem and uses the routing via matchings framework to prove tighter bounds on parallel routing, and gives new routing procedures for common architecture graphs and for the generalized hierarchical product of graphs, which produces subgraphs of the Cartesian product. Expand
Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits
TLDR
This work proposes an exact scheme for nearest neighbor optimization in multi-dimensional quantum circuits and shows that the proposed solution is sufficient to allow for a qualitative evaluation of the respective optimization steps. Expand
Improved Mapping of Quantum Circuits to IBM QX Architectures
TLDR
The proposed approach encompasses the selection of physical qubits, determining initial and local permutations efficiently to obtain the final circuit mapped to the given IBM QX architecture, and improvements are observed over existing methods in terms of the number of gates and circuit depth. Expand
...
1
2
3
4
5
...