{"type":"ScholarlyArticle","title":"Temporal Planning for Compilation of Quantum Approximate Optimization Circuits","authors":[{"name":"Davide Venturelli","slug":"davide-venturelli","given":"Davide","family":"Venturelli","affiliation":"Quantum Artificial Intelligence Laboratory , NASA Ames Research Center; USRA Research Institute for Advanced Computer Science (RIACS)"},{"name":"Minh Do","slug":"minh-do","given":"Minh","family":"Do","affiliation":"Planning and Scheduling Group , NASA Ames Research Center; Stinger Ghaffarian Technologies (SGT Inc.)"},{"name":"Eleanor Rieffel","slug":"eleanor-rieffel","given":"Eleanor","family":"Rieffel","affiliation":"Quantum Artificial Intelligence Laboratory , NASA Ames Research Center"},{"name":"Jeremy Frank","slug":"jeremy-frank","given":"Jeremy","family":"Frank","affiliation":"Planning and Scheduling Group , NASA Ames Research Center"}],"abstract":"We investigate the application of temporal planners to the problem of compiling quantum circuits to emerging quantum hardware.  While our approach is general, we focus our initial experiments on Quantum Approximate Optimization Algorithm (QAOA) circuits that have few ordering constraints and thus allow highly parallel plans. We report on experiments using several temporal planners to compile circuits of various sizes to a realistic hardware architecture. This early empirical evaluation suggests that temporal planning is a viable approach to quantum circuit compilation.","doi":"10.24963/ijcai.2017/620","url":"https://ijcai.org/proceedings/2017/620","pdf":"https://ijcai.org/proceedings/2017/0620.pdf","markdown":"https://ijcai.org/proceedings/2017/620.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/620","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Planning and Scheduling","track":"Main track","number":620,"pages":{"first":4440,"last":4446},"keywords":["Planning and Scheduling: Applications of Planning","Planning and Scheduling: Temporal and Hybrid planning"],"videos":[],"references":[{"position":1,"raw":"[Barends et al., 2016] R. Barends, A. Shabani, L. Lamata, J. Kelly, A. Mezzacapo, U. Las Heras, R. Babbush, A. G. Fowler, B. Campbell, Y. Chen, et al. Digitized adiabatic quantum com- puting with a superconducting circuit. Nature, 534(7606):222- 226, 2016.","title":"Digitized adiabatic quantum computing with a superconducting circuit","authors":"R Barends, A Shabani, L Lamata, J Kelly, A Mezzacapo, U Las, R Heras, A G Babbush, B Fowler, Y Campbell, Chen","year":"2016","venue":"Nature","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Beals et al., 2013] R. Beals, S. Brierley, O. Gray, A. W. Harrow, S. Kutin, N. Linden, D. Shepherd, and M. Stather. Efficient dis- tributed quantum computing. Proceedings of the Royal Society A., 469(2153):767 -790, 2013.","title":"Efficient distributed quantum computing","authors":"R Beals, S Brierley, O Gray, A W Harrow, S Kutin, N Linden, D Shepherd, M Stather","year":"2013","venue":"Proceedings of the Royal Society A","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bhattacharjee and Chattopadhyay, 2017] Debjyoti Bhattachar- jee and Anupam Chattopadhyay. Depth-optimal quantum circuit placement for arbitrary topologies. arXiv preprint arXiv:1703.08540, 2017.","title":"Debjyoti Bhattacharjee and Anupam Chattopadhyay. Depth-optimal quantum circuit placement for arbitrary topologies","authors":"Chattopadhyay Bhattacharjee","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bishop, 2017] Lev S Bishop. Qasm 2.0: A quantum circuit inter- mediate representation. Bulletin of the American Physical Soci- ety, 62, 2017.","title":"Lev S Bishop. Qasm 2.0: A quantum circuit intermediate representation","authors":"Bishop","year":"2017","venue":"Bulletin of the American Physical Society","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Boxio, 2016] S. Boxio. Characterizing quantum supremacy in near-term devices. In arXiv preprint arXiv:1608.0026, 2016.","title":"Characterizing quantum supremacy in near-term devices","authors":"S Boxio","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bremner et al., 2016] M. J. Bremner, A. Montanaro, and D. J. Shepherd. Achieving quantum supremacy with sparse and noisy commuting quantum computations. In arXiv preprint arXiv:1610.01808, 2016.","title":"Achieving quantum supremacy with sparse and noisy commuting quantum computations","authors":"M J Bremner, A Montanaro, D J Shepherd","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Brierly, 2015] S. Brierly. Efficient implementation of quantum circuits with limited qubit interactions.\". In arXiv preprint arXiv:1507.04263, 2015.","title":"Efficient implementation of quantum circuits with limited qubit interactions","authors":"S Brierly","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Chen and Wah, 2006] Y. Chen and B. Wah. Temporal planning using subgoal partitioning and resolution in sg-plan. Journal of Artificial Intelligence Research, 26:323 -369, 2006.","title":"Temporal planning using subgoal partitioning and resolution in sg-plan","authors":"Y Chen, B Wah","year":"2006","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Copsey et al., 2003] Dean Copsey, Mark Oskin, Francois Impens, Tzvetan Metodiev, Andrew Cross, Frederic T Chong, Isaac L Chuang, and John Kubiatowicz. Toward a scalable, silicon-based quantum computing architecture. IEEE Journal of selected topics in quantum electronics, 9(6):1552-1569, 2003.","title":"Toward a scalable, silicon-based quantum computing architecture","authors":"Dean Copsey, Mark Oskin, Francois Impens, Tzvetan Metodiev, Andrew Cross, Frederic T Chong, Isaac L Chuang, John Kubiatowicz","year":"2003","venue":"IEEE Journal of selected topics in quantum electronics","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Devitt, 2016] Simon J. Devitt. Performing quantum computing ex- periments in the cloud. Physical Review A, 94(3):222-226, 2016.","title":"Performing quantum computing experiments in the cloud","authors":"Simon J Devitt","year":"2016","venue":"Physical Review A","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Do and Kambhampati, 2003] M. B. Do and S. Kambhampati. Im- proving the temporal flexibility of position constrained metric temporal plans. In Proceedings of the 13 th International Confer- ence on Artificial Intelligence Planning and Scheduling (ICAPS), 2003.","title":"Improving the temporal flexibility of position constrained metric temporal plans","authors":"M B Do, S Kambhampati","year":"2003","venue":"Proceedings of the 13 th International Conference on Artificial Intelligence Planning and Scheduling (ICAPS)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Erdös and Rényi, 1960] P. Erdös and A. Rényi. On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences, 5:569-573, 1960.","title":"On the evolution of random graphs","authors":"P Erdös, A Rényi","year":"1960","venue":"Publications of the Mathematical Institute of the Hungarian Academy of Sciences","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Eyerich et al., 2009] P. Eyerich, R. Mattmüller, and G. Röger. Us- ing the context-enhanced additive heuristic for temporal and nu- meric planning. In Proceedings of the 19 th International Confer- ence on Automated Planning and Scheduling, pages 318 -325, 2009.","title":"Using the context-enhanced additive heuristic for temporal and numeric planning","authors":"P Eyerich, R Mattmüller, G Röger","year":"2009","venue":"Proceedings of the 19 th International Conference on Automated Planning and Scheduling","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Farhi et al., 2014] E. Farhi, J. Goldstone, and S. Gutmann. A quantum approximate optimization algorithm. In arXiv preprint arXiv:1411.4028, 2014.","title":"A quantum approximate optimization algorithm","authors":"E Farhi, J Goldstone, S Gutmann","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Fu et al., 2005] C. Fu, K. Wilken, and D. Goodwin. A faster op- timal register allocator. The Journal of Instruction-Level Paral- lelism, 7:1 -31, 2005.","title":"A faster optimal register allocator","authors":"C Fu, K Wilken, D Goodwin","year":"2005","venue":"The Journal of Instruction-Level Parallelism","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Gerevini et al., 2003] A. Gerevini, L. Saetti, and I. Serina. Plan- ning through stochastic local search and temporal action graphs. Journal of Artificial Intelligence Research, 20:239 -290, 2003.","title":"Planning through stochastic local search and temporal action graphs","authors":"A Gerevini, L Saetti, I Serina","year":"2003","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Häner et al., 2016] Thomas Häner, Damian S Steiger, Krysta Svore, and Matthias Troyer. A software methodology for compil- ing quantum programs. arXiv preprint arXiv:1604.01401, 2016.","title":"A software methodology for compiling quantum programs","authors":"Thomas Häner, Damian S Steiger, Krysta Svore, Matthias Troyer","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Helmert et al., 2008] M. Helmert, M. Do, and I. Refanidis. The 2008 international planning competition: Determinis- tic track. http://icaps-conference.org/ipc2008/ deterministic/, 2008. 2008-02-19.","title":"The 2008 international planning competition: Deterministic track","authors":"M Helmert, M Do, I Refanidis","year":null,"venue":null,"doi":null,"url":"http://icaps-conference.org/ipc2008/deterministic/,2008.2008-02-19","internal_url":null},{"position":19,"raw":"[IBM, 2017] IBM. The ibm quantum experience. http://www. research.ibm.com/quantum/, 2017. 2017-02-19.","title":"IBM. The ibm quantum experience","authors":null,"year":"2017","venue":null,"doi":null,"url":"http://www.research.ibm.com/quantum/,2017.2017-02-19","internal_url":null},{"position":20,"raw":"[Kole et al., 2017] Abhoy Kole, Kamalika Datta, and Indranil Sen- gupta. A new heuristic for n-dimensional nearest neighbor real- ization of a quantum circuit. IEEE Transactions on Computer- Aided Design of Integrated Circuits and Systems, 2017.","title":"A new heuristic for n-dimensional nearest neighbor realization of a quantum circuit","authors":"Kole","year":"2017","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Ramasesh et al., 2017] Vinay Ramasesh, Kevin O'Brien, Allison Dove, John Mark Kreikebaum, James Colless, and Irfan Siddiqi. Design and characterization of a multi-qubit circuit for quantum simulations. In March Meeting 2017. American Physical Society, 2017.","title":"Design and characterization of a multi-qubit circuit for quantum simulations","authors":"Vinay Ramasesh, O' Kevin, Allison Brien, John Mark Dove, James Kreikebaum, Irfan Colless, Siddiqi","year":"2017","venue":"March Meeting 2017","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Rieffel and Polak, 2011] E. G. Rieffel and W. H. Polak. Quantum computing: A gentle introduction. MIT Press, 2011.","title":"Quantum computing: A gentle introduction","authors":"E G Rieffel, W H Polak","year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Rintanen, 2012] J. Rintanen. Planning as satisfiability: Heuristics. Artificial Intelligence, 193:45 -86, 2012.","title":"Planning as satisfiability: Heuristics","authors":"J Rintanen","year":"2012","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Sete et al., 2016] E. A. Sete, W. J. Zeng, and C. T. Rigetti. A func- tional architecture for scalable quantum computing. In , IEEE In- ternational Conference on Rebooting Computing (ICRC), 2016.","title":"A functional architecture for scalable quantum computing","authors":"E A Sete, W J Zeng, C T Rigetti","year":"2016","venue":"IEEE International Conference on Rebooting Computing (ICRC)","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Smith et al., 2016a] R. S. Smith, M. J. Curtis, and W. J. Zeng. A practical quantum instruction set architecture. In arXiv preprint arXiv:1608.03355, 2016.","title":"A practical quantum instruction set architecture","authors":"Smith","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Smith et al., 2016b] Robert S Smith, Michael J Curtis, and William J Zeng. A practical quantum instruction set architecture. arXiv preprint arXiv:1608.03355, 2016.","title":"A practical quantum instruction set architecture","authors":"Smith","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Steiger et al., 2016a] D. S. Steiger, T. Häner, and M. Troyer. Pro- jectq: An open source software framework for quantum comput- ing. In arXiv preprint arXiv:1612.08091, 2016.","title":"Projectq: An open source software framework for quantum computing","authors":"Steiger","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Steiger et al., 2016b] Damian S Steiger, Thomas Häner, and Matthias Troyer. Projectq: An open source software framework for quantum computing. arXiv preprint arXiv:1612.08091, 2016.","title":"Projectq: An open source software framework for quantum computing","authors":"Steiger","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Venturelli et al., 2017] D. Venturelli, M. Do, E. Rieffel, and J. Frank. Compiling quantum circuits to realistic hard- ware architectures using temporal planners. In arXiv preprint (https://ti.arc.nasa.gov/m/groups/ asr/planning-and-scheduling/VentCirComp17_ ArXiv.pdf), 2017.","title":"Compiling quantum circuits to realistic hardware architectures using temporal planners","authors":"D Venturelli, M Do, E Rieffel, J Frank","year":"2017","venue":null,"doi":null,"url":"https://ti.arc.nasa.gov/m/groups/asr/planning-and-scheduling/VentCirComp17_ArXiv.pdf","internal_url":null},{"position":30,"raw":"[Versluis et al., 2016] R Versluis, S Poletto, N Khammassi, N Haider, DJ Michalak, A Bruno, K Bertels, and L DiCarlo. Scal- able quantum circuit and control for a superconducting surface code. arXiv preprint arXiv:1612.08208, 2016.","title":"Scalable quantum circuit and control for a superconducting surface code","authors":"Versluis, N Poletto, N Khammassi, Haider, Michalak, K Bruno, L Bertels, Dicarlo","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Wah and Chen, 2004] B. Wah and Y. Chen. Subgoal partition- ing and global search for solving temporal planning problems in mixed space. International Journal on Artificial Intelligence Tools, 13(4):767 -790, 2004.","title":"Subgoal partitioning and global search for solving temporal planning problems in mixed space","authors":"B Wah, Y Chen","year":"2004","venue":"International Journal on Artificial Intelligence Tools","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Wecker and Svore, 2014] D. Wecker and K. M. Svore. Liqui|>: A software design architecture and domain-specific language for quantum computing. In arXiv preprint arXiv:1402.4467, 2014.","title":"A software design architecture and domain-specific language for quantum computing","authors":"D Wecker, K M Svore","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Wille et al., 2014] Robert Wille, Aaron Lye, and Rolf Drechsler. Exact reordering of circuit lines for nearest neighbor quantum architectures. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 33(12):1818-1831, 2014.","title":"Exact reordering of circuit lines for nearest neighbor quantum architectures","authors":"Robert Wille, Aaron Lye, Rolf Drechsler","year":"2014","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}