Compiling quantum circuits to realistic hardware architectures using temporal planners
- 1 April 2018
- journal article
- research article
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 3 (2), 025004
- https://doi.org/10.1088/2058-9565/aaa331
Abstract
To run quantum algorithms on emerging gate-model quantum hardware, quantum circuits must be compiled to take into account constraints on the hardware. For near-term hardware, with only limited means to mitigate decoherence, it is critical to minimize the duration of the circuit. We investigate the application of temporal planners to the problem of compiling quantum circuits to newly emerging quantum hardware. While our approach is general, we focus on compiling to superconducting hardware architectures with nearest neighbor constraints. Our initial experiments focus on compiling Quantum Alternating Operator Ansatz (QAOA) circuits whose high number of commuting gates allow great flexibility in the order in which the gates can be applied. That freedom makes it more challenging to find optimal compilations but also means there is a greater potential win from more optimized compilation than for less flexible circuits. We map this quantum circuit compilation problem to a temporal planning problem, and generated a test suite of compilation problems for QAOAcircuits of various sizes to a realistic hardware architecture. Wereport compilation results from several state-of-the-art temporal planners on this test set. This early empirical evaluation demonstrates that temporal planning is a viable approach to quantum circuit compilation.Funding Information
- NASA Sponsor Award (NNX12AK33A)
This publication has 18 references indexed in Scilit:
- Training a quantum optimizerPhysical Review A, 2016
- Digitized adiabatic quantum computing with a superconducting circuitNature, 2016
- Exact Reordering of Circuit Lines for Nearest Neighbor Quantum ArchitecturesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2014
- Efficient distributed quantum computingProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2013
- Planning as satisfiability: HeuristicsArtificial Intelligence, 2012
- Branching and pruning: An optimal temporal POCL planner based on constraint programmingArtificial Intelligence, 2006
- SUBGOAL PARTITIONING AND GLOBAL SEARCH FOR SOLVING TEMPORAL PLANNING PROBLEMS IN MIXED SPACEInternational Journal on Artificial Intelligence Tools, 2004
- Optimal quantum circuits for general two-qubit gatesPhysical Review A, 2004
- Toward a scalable, silicon-based quantum computing architectureIEEE Journal of Selected Topics in Quantum Electronics, 2003
- Natural two-qubit gate for quantum computation using theinteractionPhysical Review A, 2003