A New Approach for Optimization of Distributed Quantum Circuits

In the present work, a novel approach was proposed to optimize the teleportation cost in Distributed Quantum Circuits (DQCs) by applying a new approach. To overcome the difficulty with keeping a large number of qubits next to each other, DQCs, as a well-known solution, have always been employed. In a distributed quantum system, qubits are transferred from a subsystem to another subsystem by a quantum protocol such as teleportation. First, we proposed a heuristic approach through which we could replace the equivalent circuits in the initial quantum circuit. Then, we used a genetic algorithm to partition the placement of qubits so that the number of teleportations could be optimized for the communications of a DQC. Finally, results showed that the proposed approach could impressively work.

[1]  Mikio Nakahara,et al.  Quantum Computing - From Linear Algebra to Physical Realizations , 2008 .

[2]  Gerhard W. Dueck,et al.  Toffoli network synthesis with templates , 2005, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

[4]  Susan Stepney,et al.  Evolving Quantum Circuits and Programs Through Genetic Programming , 2004, GECCO.

[5]  Gerhard W. Dueck,et al.  Quantum circuit simplification using templates , 2005, Design, Automation and Test in Europe.

[6]  J. Yepez.  TYPE-II QUANTUM COMPUTERS , 2001 .

[7]  A. Harrow,et al.  Efficient distributed quantum computing , 2012, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[8]  Charles H. Bennett,et al.  Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. , 1992, Physical review letters.

[9]  Todd A. Brun,et al.  Quantum Computing , 2011, Computer Science, The Hardware, Software and Heart of It.

[10]  Wolfgang Banzhaf,et al.  Comparison of Selection Strategies for Evolutionary Quantum Circuit Design , 2004, GECCO.

[11]  Susan Stepney,et al.  Searching for Quantum Programs and Quantum Protocols , 2008 .

[12]  Mariam Zomorodi-Moghadam,et al.  Optimizing Teleportation Cost in Distributed Quantum Circuits , 2018 .

[13]  Samuel J. Lomonaco, Jr.,et al.  Distributed quantum computing: a distributed Shor algorithm , 2004, SPIE Defense + Commercial Sensing.

[14]  Charles H. Bennett,et al.  Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. , 1993, Physical review letters.

[15]  Peter W. Shor.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1999 .

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

[17]  Chris Heunen,et al.  Automated distribution of quantum circuits via hypergraph partitioning , 2018, Physical Review A.

[18]  Mahboobeh Houshmand,et al.  An Evolutionary Approach to Optimizing Teleportation Cost in Distributed Quantum Computation , 2019, International Journal of Theoretical Physics.

[19]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[20]  J. Cirac,et al.  Distributed quantum computation over noisy channels , 1998, quant-ph/9803017.

[21]  Darrell Whitley,et al.  A genetic algorithm tutorial , 1994, Statistics and Computing.

[22]  Yuan Feng,et al.  An Algebraic Language for Distributed Quantum Computing , 2009, IEEE Transactions on Computers.

[23]  Comment on "Quantum Cryptography with Orthogonal States?" , 1995, Physical review letters.

[24]  Rodney Van Meter,et al.  Arithmetic on a distributed-memory quantum multicomputer , 2006, JETC.

[25]  I. Chuang,et al.  Quantum Computation and Quantum Information: Bibliography , 2010 .

[26]  R. Cleve,et al.  SUBSTITUTING QUANTUM ENTANGLEMENT FOR COMMUNICATION , 1997, quant-ph/9704026.

[27]  Hermann Kampermann,et al.  Quantum cost for sending entanglement. , 2012, Physical review letters.