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

Ensuring nearest neighbor compliance of quantum circuits by inserting SWAP gates has heavily been considered in the past. Here, quantum gates are considered which work on non-adjacent qubits. SWAP gates are applied in order to “move” these qubits onto adjacent positions. However, a decision how exactly the SWAPs are “moved” has mainly been made without considering the effect a “movement” of qubits may have on the remaining circuit. In this work, we propose a methodology for nearest neighbor optimization which addresses this problem by means of a look-ahead scheme. To this end, two representative implementations are presented and discussed in detail. Experimental evaluations show that, in the best case, reductions in the number of SWAP gates of 56% (compared to the state-of-the-art methods) can be achieved following the proposed methodology.

[1]  Robert Wille,et al.  Optimal SWAP gate insertion for nearest neighbor quantum circuits , 2014, 2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC).

[2]  Krysta Marie Svore,et al.  A 2D nearest-neighbor quantum architecture for factoring in polylogarithmic depth , 2012, Quantum Inf. Comput..

[3]  Ying Li,et al.  Topological quantum computing with a very noisy network and local error rates approaching one percent , 2012, Nature Communications.

[4]  Andrew W. Cross,et al.  Implementing a strand of a scalable fault-tolerant quantum computing fabric , 2013, Nature Communications.

[5]  A. Fowler,et al.  Quantum-error correction on linear-nearest-neighbor qubit arrays , 2003, quant-ph/0311116.

[6]  Robert Wille,et al.  RevLib: An Online Resource for Reversible Functions and Reversible Circuits , 2008, 38th International Symposium on Multiple Valued Logic (ismvl 2008).

[7]  Masaki Nakanishi,et al.  An Efficient Method to Convert Arbitrary Quantum Circuits to Ones on a Linear Nearest Neighbor Architecture , 2009, 2009 Third International Conference on Quantum, Nano and Micro Technologies.

[8]  Robert Wille,et al.  Synthesis of quantum circuits for linear nearest neighbor architectures , 2011, Quantum Inf. Process..

[9]  Mikio Nakahara,et al.  Two-Qubit Gate Operation on Selected Nearest-Neighbor Neutral Atom Qubits , 2013, 1310.6112.

[10]  Preethika Kumar.  Efficient quantum computing between remote qubits in linear nearest neighbor architectures , 2013, Quantum Inf. Process..

[11]  Robert Wille,et al.  Exact Reordering of Circuit Lines for Nearest Neighbor Quantum Architectures , 2014, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[12]  Lian-Ao Wu,et al.  Quantum simulation of pairing Hamiltonians with nearest-neighbor-interacting qubits , 2016 .

[13]  A. G. Fowler,et al.  Two-dimensional architectures for donor-based quantum computing , 2006 .

[14]  M. Wallquist,et al.  Superconducting qubit network with controllable nearest-neighbour coupling , 2005, cond-mat/0504250.

[15]  J. P. Dehollain,et al.  An addressable quantum dot qubit with fault-tolerant control-fidelity. , 2014, Nature nanotechnology.

[16]  Alireza Shafaei,et al.  Qubit placement to minimize communication overhead in 2D quantum architectures , 2014, 2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC).

[17]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[18]  Rainer Blatt,et al.  Two-dimensional arrays of radio-frequency ion traps with addressable interactions , 2011, 1103.5428.

[19]  Alireza Shafaei,et al.  Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures , 2013, 2013 50th ACM/EDAC/IEEE Design Automation Conference (DAC).

[20]  Shigeru Yamashita,et al.  Changing the Gate Order for Optimal LNN Conversion , 2011, RC.