{ "id": "1712.04722", "version": "v1", "published": "2017-12-13T12:02:14.000Z", "updated": "2017-12-13T12:02:14.000Z", "title": "Efficient Mapping of Quantum Circuits to the IBM QX Architectures", "authors": [ "Alwin Zulehner", "Alexandru Paler", "Robert Wille" ], "categories": [ "quant-ph" ], "abstract": "In March 2017, IBM launched the project IBM Q with the goal to provide access to quantum computers for a broad audience. This allowed users to conduct quantum experiments on a 5-qubit and, since June 2017, also on a 16-qubit quantum computer (called IBM QX2 and IBM QX3, respectively). In order to use these, the desired quantum functionality (e.g. provided in terms of a quantum circuit) has to properly be mapped so that the underlying physical constraints are satisfied - a complex task. This demands for solutions to automatically and efficiently conduct this mapping process. In this paper, we propose such an approach which satisfies all constraints given by the architecture and, at the same time, aims to keep the overhead in terms of additionally required quantum gates minimal. The proposed approach is generic and can easily be configured for future architectures. Experimental evaluations show that the proposed approach clearly outperforms IBM's own mapping solution. In fact, for many quantum circuits, the proposed approach determines a mapping to the IBM architecture within less than five minutes (and within a fraction of a second in most cases), while IBM's solution suffers from long runtimes and runs into a timeout of 1 hour in several cases. As an additional benefit, the proposed approach yields mapped circuits with smaller costs (i.e. fewer additional gates are required).", "revisions": [ { "version": "v1", "updated": "2017-12-13T12:02:14.000Z" } ], "analyses": { "keywords": [ "quantum circuit", "ibm qx architectures", "efficient mapping", "quantum computer", "ibms solution suffers" ], "note": { "typesetting": "TeX", "pages": 0, "language": "en", "license": "arXiv", "status": "editable" } } }