Noisy Quantum Trees: Infinite Protection Without Correction

Abstract

We study quantum networks with tree structures, in which information propagates from a root to leaves. At each node in the network, the received qubit unitarily interacts with fresh ancilla qubits, after which each qubit is sent through a noisy channel to a different node in the next level. Therefore, as the tree depth grows, there is a competition between the irreversible effect of noise and the protection against such noise achieved by delocalization of information. In the classical setting, where each node simply copies the input bit into multiple output bits, this model has been studied as the broadcasting or reconstruction problem on trees, which has broad applications. In this work, we study the quantum version of this problem. We consider a Clifford encoder at each node that encodes the input qubit in a stabilizer code, along with a single qubit Pauli noise channel at each edge. Such noisy quantum trees describe a scenario in which one has access to a stream of fresh (low-entropy) ancilla qubits, but cannot perform error correction. Therefore, they provide a different perspective on quantum fault tolerance. Furthermore, they provide a useful model for describing the effect of noise within the encoders of concatenated codes. We prove that above certain noise thresholds, which depend on the properties of the code such as its distance, as well as the properties of the encoder, information decays exponentially with the depth of the tree. On the other hand, by studying certain efficient decoders, we prove that for codes with distance d>=2 and for sufficiently small (but non-zero) noise, classical information and entanglement propagate over a noisy tree with infinite depth. Indeed, we find that this remains true even for binary trees with certain 2-qubit encoders at each node, which encode the received qubit in the binary repetition code with distance d=1.

Version 2; Comments welcome (24 pages + 32 pages of Appendices; 26 Figures)

References in corpus (21)

• Quantum Computing in the NISQ era and beyond
• Good Quantum Error-Correcting Codes Exist
• Quantum random access memory
• Holographic quantum error-correcting codes: Toy models for the bulk/boundary correspondence
• Quantum Error Correction and Orthogonal Geometry
• Bulk Locality and Quantum Error Correction in AdS/CFT
• Noncommuting mixed states cannot be broadcast
• Measurement-driven entanglement transition in hybrid quantum circuits
• Classical simulation of quantum many-body systems with a tree tensor network
• Scalable probes of measurement-induced criticality
• Architectures for a quantum random access memory
• How robust is a quantum gate in the presence of noise?
• A Quantum to Classical Phase Transition in Noisy Quantum Computers
• Optimal and Efficient Decoding of Concatenated Quantum Block Codes
• Exact Performance of Concatenated Quantum Codes
• Tight bounds on the convergence of noisy random circuits to the uniform distribution
• Thresholds for universal concatenated quantum codes
• Measurement-induced phase transitions on dynamical quantum trees
• On the closedness and geometry of tensor network state sets
• On memory in exponentially expanding spaces
• Quantum Darwinism-encoding transitions on expanding trees