Abstract
Adiabatic computing with two degrees of freedom of 2-local Hamiltonians has been theoretically shown to be equivalent to the gate model of universal quantum computing. But today’s quantum annealers, namely D-Wave’s 2000Q platform, only provide a 2-local Ising Hamiltonian abstraction with a single degree of freedom. This raises the question what subset of gate programs can be expressed as quadratic unconstrained binary problems (QUBOs) on the D-Wave. The problem is of interest because gate-based quantum platforms are currently limited to 20 qubits while D-Wave provides 2,000 qubits. However, when transforming entire gate circuits into QUBOs, additional qubits will be required.
The objective of this work is to determine a subset of quantum gates suitable for transformation into single-degree 2-local Ising Hamiltonians under a common qubit base representation such that they comprise a compound circuit suitable for pure quantum computation, i.e., without having to switch between classical and quantum computing for different bases. To this end, this work contributes, for the first time, a fully automated method to translate quantum gate circuits comprised of a subset of common gates expressed as an IBM Qiskit program to single-degree 2-local Ising Hamiltonians, which are subsequently embedded in the D-Wave 2000Q chimera graph. These gate elements are placed in the chimera graph and augmented by constraints that enforce inter-gate logical relationships, resulting in an annealer embedding that completely characterizes the overall gate circuit. Annealer embeddings for several example quantum gate circuits are then evaluated on D-Wave 2000Q hardware.
This work was funded in part by NSF grants 1525609 and 1813004.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Ibm qiskit (2018). https://github.com/Qiskit/qiskit-terra
Rigetti forest (2018). https://www.rigetti.com/forest
Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., Regev, O.: Adiabatic quantum computation is equivalent to standard quantum computation. SIAM J. Comput. 37(1), 166–194 (2007). https://doi.org/10.1137/S0097539705447323
Andriyash, E., et al.: Boosting integer factoring performance via quantum annealing offsets. Technical report (2016)
Bacon, D., Flammia, S.T., Crosswhite, G.M.: Adiabatic quantum transistors (2012). https://doi.org/10.1103/PhysRevX.3.021015
Boixo, S., Albash, T., Spedalieri, F.M., Chancellor, N., Lidar, D.A.: Experimental signature of programmable quantum annealing. arXiv:1212.1739 (2012)
Cross, A.W., Bishop, L.S., Smolin, J.A., Gambetta, J.M.: Open quantum assembly language. arXiv:1707.03429 (2017)
D-Wave: D-wave leap. https://www.dwavesys.com/take-leap
D-Wave: D-wave’s ocean software. https://ocean.dwavesys.com/
Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., Regev, O.: Adiabatic quantum computation is equivalent to standard quantum computation. ArXiv e-prints, May 2004. https://arxiv.org/abs/quant-ph/0405098
IBM: IBM Q Experience. https://quantumexperience.ng.bluemix.net/qx
Warren, R.H.: Gates for adiabatic quantum computing. ArXiv e-prints, August 2014. https://arxiv.org/abs/1405.2354
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Regan, M., Eastwood, B., Nagabhiru, M., Mueller, F. (2019). Automatically Translating Quantum Programs from a Subset of Common Gates to an Adiabatic Representation. In: Thomsen, M., Soeken, M. (eds) Reversible Computation. RC 2019. Lecture Notes in Computer Science(), vol 11497. Springer, Cham. https://doi.org/10.1007/978-3-030-21500-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-21500-2_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-21499-9
Online ISBN: 978-3-030-21500-2
eBook Packages: Computer ScienceComputer Science (R0)