2021/03/12 by Ed Younis, Younis, Ed, Koushik Sen +5 · 5 citations
Computer Science · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Parallel Computing and Optimization Techniques
paper · pdf · doi:10.48550/arxiv.2103.07093
We present a quantum synthesis algorithm designed to produce short circuits\nand to scale well in practice. The main contribution is a novel representation\nof circuits able to encode placement and topology using generic "gates", which\nallows the QFAST algorithm to replace expensive searches over circuit\nstructures with few steps of numerical optimization. When compared against\noptimal depth, search based state-of-the-art techniques, QFAST produces\ncomparable results: 1.19x longer circuits up to four qubits, with an increase\nin compilation speed of 3.6x. In addition, QFAST scales up to seven qubits.\nWhen compared with the state-of-the-art "rule" based decomposition techniques\nin Qiskit, QFAST produces circuits shorter by up to two orders of magnitude\n(331x), albeit 5.6x slower. We also demonstrate the composability with other\ntechniques and the tunability of our formulation in terms of circuit depth and\nrunning time.\n