Creating Entangled Logical Qubits in the Heavy-Hex Lattice with Topological Codes

Designs for quantum error correction depend strongly on the connectivity of the qubits. For solid-state qubits, the most straightforward approach is to have connectivity constrained to a planar graph. Practical considerations may also further restrict the connectivity, resulting in a relatively sparse graph such as the heavy-hexagonal (“heavy-hex”) architecture of current IBM Quantum devices. In such cases, it is hard to use all qubits to their full potential. Instead, in order to emulate the denser connectivity required to implement well-known quantum error-correcting codes, many qubits remain effectively unused. In this work, we show how this bug can be turned into a feature. By using the unused qubits of one code to execute another, two codes can be implemented on top of each other, allowing easy application of fault-tolerant entangling gates and measurements. We demonstrate this by realizing a surface code and a Bacon-Shor code on a 133-qubit IBM Quantum device. Using transversal controlled-<a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><a:mi>X</a:mi></a:math> () gates and lattice surgery, we demonstrate entanglement between these logical qubits with code distance up to <d:math xmlns:d="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><d:mi>d</d:mi><d:mo>=</d:mo><d:mn>4</d:mn></d:math> and five rounds of stabilizer-measurement cycles. The nonplanar coupling between the qubits allows us to simultaneously measure the logical <g:math xmlns:g="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><g:mi>X</g:mi><g:mi>X</g:mi></g:math>, <j:math xmlns:j="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><j:mi>Y</j:mi><j:mi>Y</j:mi></j:math>, and <m:math xmlns:m="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><m:mi>Z</m:mi><m:mi>Z</m:mi></m:math> observables. With this, we verify the violation of Bell’s inequality for both the <p:math xmlns:p="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><p:mi>d</p:mi><p:mo>=</p:mo><p:mn>2</p:mn></p:math> case with postselection featuring a fidelity of 94% and the <s:math xmlns:s="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><s:mi>d</s:mi><s:mo>=</s:mo><s:mn>3</s:mn></s:math> instance using only quantum error correction. Published by the American Physical Society 2024

Authors

Institutions

Publication Details

Journal
PRX Quantum
Published
2024-12-03
DOI
https://doi.org/10.1103/prxquantum.5.040334
Citations
22
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
7.64

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Creating Entangled Logical Qubits in the Heavy-Hex Lattice with Topological Codes

Bence Hetényi, James R. Wootton
22 citations
PRX Quantum
Quantum Computing Algorithms and Architecture
7.64
article

Creating Entangled Logical Qubits in the Heavy-Hex Lattice with Topological Codes

Bence Hetényi, James R. Wootton
article en
22 citations

Abstract

Designs for quantum error correction depend strongly on the connectivity of the qubits. For solid-state qubits, the most straightforward approach is to have connectivity constrained to a planar graph. Practical considerations may also further restrict the connectivity, resulting in a relatively sparse graph such as the heavy-hexagonal (“heavy-hex”) architecture of current IBM Quantum devices. In such cases, it is hard to use all qubits to their full potential. Instead, in order to emulate the denser connectivity required to implement well-known quantum error-correcting codes, many qubits remain effectively unused. In this work, we show how this bug can be turned into a feature. By using the unused qubits of one code to execute another, two codes can be implemented on top of each other, allowing easy application of fault-tolerant entangling gates and measurements. We demonstrate this by realizing a surface code and a Bacon-Shor code on a 133-qubit IBM Quantum device. Using transversal controlled-<a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><a:mi>X</a:mi></a:math> () gates and lattice surgery, we demonstrate entanglement between these logical qubits with code distance up to <d:math xmlns:d="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><d:mi>d</d:mi><d:mo>=</d:mo><d:mn>4</d:mn></d:math> and five rounds of stabilizer-measurement cycles. The nonplanar coupling between the qubits allows us to simultaneously measure the logical <g:math xmlns:g="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><g:mi>X</g:mi><g:mi>X</g:mi></g:math>, <j:math xmlns:j="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><j:mi>Y</j:mi><j:mi>Y</j:mi></j:math>, and <m:math xmlns:m="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><m:mi>Z</m:mi><m:mi>Z</m:mi></m:math> observables. With this, we verify the violation of Bell’s inequality for both the <p:math xmlns:p="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><p:mi>d</p:mi><p:mo>=</p:mo><p:mn>2</p:mn></p:math> case with postselection featuring a fidelity of 94% and the <s:math xmlns:s="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><s:mi>d</s:mi><s:mo>=</s:mo><s:mn>3</s:mn></s:math> instance using only quantum error correction. Published by the American Physical Society 2024

PRX QuantumVol. 5(4)
IBM Research - Zurich (CH)
Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung
Openalex Percentile: Top 2%
Quantum Computing Algorithms and Architecture
7.64
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.