aalto1 untyped-item.component.html
Compilation of algorithm-specific graph states for quantum circuits
Loading...
Access rights
openAccess
publishedVersion
URL
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Unless otherwise stated, all rights belong to the author. You may download, display and print this publication for Your own personal use. Commercial use is prohibited.
Date
Department
Major/Subject
Mcode
Degree programme
Language
en
Pages
22
Series
Quantum Science and Technology, Volume 9, issue 2, pp. 1-22
Abstract
We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages, such as Cirq and Q#. The computation can then be implemented using a series of non-Pauli measurements on this graph state. By compiling the graph state directly instead of starting with a standard lattice cluster state and preparing it over the course of the computation, we are able to better understand the resource costs involved and eliminate wasteful Pauli measurements on the actual quantum device. Access to this algorithm-specific graph state also allows for optimisation over locally equivalent graph states to implement the same quantum circuit. The compiler presented here finds ready application in measurement based quantum computing, NISQ devices and logical level compilation for fault tolerant implementations.
Description
Publisher Copyright: © 2024 The Author(s). Published by IOP Publishing Ltd.
Other note
Citation
Krishnan Vijayan, M, Paler, A, Gavriel, J, Myers, C R, Rohde, P P & Devitt, S J 2024, 'Compilation of algorithm-specific graph states for quantum circuits', Quantum Science and Technology, vol. 9, no. 2, 025005, pp. 1-22. https://doi.org/10.1088/2058-9565/ad1f39