An ant colony based mapping of quantum circuits to nearest neighbor architectures

[1]  Robert Wille,et al.  Improved Look-Ahead Approaches for Nearest Neighbor Synthesis of 1D Quantum Circuits , 2019, 2019 32nd International Conference on VLSI Design and 2019 18th International Conference on Embedded Systems (VLSID).

[2]  Gushu Li,et al.  Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices , 2018, ASPLOS.

[3]  Robert Wille,et al.  A Novel Approach for Nearest Neighbor Realization of 2D Quantum Circuits , 2018, 2018 IEEE Computer Society Annual Symposium on VLSI (ISVLSI).

[4]  Robert Wille,et al.  Efficient mapping of quantum circuits to the IBM QX architectures , 2017, 2018 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[5]  Robert Wille,et al.  Exact Global Reordering for Nearest Neighbor Quantum Circuits Using A ^* ∗ , 2017, RC.

[6]  Imtiaz Ahmad,et al.  Harmony-search algorithm for 2D nearest neighbor quantum circuits realization , 2016, Expert Syst. Appl..

[7]  Kamalika Datta,et al.  A Heuristic for Linear Nearest Neighbor Realization of Quantum Circuits by SWAP Gate Insertion Using $N$-Gate Lookahead , 2016, IEEE Journal on Emerging and Selected Topics in Circuits and Systems.

[8]  Kamalika Datta,et al.  Fast Qubit Placement in 2D Architecture Using Nearest Neighbor Realization , 2015, 2015 IEEE International Symposium on Nanoelectronic and Information Systems.

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

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

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

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

[13]  Imtiaz Ahmad,et al.  Line ordering of reversible circuits for linear nearest neighbor realization , 2013, Quantum Information Processing.

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

[15]  Daniel Park,et al.  Recent advances in nuclear magnetic resonance quantum information processing , 2012, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[16]  M. Mariantoni,et al.  Surface codes: Towards practical large-scale quantum computation , 2012, 1208.0928.

[17]  M. Mosca,et al.  A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits , 2012, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

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

[20]  A. Harrow,et al.  Quantum algorithm for linear systems of equations. , 2008, Physical review letters.

[21]  S. Girvin,et al.  Quantum information processing with circuit quantum electrodynamics , 2006, cond-mat/0612038.

[22]  M. Lukin,et al.  Relaxation, dephasing, and quantum control of electron spins in double quantum dots , 2006, cond-mat/0602470.

[23]  O. Gühne,et al.  Scalable multiparticle entanglement of trapped ions , 2005, Nature.

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

[25]  C. Monroe,et al.  Architecture for a large-scale ion-trap quantum computer , 2002, Nature.

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

[27]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[28]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[29]  Barenco,et al.  Elementary gates for quantum computation. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[30]  Kamalika Datta,et al.  A New Heuristic for $N$ -Dimensional Nearest Neighbor Realization of a Quantum Circuit , 2018, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[31]  Robert Wille,et al.  Look-ahead schemes for nearest neighbor optimization of 1D and 2D quantum circuits , 2016, 2016 21st Asia and South Pacific Design Automation Conference (ASP-DAC).

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