Effective Compression of Quantum Braided Circuits Aided by ZX-Calculus

Mapping a quantum algorithm to any practical large-scale quantum computer will require a sequence of compilations and optimizations. At the level of fault-tolerant encoding, one likely requirement of this process is the translation into a topological circuit, for which braided circuits represent one...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Michael Hanks, Marta P. Estarellas, William J. Munro, Kae Nemoto
Formato:	article
Lenguaje:	EN
Publicado:	American Physical Society 2020
Materias:	Physics QC1-999
Acceso en línea:	https://doaj.org/article/9fc428e45f9b4e229158ec10b5442798
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:9fc428e45f9b4e229158ec10b5442798
record_format	dspace
spelling	oai:doaj.org-article:9fc428e45f9b4e229158ec10b54427982021-12-02T12:11:17ZEffective Compression of Quantum Braided Circuits Aided by ZX-Calculus10.1103/PhysRevX.10.0410302160-3308https://doaj.org/article/9fc428e45f9b4e229158ec10b54427982020-11-01T00:00:00Zhttp://doi.org/10.1103/PhysRevX.10.041030http://doi.org/10.1103/PhysRevX.10.041030https://doaj.org/toc/2160-3308Mapping a quantum algorithm to any practical large-scale quantum computer will require a sequence of compilations and optimizations. At the level of fault-tolerant encoding, one likely requirement of this process is the translation into a topological circuit, for which braided circuits represent one candidate model. Given the large overhead associated with encoded circuits, it is paramount to reduce their size in terms of computation time and qubit number through circuit compression. While these optimizations have typically been performed in the language of three-dimensional diagrams, such a representation does not allow an efficient, general, and scalable approach to reduction or verification. We propose the use of the ZX-calculus as an intermediate language for braided circuit compression, demonstrating advantage by comparing results using this approach with those previously obtained for the compression of \|A⟩ and \|Y⟩ state distillation circuits. We then provide a benchmark of our method against a small set of Clifford+T circuits, yielding compression percentages of ∼77%. Our results suggest that the overheads of braided, defect-based circuits are comparable to those of their lattice-surgery counterparts, restoring the potential of this model for surface-code quantum computation.Michael HanksMarta P. EstarellasWilliam J. MunroKae NemotoAmerican Physical SocietyarticlePhysicsQC1-999ENPhysical Review X, Vol 10, Iss 4, p 041030 (2020)
institution	DOAJ
collection	DOAJ
language	EN
topic	Physics QC1-999
spellingShingle	Physics QC1-999 Michael Hanks Marta P. Estarellas William J. Munro Kae Nemoto Effective Compression of Quantum Braided Circuits Aided by ZX-Calculus
description	Mapping a quantum algorithm to any practical large-scale quantum computer will require a sequence of compilations and optimizations. At the level of fault-tolerant encoding, one likely requirement of this process is the translation into a topological circuit, for which braided circuits represent one candidate model. Given the large overhead associated with encoded circuits, it is paramount to reduce their size in terms of computation time and qubit number through circuit compression. While these optimizations have typically been performed in the language of three-dimensional diagrams, such a representation does not allow an efficient, general, and scalable approach to reduction or verification. We propose the use of the ZX-calculus as an intermediate language for braided circuit compression, demonstrating advantage by comparing results using this approach with those previously obtained for the compression of \|A⟩ and \|Y⟩ state distillation circuits. We then provide a benchmark of our method against a small set of Clifford+T circuits, yielding compression percentages of ∼77%. Our results suggest that the overheads of braided, defect-based circuits are comparable to those of their lattice-surgery counterparts, restoring the potential of this model for surface-code quantum computation.
format	article
author	Michael Hanks Marta P. Estarellas William J. Munro Kae Nemoto
author_facet	Michael Hanks Marta P. Estarellas William J. Munro Kae Nemoto
author_sort	Michael Hanks
title	Effective Compression of Quantum Braided Circuits Aided by ZX-Calculus
title_short	Effective Compression of Quantum Braided Circuits Aided by ZX-Calculus
title_full	Effective Compression of Quantum Braided Circuits Aided by ZX-Calculus
title_fullStr	Effective Compression of Quantum Braided Circuits Aided by ZX-Calculus
title_full_unstemmed	Effective Compression of Quantum Braided Circuits Aided by ZX-Calculus
title_sort	effective compression of quantum braided circuits aided by zx-calculus
publisher	American Physical Society
publishDate	2020
url	https://doaj.org/article/9fc428e45f9b4e229158ec10b5442798
work_keys_str_mv	AT michaelhanks effectivecompressionofquantumbraidedcircuitsaidedbyzxcalculus AT martapestarellas effectivecompressionofquantumbraidedcircuitsaidedbyzxcalculus AT williamjmunro effectivecompressionofquantumbraidedcircuitsaidedbyzxcalculus AT kaenemoto effectivecompressionofquantumbraidedcircuitsaidedbyzxcalculus
_version_	1718394645277310976

Effective Compression of Quantum Braided Circuits Aided by ZX-Calculus

Ejemplares similares