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

Shafaei, Alireza; Saeedi, Mehdi; Pedram, Massoud

doi:10.1145/2463209.2488785

Cited by 104 publications

(50 citation statements)

References 26 publications

(39 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It needs to add a SWAP gate between the second line and the third line. The output is (2,3,1,4) T at this point which is same as vector out, so we stop operating. We take the same operations for the rest of the line vectors of quantum gates.…”

Section: Advances In Engineering Research Volume 113mentioning

confidence: 99%

“…In most cases, some commonly used quantum technologies required in LNN (Linear Nearest Neighbor) [1] architecture that qubits are arranged in a line and only adjacent qubits can interact. In order to achieve the LNN constraint of quantum technology and construct quantum circuits for LNN, so far, many related synthesis algorithms for LNN architecture have been put forward [2][3][4][5][6]. To realize the LNN quantum circuit synthesis method, M Saeedi [2] constructed interaction map, and the algorithm transforms optimization for the qubits interact distance into the problem of Minimum Linear Arrangement (MINLA).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Quantum Circuit Synthesis for Linear Nearest Neighbor Based on the Vector Transformation

Lu¹,

Guan²,

Cheng³

et al. 2017

Proceedings of the 2016 International Forum on Mechanical, Control and Automation (IFMCA 2016)

View full text Add to dashboard Cite

Abstract. In this paper, a synthesis method is proposed based on vector transformation for linear nearest neighbor quantum circuits. Its aim is to construct a linear nearest neighbor quantum circuit, and to reduce the quantum cost of the linear reversible circuit. The vector representation of the sequence of the circuit lines and qubits of quantum gate is given in this method. It realizes the nearest neighbor of the quantum circuit by moving the position of the qubits vector elements, and it does not cause confusion due to comparison and transformation of two vector elements in the circuit. The number of SWAP gates needed to make the quantum circuit nearest neighbors is given, and its correctness is proven. Compared with the current quantum circuit synthesis algorithms, the average optimization rate of the quantum cost is 39.69% for typical benchmark circuits. The algorithm can be applied to all quantum circuits of 2-qubit quantum gates, and can be used in large quantum circuits.

show abstract

Section: Advances In Engineering Research Volume 113mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Quantum Circuit Synthesis for Linear Nearest Neighbor Based on the Vector Transformation

Lu¹,

Guan²,

Cheng³

et al. 2017

Proceedings of the 2016 International Forum on Mechanical, Control and Automation (IFMCA 2016)

View full text Add to dashboard Cite

show abstract

“…The majority of them focused on 1D quantum circuits and applied strategies such as the re-ordering of qubit positions [5] , window-based heuristics [7], or mapping the problem to a corresponding graph arrangement prob lem [4] . While these approaches lead to heuristic solutions only, an exact approach guaranteeing the minimal number of SWAP insertions has recently been proposed in [8,9].…”

Section: A Related Work and Considered Problemmentioning

confidence: 99%

“…In particular, reordering the qubit positions or considering SWAP gate insertion not only locally for each single gate but for the whole cascade may reduce the costs signifi cantly. Hence, several approaches on determining good SWAP gate insertions have been proposed in the past [4,5,6,7,8,9] .…”

Section: Introductionmentioning

confidence: 99%

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

Lye

Wille

Drechsler

2015

The 20th Asia and South Pacific Design Automation Conference

View full text Add to dashboard Cite

Motivated by the promises of significant speed-ups for certain problems, quantum computing received significant attention in the past. While much progress has been made in the development of synthesis methods for quantum cir cuits, new physical developments constantly lead to new constraints to be addressed. The limited interaction dis tance between the respective qubits (i.e. nearest neigh bor optimization) has already been considered intensely. But with the emerge of multi-dimensional quantum ar chitectures, new physical requirements came up for which only a few automatic synthesis solutions exist yet -all of them of heuristic nature. In this work, we propose an exact scheme for nearest neighbor optimization in multi dimensional quantum circuits. Although the complexity of the problem is a serious obstacle, our experimental eval uation shows that the proposed solution is sufficient to allow for a qualitative evaluation of the respective opti mization steps. Besides that, this enabled an exact com parison to heuristical results for the first time.978-1-4799-7792-5/15/$31.00 ©2015 IEEE

show abstract

“…be applied for nearest neighbor optimization (see e.g. [24][25][26][27]). Here, control and target line connections always have to be adjacent, i.e.…”

Section: The Revvis Toolmentioning

confidence: 99%

RevVis: Visualization of Structures and Properties in Reversible Circuits

Wille

Stoppe

Schönborn

et al. 2014

Reversible Computation

View full text Add to dashboard Cite

Abstract. The recent interest in reversible computation led to plenty of (automatic) approaches for the design of the corresponding circuits. While this automation is desired in order to provide a proper support for the design of complex functionality, often a manual consideration and human intuition enable improvements or provide new ideas for design solutions. However, this manual interaction requires a good understanding of the structure or the properties of a reversible cascade which, with increasing circuit size, becomes harder to grasp. Visualization techniques that abstract irrelevant details and focus on intuitively displaying important structures or properties provide a solution to this problem and have already successfully been applied in other domains such as design of conventional software, hardware debugging, or Boolean satisfiability. In this work, we introduce RevVis, a graphical interface which visualizes structures and properties of reversible circuits. RevVis collects relevant data of a given reversible cascade and presents it in a simple but intuitive fashion. By this, RevVis unveils information on characteristic structures and properties of reversible circuits that could be utilized for further optimization. A case study demonstrates this by considering circuits obtained from several synthesis approaches.

show abstract

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

Cited by 104 publications

References 26 publications

Quantum Circuit Synthesis for Linear Nearest Neighbor Based on the Vector Transformation

Quantum Circuit Synthesis for Linear Nearest Neighbor Based on the Vector Transformation

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

RevVis: Visualization of Structures and Properties in Reversible Circuits

Contact Info

Product

Resources

About