Boundaries for the Honeycomb Code - INSPIRE

DataBETA

Boundaries for the Honeycomb Code

Jeongwan Haah
(
- Microsoft, Redmond
)
,
Matthew B. Hastings
(
- Microsoft, Redmond and
- Station Q, UCSB
)

Oct 18, 2021

12 pages

Published in:

Quantum 6 (2022) 693,
Quantum 6 (2022) 693

Published: Apr 21, 2022

e-Print:

2110.09545 [quant-ph]

DOI:

10.22331/q-2022-04-21-693

View in:

ADS Abstract Service

reference search58 citations

Citations per year

Abstract: (Verein zur Foerderung des Open Access Publizierens in den Quantenwissenschaften)

We introduce a simple construction of boundary conditions for the honeycomb code [1] that uses only pairwise checks and allows parallelogram geometries at the cost of modifying the bulk measurement sequence. We discuss small instances of the code.

Note:

11 pages, 7 figures; v2 final version in Quantum

References(14)

Figures(3)

[1]

Dynamically Generated Logical Qubits

Matthew B. Hastings
(
- Station Q, UCSB and
- Microsoft, Redmond
)
,
Jeongwan Haah
(
- Microsoft, Redmond
)

- Quantum 5 (2021) 564
•
e-Print:
- 2107.02194
•
DOI:
- 10.22331/q-2021-10-19-564

[2]

Anyons in an exactly solved model and beyond

Alexei Kitaev
(
- Caltech, Pasadena (main)
)

- Annals Phys. 321 (2006) 1, 2-111
•
e-Print:
- cond-mat/0506438
•
DOI:
- 10.1016/j.aop.2005.10.005

[3]

A family of stabilizer codes for $D({{\mathbb{Z}}_{2}})$ anyons and Majorana modes

James R. Wootton
(
- Basel U.
)

- J.Phys.A 48 (2015) 21, 215302
•
e-Print:
- 1501.07779
•
DOI:
- 10.1088/1751-8113/48/21/215302

[4]

Optimization of the surface code design for Majorana-based qubits

Rui Chao
(
- Southern California U.
)
,
Michael E. Beverland
(
- Microsoft, Redmond
)
,
Nicolas Delfosse
(
- Microsoft, Redmond
)
,
Jeongwan Haah
(
- Microsoft, Redmond
)

- Quantum 4 (2020) 352
•
e-Print:
- 2007.00307
•
DOI:
- 10.22331/q-2020-10-28-352

[5]

A Fault-Tolerant Honeycomb Memory

- Quantum 5 (2021) 605,
- Quantum 5 (2021) 605
•
e-Print:
- 2108.10457
•
DOI:
- 10.22331/q-2021-12-20-605

[6]

Quantum codes on a lattice with boundary

Sergey B. Bravyi
(
- Landau Inst.
)
,
Alexei Yu. Kitaev
(
- Caltech and
- Landau Inst.
)

e-Print:
- quant-ph/9811052

[7]

Projective Plane and Planar Quantum Codes

- Found.Comput.Math. 1 (2001) 3, 325-332
•
e-Print:
- quant-ph/9810055
•
DOI:
- 10.1007/s102080010013

[8]

Topological quantum memory

- J.Math.Phys. 43 (2002) 4452-4505
•
e-Print:
- quant-ph/0110143
•
DOI:
- 10.1063/1.1499754

[9]

in preparation

A. Paetznick

[10]

Planar Floquet Codes

Christophe Vuillot
(
- INRIA, Nancy
)

e-Print:
- 2110.05348

[11]

Fault tolerant quantum computation with higher dimensional systems

Daniel Gottesman
(
- Los Alamos
)

- Chaos Solitons Fractals 10 (1999) 1749-1758
•
e-Print:
- quant-ph/9802007
•
DOI:
- 10.1016/S0960-0779(98)00218-5

[12]

A magic state’s fidelity can be superior to the operations that created it

Ying Li
(
- U. Oxford (main)
)

- New J.Phys. 17 (2015) 2, 023037
•
DOI:
- 10.1088/1367-2630/17/2/023037

[13]

Topological quantum distillation

H. Bombin
(
- Madrid U.
)
,
M.A. Martin-Delgado
(
- Madrid U.
)

- Phys.Rev.Lett. 97 (2006) 180501
•
e-Print:
- quant-ph/0605138
•
DOI:
- 10.1103/PhysRevLett.97.180501

[14]

Optimal resources for topological two-dimensional stabilizer codes: Comparative study

- Phys.Rev.A 76 (2007) 1, 012305
•
DOI:
- 10.1103/PhysRevA.76.012305