A multiobjective approach to linear nearest neighbor optimization for 2D quantum circuits

The linear nearest neighbor (LNN) restriction, present in several current implementations of 1D and 2D quantum circuits, limits the interaction of qubits to those which are adjacent to each other. While there have been several proposals to optimize the process of achieving LNN compliance in 1D circuits, there are few proposals for 2D circuits. Here, we present a new perspective on this problem for 2D quantum circuits. We propose to see this as a multiobjective optimization problem with two objectives: minimizing the size of the 2D grid in the circuit, and minimizing the number of SWAP gates required to achieve LNN compliance. We present some preliminary results which show that these are two contradictory objectives. Since this is common in multiobjective problems, these results indicate that a multiobjective algorithm might be a suitable way to address this problem, since it would make considerations which currently available methods do not make.

[1]  Joaquin Lima,et al.  An Improved Hirata Algorithm for Quantum Circuit LNN Conversion. , 2015 .

[2]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

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

[4]  Robert Wille,et al.  Trading off circuit lines and gate costs in the synthesis of reversible logic , 2014, Integr..

[5]  Frederick W Strauch,et al.  Quantum logic gates for coupled superconducting phase qubits. , 2003, Physical review letters.

[6]  John Gaebler,et al.  Quantum information processing with trapped ions , 2013 .

[7]  Jens Eisert,et al.  Efficient measurement-based quantum computing with continuous-variable systems , 2011, 1112.2641.

[8]  Gary L. Miller,et al.  Proceedings of the twenty-eighth annual ACM symposium on Theory of computing , 1996, STOC 1996.

[9]  Andrew W. Cross,et al.  Demonstration of a quantum error detection code using a square lattice of four superconducting qubits , 2015, Nature Communications.

[10]  Robert Wille,et al.  Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits , 2015, The 20th Asia and South Pacific Design Automation Conference.

[11]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[12]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[13]  Susmita Sur-Kolay,et al.  PAQCS: Physical Design-Aware Fault-Tolerant Quantum Circuit Synthesis , 2015, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

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

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

[16]  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.

[17]  D. Maslov,et al.  Linear depth stabilizer and quantum Fourier transformation circuits with no auxiliary qubits in finite-neighbor quantum architectures , 2007 .

[18]  Carlos A. Brizuela,et al.  A survey on multi-objective evolutionary algorithms for many-objective problems , 2014, Computational Optimization and Applications.

[19]  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).

[20]  Simone Severini,et al.  Translation Techniques Between Quantum Circuit Architectures , 2007 .

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

[22]  R. V. Meter,et al.  Layered architecture for quantum computing , 2010, 1010.5022.

[23]  M. Sipser,et al.  Quantum Computation by Adiabatic Evolution , 2000, quant-ph/0001106.

[24]  Gerhard W. Dueck,et al.  Improved quantum cost for n-bit Toffoli gates , 2003 .

[25]  Stefan Frehse,et al.  RevKit: A Toolkit for Reversible Circuit Design , 2012, J. Multiple Valued Log. Soft Comput..

[26]  O. Gühne,et al.  03 21 7 2 3 M ar 2 00 6 Scalable multi-particle entanglement of trapped ions , 2006 .

[27]  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.

[28]  Igor L. Markov,et al.  Synthesis and optimization of reversible circuits—a survey , 2011, CSUR.

[29]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[30]  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).