• Corpus ID: 3090677

Depth-Optimal Quantum Circuit Placement for Arbitrary Topologies

  title={Depth-Optimal Quantum Circuit Placement for Arbitrary Topologies},
  author={Debjyoti Bhattacharjee and Anupam Chattopadhyay},
A significant hurdle towards realization of practical and scalable quantum computing is to protect the quantum states from inherent noises during the computation. [] Key Method We present an Integer Linear Programming (ILP) formulation for achieving minimal logical depth while guaranteeing the nearest neighbor arrangement between the interacting qubits. We substantiate our claim with studies on diverse network topologies and prominent quantum circuit benchmarks.

Swap Minimization in Nearest Neighbour Quantum Circuits: An ILP Formulation

A review of the literature solving approaches for the swap minimization problem in quantum circuits and an integer linear programming formulation for it is proposed and some preliminary results on small test instances are given.

Generalized swap networks for near-term quantum computing

This work addresses the routing problem for families of quantum circuits defined by a hypergraph wherein each hyperedge corresponds to a potential gate and achieves optimal scaling in the case where gates acting on all $\binom{n}{k}$ sets of qubits are desired.

A Hardware-Aware Heuristic for the Qubit Mapping Problem in the NISQ Era

Evaluation results on IBM quantum hardware show that the proposed hardware-aware (HA) mapping transition algorithm can outperform the state of the art, both in terms of the number of additional gates and circuit fidelity.

Mapping Quantum Circuits in IBM Q Devices Using Progressive Qubit Assignment for Global Ordering

One major challenge in executing a quantum circuit is the restriction on physical qubit interaction. The elementary gates in a quantum circuit must strictly conform to the hardware’s qubit coupling

Compiling NCV Quantum Circuits for Nearest Neighbour Realization

  • C. LalengmawiaA. Chakrabarty
  • Physics
    2020 International Conference on Emerging Trends in Information Technology and Engineering (ic-ETITE)
  • 2020
Quantum computers that are based on superconducting and quantum dots have a fundamental requirement called Nearest Neighbour (NN) constraint satisfaction. They require interacting qubits to be

Qubit Mapping and Routing via MaxSAT

This paper presents a novel approach for optimally solving the qubit mapping and routing problem via a reduction to maximum satisfiability (MAXSAT) and presents two novel relaxation ideas that shrink the size of the MAXSAT constraints by exploiting the structure of a quantum circuit.

MUQUT: Multi-Constraint Quantum Circuit Mapping on Noisy Intermediate-Scale Quantum Computers

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.

Technique for two-dimensional nearest neighbour realisation of quantum circuits using weighted look-ahead

: Quantum computers that are based on technologies like superconducting and quantum dots impose a physical constraint that requires interacting qubits to be adjacent. The initial placement of qubits

Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices

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.

MUQUT: Multi-Constraint Quantum Circuit Mapping on NISQ Computers: Invited Paper

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.



Nearest-Neighbor and Fault-Tolerant Quantum Circuit Implementation

This work proposes a novel mapping of Multiple-Control Toffoli (MCT) gates to Clifford+T group gates, which achieves lower gate count compared to earlier work and shows a generic way to convert any Clifford-T circuit into a nearest neighbor one.

Linear Nearest Neighbor Synthesis of Reversible Circuits by Graph Partitioning

This work presents a graph partitioning based approach for LNN synthesis with reduction in circuit cost and the number of SWAP gates required to convert a given gate-level quantum circuit to its equivalent LNN configuration is minimized.

Co-Designing a Scalable Quantum Computer with Trapped Atomic Ions

This article shows how a modular quantum computer of any size can be engineered from ion crystals, and how the wiring between ion trap qubits can be tailored to a variety of applications and quantum computing protocols.

Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits

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.

A Heuristic for Linear Nearest Neighbor Realization of Quantum Circuits by SWAP Gate Insertion Using $N$-Gate Lookahead

This paper considers a quantum circuit based on the NCV library, and proposes a better SWAP gate insertion method based on local ordering that uses an N-gate lookahead approach to reduce cost.

An efficient conversion of quantum circuits to a linear nearest neighbor architecture

This paper gives an efficient conversion technique to convert quantum circuits to an LNN architecture and introduces two key theorems that may be interesting on theirown.

Surface codes: Towards practical large-scale quantum computation

The concept of the stabilizer, using two qubits, is introduced, and the single-qubit Hadamard, S and T operators are described, completing the set of required gates for a universal quantum computer.

Qubit placement to minimize communication overhead in 2D quantum architectures

Regular, local-neighbor topologies of quantum architectures restrict interactions to adjacent qubits, which in turn increases the latency of quantum circuits mapped to these architectures. To

Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures

Optimization of the interaction distance between qubits to map a quantum circuit into one-dimensional quantum architectures is addressed and a lookahead technique is applied to improve the cost of the proposed solution.

Look-ahead schemes for nearest neighbor optimization of 1D and 2D quantum circuits

This work proposes a methodology for nearest neighbor optimization which addresses this problem by means of a look-ahead scheme and shows that reductions in the number of SWAP gates of 56% can be achieved following the proposed methodology.