Abstract:The future of quantum repeater networking will require interoperability between various error correcting codes. A few specific code conversions and even a generalized method are known, however, no detailed analysis of these techniques in the context of quantum networking has been performed. In this paper, we analyze a generalized procedure to create Bell pairs encoded heterogeneously between two separate codes used often in error corrected quantum repeater network designs. We begin with a physical Bell pair, t… Show more
“…Portions of this dissertation are adapted from papers under copyrights by the American Physical Society [121,123] and by the IOP Publishing [122].…”
Section: Acknowledgmentmentioning
confidence: 99%
“…This conversion works as the state injection for the deformationbased qubit and e.g. to support networking among multiple quantum computers that employ heterogeneous error correcting codes [121]. To complete universality of the deformation-based surface code, we demonstrate the arbitrary state injection in this section.…”
Section: Conversion From a Two-defect-based Qubitmentioning
Quantum bits have technological imperfections. Additionally, the capacity of a component that can be implemented feasibly is limited. Therefore, distributed quantum computation is required to scale up quantum computers able to solve usefully large problems.This dissertation presents the design of components of quantum CPUs and of quantum memories taking into account imperfections. Quantum CPUs employ a quantum error correcting code which has faster logical gates and quantum memories employ a code which is superior in space resource requirements. This new quantum computer architecture aimed to realize distributed computation by connecting quantum computer each of which consists of multiple quantum CPUs and multiple quantum memories.This dissertation focuses on quantum error correcting codes, giving a practical, concrete method for tolerating static losses such as faulty devices for the surface code. To validate this method, I analyzed the resource consumption of cases where faulty devices exist and quantified the increase of resource consumption by numerical simulation with practical assumptions. I found that a yield of functional qubits of 90% is marginally capable of building large-scale systems, by culling the poorer 50% of chips during postfabrication testing. Yield 80% is not usable even when discarding 90% of generated lattices.For the internal connections between quantum CPU and memory components in a quantum computer and for connections of quantum computers, this dissertation gives a fault-tolerant method to connect quantum components that employ heterogeneous quantum error correcting codes. I have validated this method and quantified the resource consumption of the error management by numerical simulation. I found that the scheme, which discards any quantum state in which any error is detected, always achieves an adequate logical error rate regardless of physical error rates in exchange for increased resource consumption.ii iii Additionally, this dissertation gives a new extension of the surface code suitable for quantum memories. This code is shown to require fewer physical qubits to encode a logical qubit than conventional codes. This code achieves the reduction of 50% physical qubits per a logical qubit.Collectively, the elements to construct distributed quantum computation by connecting quantum computers are brought together to propose a distributed quantum computer architecture.
“…Portions of this dissertation are adapted from papers under copyrights by the American Physical Society [121,123] and by the IOP Publishing [122].…”
Section: Acknowledgmentmentioning
confidence: 99%
“…This conversion works as the state injection for the deformationbased qubit and e.g. to support networking among multiple quantum computers that employ heterogeneous error correcting codes [121]. To complete universality of the deformation-based surface code, we demonstrate the arbitrary state injection in this section.…”
Section: Conversion From a Two-defect-based Qubitmentioning
Quantum bits have technological imperfections. Additionally, the capacity of a component that can be implemented feasibly is limited. Therefore, distributed quantum computation is required to scale up quantum computers able to solve usefully large problems.This dissertation presents the design of components of quantum CPUs and of quantum memories taking into account imperfections. Quantum CPUs employ a quantum error correcting code which has faster logical gates and quantum memories employ a code which is superior in space resource requirements. This new quantum computer architecture aimed to realize distributed computation by connecting quantum computer each of which consists of multiple quantum CPUs and multiple quantum memories.This dissertation focuses on quantum error correcting codes, giving a practical, concrete method for tolerating static losses such as faulty devices for the surface code. To validate this method, I analyzed the resource consumption of cases where faulty devices exist and quantified the increase of resource consumption by numerical simulation with practical assumptions. I found that a yield of functional qubits of 90% is marginally capable of building large-scale systems, by culling the poorer 50% of chips during postfabrication testing. Yield 80% is not usable even when discarding 90% of generated lattices.For the internal connections between quantum CPU and memory components in a quantum computer and for connections of quantum computers, this dissertation gives a fault-tolerant method to connect quantum components that employ heterogeneous quantum error correcting codes. I have validated this method and quantified the resource consumption of the error management by numerical simulation. I found that the scheme, which discards any quantum state in which any error is detected, always achieves an adequate logical error rate regardless of physical error rates in exchange for increased resource consumption.ii iii Additionally, this dissertation gives a new extension of the surface code suitable for quantum memories. This code is shown to require fewer physical qubits to encode a logical qubit than conventional codes. This code achieves the reduction of 50% physical qubits per a logical qubit.Collectively, the elements to construct distributed quantum computation by connecting quantum computers are brought together to propose a distributed quantum computer architecture.
“…'Partially quantum' networks are considered in the so-called trusted node scenario [26], while fully quantum networks have been investigated in the context of network routing [27][28][29][30] and coding [31-33] strategies and heterogeneous network technologies [34].…”
Section: Introductionmentioning
confidence: 99%
“…Several theoretical variations have been proposed: some of them are based on entanglement distillation [12][13][14] and others are based on forward error correction [15][16][17][18]. Much experimental progress towards the realisation of a quantum repeater has been made [19][20][21][22][23][24][25].'Partially quantum' networks are considered in the so-called trusted node scenario [26], while fully quantum networks have been investigated in the context of network routing [27][28][29][30] and coding [31-33] strategies and heterogeneous network technologies [34].Here we propose a general multipartite quantum network architecture, where the long-distance links are bridged by quantum repeater stations. This idea is illustrated in figure 1 for the long-term vision of a 'world-wide quantum web'.…”
Society relies and depends increasingly on information exchange and communication. In the quantum world, security and privacy is a built-in feature for information processing. The essential ingredient for exploiting these quantum advantages is the resource of entanglement, which can be shared between two or more parties. The distribution of entanglement over large distances constitutes a key challenge for current research and development. Due to losses of the transmitted quantum particles, which typically scale exponentially with the distance, intermediate quantum repeater stations are needed. Here we show how to generalise the quantum repeater concept to the multipartite case, by describing large-scale quantum networks, i.e. network nodes and their long-distance links, consistently in the language of graphs and graph states. This unifying approach comprises both the distribution of multipartite entanglement across the network, and the protection against errors via encoding. The correspondence to graph states also provides a tool for optimising the architecture of quantum networks.
IntroductionQuantum entanglement is one of the pillars of quantum information processing. Distribution of entanglement among two or more spatially separated parties is a necessary ingredient for many tasks in quantum information theory, including distributed quantum computing [1], blind quantum computing [2], teleportation [3], telecloning [4], secret sharing [5] and quantum cryptography schemes [6][7][8]. Multipartite entanglement enables a violation of Bell inequalities that grows exponentially with the number of parties [9]. However, the controlled distribution of entanglement, in particular of multipartite entanglement, over long distances is a major challenge, due to unavoidable imperfections such as particle losses and decoherence.The seminal idea of quantum repeaters [10, 11] is based on the distribution of short-range entanglement between intermediate repeater stations (thus avoiding losses that grow typically exponentially with the distance) and subsequent entanglement swapping, which connects the short links along a line to long-range bipartite entanglement. Several theoretical variations have been proposed: some of them are based on entanglement distillation [12][13][14] and others are based on forward error correction [15][16][17][18]. Much experimental progress towards the realisation of a quantum repeater has been made [19][20][21][22][23][24][25].'Partially quantum' networks are considered in the so-called trusted node scenario [26], while fully quantum networks have been investigated in the context of network routing [27][28][29][30] and coding [31-33] strategies and heterogeneous network technologies [34].Here we propose a general multipartite quantum network architecture, where the long-distance links are bridged by quantum repeater stations. This idea is illustrated in figure 1 for the long-term vision of a 'world-wide quantum web'. This network contains nodes (labelled by letters), which receive, measure and send pa...
“…Hence intermediate devices that recover the original signal, so-called quantum repeaters, are necessary [1,2]. Many proposals for them have been made, including approaches based on repeat-until-success strategies using two-way communication [3][4][5] and forward-error correction based protocols which do not require this acknowledgment of successful transmission [6][7][8][9][10]. The requirements of quantum repeaters regarding the precision of operations are very challenging, but experiments have shown significant progress [11][12][13][14][15][16][17][18].…”
Many protocols of quantum information processing, like quantum key distribution or measurementbased quantum computation, 'consume' entangled quantum states during their execution. When participants are located at distant sites, these resource states need to be distributed. Due to transmission losses quantum repeater become necessary for large distances (e.g. 300 km). Here we generalize the concept of the graph state repeater to D-dimensional graph states and to repeaters that can perform basic measurement-based quantum computations, which we call quantum routers. This processing of data at intermediate network nodes is called quantum network coding. We describe how a scheme to distribute general two-colourable graph states via quantum routers with network coding can be constructed from classical linear network codes. The robustness of the distribution of graph states against outages of network nodes is analysed by establishing a link to stabilizer error correction codes. Furthermore we show, that for any stabilizer error correction code there exists a corresponding quantum network code with similar error correcting capabilities.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.