On the Qubit Routing Problem
CQC are pleased and very proud to have published a pre-print on arxiv of important research that, deployed through t|ket⟩™will enhance and accelerate the effective commercialisation of quantum computing.
The Qubit Routing problem lies at the heart of the challenge to increase circuit implementation by reducing two-qubit gate counts and CQC’s methods are empirically proven to be superior and more effective than competing alternatives. With our platform agnostic approach we can accommodate the requirements of users who will want to maintain maximum flexibility whilst ensuring the very best performance.
We will provide further updates as the article is published and further aspects of our proprietary know-how are made available both to organisations who are building quantum processors and who will want to maximise the benefits to the widest possible audience, as well as to early clients who will need a full software stack that allows high level access to the best architectures in order to solve real-world problems.
We introduce a new architecture-agnostic methodology for mapping abstract quantum circuits to realistic quantum computing devices with restricted qubit connectivity, as implemented by Cambridge Quantum Computing’s t|ket⟩™ compiler. We present empirical results showing the effectiveness of this method in terms of reducing two-qubit gate depth and two-qubit gate count, compared to other implementations.
Alexander Cowtan, Silas Dilkes, Ross Duncan, Alexandre Krajenbrink, Will Simmons and Seyon Sivarajah