pith. sign in

arxiv: 1509.07796 · v1 · pith:LUA6G3X6new · submitted 2015-09-25 · 🪐 quant-ph

Hierarchical surface code for network quantum computing with modules of arbitrary size

classification 🪐 quant-ph
keywords modulescodenetworkqubitsqubitsurfacecomputingcontaining
0
0 comments X
read the original abstract

The network paradigm for quantum computing involves interconnecting many modules to form a scalable machine. Typically it is assumed that the links between modules are prone to noise while operations within modules have significantly higher fidelity. To optimise fault tolerance in such architectures we introduce a hierarchical generalisation of the surface code: a small `patch' of the code exists within each module, and constitutes a single effective qubit of the logic-level surface code. Errors primarily occur in a two-dimensional subspace, i.e. patch perimeters extruded over time, and the resulting noise threshold for inter-module links can exceed ~ 10% even in the absence of purification. Increasing the number of qubits within each module decreases the number of qubits necessary for encoding a logical qubit. But this advantage is relatively modest, and broadly speaking a `fine grained' network of small modules containing only ~ 8 qubits is competitive in total qubit count versus a `course' network with modules containing many hundreds of qubits.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.