An Efficient Method for Quantum Circuit Placement Problem on a 2-D Grid

2019 ◽  
pp. 162-168
Author(s):  
Atsushi Matsuo ◽  
Shigeru Yamashita
Keyword(s):  
Efficient Method ◽  
Quantum Circuit ◽  
Placement Problem ◽  
Circuit Placement

scholarly journals Efficient implementation of quantum circuits with limited qubit interactions

2017 ◽  
Vol 17 (13&14) ◽  
pp. 1096-1104
Author(s):  
Stephen Brierley
Keyword(s):  
Quantum Computing ◽  
Efficient Method ◽  
Quantum Circuit ◽  
Efficient Implementation ◽  
Circuit Model ◽  
Quantum Circuits ◽  
Interaction Graph ◽  
Time Overhead

The quantum circuit model allows gates between any pair of qubits yet physical instantiations allow only limited interactions. We address this problem by providing an interaction graph together with an efficient method for compiling quantum circuits so that gates are applied only locally. The graph requires each qubit to interact with 4 other qubits and yet the time-overhead for implementing any n-qubit quantum circuit is 4 log n. Building a network of quantum computing nodes according to this graph enables the network to emulate a single monolithic device with minimal overhead.

scholarly journals Quantum Circuit Placement

2008 ◽  
Vol 27 (4) ◽  
pp. 752-763 ◽  
Author(s):  
Dmitri Maslov ◽  
Sean M. Falconer ◽  
Michele Mosca
Keyword(s):  
Quantum Circuit ◽  
Circuit Placement

A PLACEMENT FLOW FOR VERY LARGE-SCALE MIXED-SIZE CIRCUIT PLACEMENT

2014 ◽  
Vol 23 (02) ◽  
pp. 1450016
Author(s):  
JIANLI CHEN ◽  
WENXING ZHU
Keyword(s):  
Integrated Circuit ◽  
Large Scale ◽  
Main Idea ◽  
Placement Problem ◽  
Circuit Element ◽  
Solution Quality ◽  
Macro Cell ◽  
Circuit Elements ◽  
Cell Placement ◽  
Circuit Placement

The very large-scale integrated circuit (VLSI) placement problem is to determine the exact location of each movable circuit element within a given region. It is a crucial process in physical design, since it affects performance, power consumption, routability, and heat distribution of a design. In this paper, we propose a VLSI placement flow to handle the large-scale mixed-size placement problem. The main idea of our placement flow is using a floorplanning algorithm to guide the placement of circuit elements. It consists of four steps: (1) With the multilevel framework, circuit elements are clustered into blocks by recursively partitioning; (2) a floorplanning algorithm is performed on every level of the blocks; (3) the macro cells are shifted by a macro shifting technique to determine their exact locations; (4) with each macro cell location fixed, a standard cell placement algorithm is applied to place the remaining objects. The proposed approach is tested on the IBM mixed-size benchmarks and the modern mixed-size (MMS) placement benchmarks. Experimental results show that our approach outperforms the state-of-the-art placers on the solution quality for most of the benchmarks.

scholarly journals A Degree-Based Clustering Technique for VLSI Placement

2009 ◽  
Vol 3 (3) ◽  
pp. 425-441
Author(s):  
Jie Huang ◽  
Laleh Behjat ◽  
Logan Rakai ◽  
Jianhua Li
Keyword(s):  
Clustering Algorithm ◽  
Wire Length ◽  
Placement Problem ◽  
Clustering Technique ◽  
Length Data ◽  
Circuit Placement ◽  
High Degree

In this paper, clustering for the circuit placement problem is examined from the perspective of wire length contribution from groups of nets. First, the final wire length data of groups of nets with different degrees are extracted and studied. It is illustrated that nets with high-degree contribute a high percentage to the total wire length. To remedy this problem, a clustering algorithm for placement is proposed that focuses on clustering nets with high-degree. This new clustering algorithm is implemented as a preprocessing step in the placement stage. ICCAD04 benchmark circuits abstracted from IBM are used to validate the placement quality by using four academic placers with and without the proposed preprocessing step. Experiments show that the overall placement results can be improved by up to 5%.

scholarly journals Quantum circuit placement

2007 ◽  
Author(s):  
Dmitri Maslov ◽  
Sean M. Falconer ◽  
Michele Mosca
Keyword(s):  
Quantum Circuit ◽  
Circuit Placement
Sign in / Sign up

Export Citation Format

Share Document