Lattice surgery on the Raussendorf lattice

Herr, D; Paler, A; Devitt, SJ; Nori, F

Lattice surgery on the Raussendorf lattice

Herr, D

Paler, A

Devitt, SJ

Nori, F

Permalink

Publication Type:: Journal Article
Citation:: Quantum Science and Technology, 2018, 3 (3)
Issue Date:: 2018-06-06

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Accepted Manuscript VersionAdobe PDF (3.17 MB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Herr, D https://orcid.org/0000-0002-0849-8339	en_US
dc.contributor.author	Paler, A https://orcid.org/0000-0002-1536-8858	en_US
dc.contributor.author	Devitt, SJ https://orcid.org/0000-0002-5901-1391	en_US
dc.contributor.author	Nori, F https://orcid.org/0000-0003-3682-7432	en_US
dc.date.available	2020-05-25T19:19:59Z
dc.date.issued	2018-06-06	en_US
dc.identifier.citation	Quantum Science and Technology, 2018, 3 (3)	en_US
dc.identifier.uri	http://hdl.handle.net/10453/126077
dc.description.abstract	© 2018 IOP Publishing Ltd. Lattice surgery is a method to perform quantum computation fault-tolerantly by using operations on boundary qubits between different patches of the planar code. This technique allows for universal planar code computation without eliminating the intrinsic two-dimensional nearest-neighbor properties of the surface code that eases physical hardware implementations. Lattice surgery approaches to algorithmic compilation and optimization have been demonstrated to be more resource efficient for resource-intensive components of a fault-tolerant algorithm, and consequently may be preferable over braid-based logic. Lattice surgery can be extended to the Raussendorf lattice, providing a measurement-based approach to the surface code. In this paper we describe how lattice surgery can be performed on the Raussendorf lattice and therefore give a viable alternative to computation using braiding in measurement-based implementations of topological codes.	en_US
dc.relation.ispartof	Quantum Science and Technology	en_US
dc.relation.isbasedon	10.1088/2058-9565/aac450	en_US
dc.title	Lattice surgery on the Raussendorf lattice	en_US
dc.type	Journal Article
utslib.citation.volume	3	en_US
utslib.for	0206 Quantum Physics	en_US
utslib.for	1099 Other Technology	en_US
pubs.embargo.period	Not known	en_US
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
utslib.copyright.status	open_access
pubs.issue	3	en_US
pubs.publication-status	Published	en_US
pubs.volume	3	en_US

Abstract:

© 2018 IOP Publishing Ltd. Lattice surgery is a method to perform quantum computation fault-tolerantly by using operations on boundary qubits between different patches of the planar code. This technique allows for universal planar code computation without eliminating the intrinsic two-dimensional nearest-neighbor properties of the surface code that eases physical hardware implementations. Lattice surgery approaches to algorithmic compilation and optimization have been demonstrated to be more resource efficient for resource-intensive components of a fault-tolerant algorithm, and consequently may be preferable over braid-based logic. Lattice surgery can be extended to the Raussendorf lattice, providing a measurement-based approach to the surface code. In this paper we describe how lattice surgery can be performed on the Raussendorf lattice and therefore give a viable alternative to computation using braiding in measurement-based implementations of topological codes.

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

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