Edge bit in an average symmetry protected topological (ASPT) mixed state is studied. The state is protected by one strong
Z2 and one weak (average)
Z2 symmetries. As analogous objects of pure symmetry protected topological (SPT) states, the ASPT possesses edge bits. In particular, the analogous operator response exists, that is, symmetry fractionalization. The fractionalization preserves the presence of the ASPT in the bulk, and the fractionalized edge operators acting on the edge bits of the ASPT. %analogous to the ones in the pure SPTs. In this work, based on the cluster model and by employing Choi mapping, we discuss generic features of the edge bits and numerically clarify the behavior of the edge bits and their robustness for varying decoherence and perturbative interactions. By using an operator-space mutual information (OSMI), we track the flow of quantum correlations between the two edges. Remarkably, even in the ASPT regime, a finite portion of the initial edge-to-edge correlation survives.
Quantum computing makes use of wave-function superposition to provide a computational system with remarkable possibilities. A computing bit is a 0 or 1, but a quantum bit, a qubit, is a superposition of two quantum states, of, say, an atom. A number n of qubits will then be in a superposition of 2n distinct states. An operation on such a state then does 2n simultaneous operations, demonstrating quantum parallelism. The possibilities of quantum computing are demonstrated via discussion of Deutch’s problem, Shor’s period-finding algorithm, and Grover’s search algorithm. Shor’s algorithm might allow the factoring of large numbers, which might enable the decoding of many encryption schemes. Details are given for the solution of Deutch’s problem. The analysis introduces certain operators, the NOT and Hadamard, that are used in computer logic.