Quantum Circuit Placement

Abstract

We study the problem of the practical realization of an abstract quantum circuit when executed on quantum hardware. By practical, we mean adapting the circuit to particulars of the physical environment which restricts/complicates the establishment of certain direct interactions between qubits. This is a quantum version of the classical circuit placement problem. We study the theoretical aspects of the problem and also present empirical results that match the best known solutions that have been developed by experimentalists. Finally, we discuss the efficiency of the approach and scalability of its implementation with regards to the future development of quantum hardware.

15 pages, 4 figures. Improved theory and software implementation, new experimental results

References in corpus (14)

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Scalable multi-particle entanglement of trapped ions
• A geometric theory of non-local two-qubit operations
• Implementation of the Five Qubit Error Correction Benchmark
• Benchmarking quantum control methods on a 12-qubit system
• Hydrogenic Spin Quantum Computing in Silicon: A Digital Approach
• Fast Quantum Modular Exponentiation
• Experimental Realization of an Order-Finding Algorithm with an NMR Quantum Computer
• Approximate Quantum Cloning with Nuclear Magnetic Resonance
• Linear Depth Stabilizer and Quantum Fourier Transformation Circuits with no Auxiliary Qubits in Finite Neighbor Quantum Architectures
• NMR Quantum Computation: a Critical Evaluation
• Using error correction to determine the noise model
• Compiling gate networks on an Ising quantum computer
• Realization of a 5-bit NMR Quantum Computer Using a New Molecular Architecture

Cited by in corpus (43)

• Synthesis and Optimization of Reversible Circuits - A Survey
• Software Mitigation of Crosstalk on Noisy Intermediate-Scale Quantum Computers
• Efficient Distributed Quantum Computing
• Challenges and Opportunities of Near-Term Quantum Computing Systems
• Optimal Layout Synthesis for Quantum Computing
• Optimality Study of Existing Quantum Computing Layout Synthesis Tools
• Requirements for fault-tolerant factoring on an atom-optics quantum computer
• Optimized compiler for Distributed Quantum Computing
• Qubit Mapping Based on Subgraph Isomorphism and Filtered Depth-Limited Search
• Circuit Transformations for Quantum Architectures
• Linear Nearest Neighbor Synthesis of Reversible Circuits by Graph Partitioning
• Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors
• Resource-Efficient Quantum Computing by Breaking Abstractions
• Optimal Qubit Mapping with Simultaneous Gate Absorption
• An $\Theta (\sqrt{n})$-depth Quantum Adder on a 2D NTC Quantum Computer Architecture
• Depth-Optimal Quantum Circuit Placement for Arbitrary Topologies
• Designing calibration and expressivity-efficient instruction sets for quantum computing
• Systems Architecture for Quantum Random Access Memory
• Phase polynomials synthesis algorithms for NISQ architectures and beyond
• Advantages and limitations of quantum routing
• On the Effect of Quantum Interaction Distance on Quantum Addition Circuits
• A SAT approach to the initial mapping problem in SWAP gate insertion for commuting gates
• Design of a Universal Logic Block for Fault-Tolerant Realization of any Logic Operation in Trapped-Ion Quantum Circuits
• Robust Qubit Mapping Algorithm via Double-Source Optimal Routing on Large Quantum Circuits
• Automated Generation of Shuttling Sequences for a Linear Segmented Ion Trap Quantum Computer
• Unitary Entanglement Construction in Hierarchical Networks
• Compilation for Dynamically Field-Programmable Qubit Arrays with Efficient and Provably Near-Optimal Scheduling
• Integrated Analysis of Performance and Resource of Large-Scale Quantum Computing
• QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis
• Using Spectral Graph Theory to Map Qubits onto Connectivity-Limited Devices
• Qubit assignment using time reversal
• MUQUT: Multi-Constraint Quantum Circuit Mapping on Noisy Intermediate-Scale Quantum Computers
• A doubly stochastic matrices-based approach to optimal qubit routing
• Sketching the Best Approximate Quantum Compiling Problem
• Towards Efficient Superconducting Quantum Processor Architecture Design
• Full Characterization of the Depth Overhead for Quantum Circuit Compilation with Arbitrary Qubit Connectivity Constraint
• TILT: Achieving Higher Fidelity on a Trapped-Ion Linear-Tape Quantum Computing Architecture
• Development of Tool for Mapping Conventional Circuit to Reversible Logic
• Error Mitigation in Quantum Computers through Instruction Scheduling
• 2D Qubit Placement of Quantum Circuits using LONGPATH
• Mapping of Topological Quantum Circuits to Physical Hardware
• String Abstractions for Qubit Mapping
• Efficient quantum simulation for translationally invariant systems