具有Z_2对称性的开放量子系统的可解码混合动力学
Decodable hybrid dynamics of open quantum systems with Z_2 symmetry
AI总结:
本文研究具有Z_2对称性的开放量子电路,发现自旋玻璃、顺磁和平凡三相,提出基于测量历史的解码算法,可恢复编码量子比特信息,时间复杂度为O(L^d T)。
摘要:
我们探索了一类具有局域退相干(“噪声”)和局域投影测量的“开放”量子电路模型,每个模型都尊重全局Z_2对称性。该模型支持一个自旋玻璃相,其中Z_2对称性自发破缺(在平衡一维系统中不可能出现),一个以发散磁化率为特征的顺磁相,以及一个中间的“平凡”相。所有三个相对于Z_2对称的局域酉门也是稳定的,相之间的动力学相变属于渗流普适类。开放电路动力学可以通过显式引入一个具有自身“扰乱”动力学的浴来纯化,如[Bao, Choi, Altman, arXiv:2102.09164]所述,这不会改变任何普适物理。在自旋玻璃相内,电路动力学可以被解释为量子重复码,其中每个稳定子以有限速率被随机测量,退相干被视为有效的比特翻转错误。受自旋玻璃相几何结构的启发,我们设计了一种新颖的解码算法,用于恢复码空间中的任意初始量子比特状态,假设已知测量结果的历史,并且能够对最终状态执行局域泡利测量和门操作。对于运行时间T的L^d个量子比特的电路,执行解码器所需的时间复杂度为O(L^d T)(其中d为维度)。有了这个解码器,我们发现初始编码量子比特状态的信息可以在1d电路中保留(然后恢复)对数L的时间,在2d中低于有限错误阈值时至少线性L的时间。对于重复码和环面码,我们将我们的解码算法与早期将错误模型映射到随机键伊辛模型的算法进行了比较和对比。
英文摘要:
We explore a class of "open" quantum circuit models with local decoherence ("noise") and local projective measurements, each respecting a global Z_2 symmetry. The model supports a spin glass phase where the Z_2 symmetry is spontaneously broken (not possible in an equilibrium 1d system), a paramagnetic phase characterized by a divergent susceptibility, and an intermediate "trivial" phase. All three phases are also stable to Z_2-symmetric local unitary gates, and the dynamical phase transitions between the phases are in the percolation universality class. The open circuit dynamics can be purified by explicitly introducing a bath with its own "scrambling" dynamics, as in [Bao, Choi, Altman, arXiv:2102.09164], which does not change any of the universal physics. Within the spin glass phase the circuit dynamics can be interpreted as a quantum repetition code, with each stabilizer of the code measured stochastically at a finite rate, and the decoherences as effective bit-flip errors. Motivated by the geometry of the spin glass phase, we devise a novel decoding algorithm for recovering an arbitrary initial qubit state in the code space, assuming knowledge of the history of the measurement outcomes, and the ability of performing local Pauli measurements and gates on the final state. For a circuit with L^d qubits running for time T, the time needed to execute the decoder scales as O(L^d T) (with dimensionality d). With this decoder in hand, we find that the information of the initial encoded qubit state can be retained (and then recovered) for a time logarithmic in L for a 1d circuit, and for a time at least linear in L in 2d below a finite error threshold. For both the repetition and toric codes, we compare and contrast our decoding algorithm with earlier algorithms that map the error model to the random bond Ising model.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。