Compilation of algorithm-specific graph states for quantum circuits

Vijayan, MK; Paler, A; Gavriel, J; Casey, M; Rohde, PP; Devitt, S

Compilation of algorithm-specific graph states for quantum circuits

Vijayan, MK Paler, A Gavriel, J Casey, M Rohde, PP Devitt, S

Permalink

Publisher:: IOP Publishing
Publication Type:: Journal Article
Citation:: Quantum Science and Technology, 2024, 9, pp. 1-22
Issue Date:: 2024

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Published versionAdobe PDF (1.06 MB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Vijayan, MK
dc.contributor.author	Paler, A
dc.contributor.author	Gavriel, J
dc.contributor.author	Casey, M
dc.contributor.author	Rohde, PP
dc.contributor.author	Devitt, S
dc.date.accessioned	2024-03-19T23:27:46Z
dc.date.available	2024-03-19T23:27:46Z
dc.date.issued	2024
dc.identifier.citation	Quantum Science and Technology, 2024, 9, pp. 1-22
dc.identifier.issn	2058-9565
dc.identifier.issn	2058-9565
dc.identifier.uri	http://hdl.handle.net/10453/176928
dc.description.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.
dc.language	en
dc.publisher	IOP Publishing
dc.relation.ispartof	Quantum Science and Technology
dc.relation.isbasedon	10.1088/2058-9565/ad1f39
dc.rights	info:eu-repo/semantics/openAccess
dc.subject.classification	5108 Quantum physics
dc.title	Compilation of algorithm-specific graph states for quantum circuits
dc.type	Journal Article
utslib.citation.volume	9
pubs.organisational-group	University of Technology Sydney
pubs.organisational-group	University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	University of Technology Sydney/Strength - QSI - Centre for Quantum Software and Information
pubs.organisational-group	University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
utslib.copyright.status	open_access	*
pubs.consider-herdc	false
dc.date.updated	2024-03-19T23:27:45Z
pubs.publication-status	Published
pubs.volume	9

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.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/176928