利用非稳定子态容错实现密集旋转操作

Non-Clifford操作不能在量子纠错码上自然横向实现, 但可通过辅助量子态和在量子纠错码上能横向实现的Clifford操作来容错实现, 从而取得容错量子计算的通用性. 非平庸的单量子比特操作是Non-Clifford操作, 可以分解为绕z轴和绕x轴非平庸旋转操作的组合. 本文首先介绍了利用非稳定子态容错实现绕z轴和绕x轴旋转的操作, 进而设计线路利用魔幻态容错制备非稳定子态集, 最后讨论了运用制备的非稳定子态集模拟任意非平庸单量子比特操作的问题. 与之前工作相比, 制备非稳定子态的线路得到简化, 成功概率提高, 且在高精度模拟任意单量子比特操作时所消耗的非稳定子态数目减少了50%. 关键词： 容错量子计算 非稳定子态 魔幻态 Clifford操作     

Bringing order through disorder: localization of errors in topological quantum memories

Anderson localization emerges in quantum systems when randomized parameters cause the exponential suppression of motion. Here we consider this phenomenon in topological models and establish its usefulness for protecting topologically encoded quantum information. For concreteness we employ the toric code. It is known that in the absence of a magnetic field this can tolerate a finite initial density of anyonic errors, but in the presence of a field anyonic quantum walks are induced and the tolerable density becomes zero. However, if the disorder inherent in the code is taken into account, we demonstrate that the induced localization allows the topological quantum memory to regain a finite critical anyon density and the memory to remain stable for arbitrarily long times. We anticipate that disorder inherent in any physical realization of topological systems will help to strengthen the fault tolerance of quantum memories.     

从高质量半导体/超导体纳米线到马约拉纳零能模

作为马约拉纳费米子的“凝聚态版本”,马约拉纳零能模是当前凝聚态物理领域的研究热点.马约拉纳零能模满足非阿贝尔统计,可以构建受拓扑保护的量子比特.这种由空间上分离的马约拉纳零能模构建的拓扑量子比特不易受局域噪声的干扰,具有长的退相干时间,在容错量子计算中具有重要的应用前景.半导体/超导体纳米线是研究马约拉纳零能模和拓扑量子计算的理想实验平台.本文综述了高质量半导体纳米线外延生长、半导体/超导体异质结制备以及相应的马约拉纳零能模研究方面的进展,并对半导体/超导体纳米线在量子计算中的应用前景进行了展望.     

State-Independent Geometric Quantum Gates via Nonadiabatic and Noncyclic Evolution

Geometric phases are robust to local noises and the nonadiabatic ones can reduce the evolution time, thus nonadiabatic geometric gates have strong robustness and can approach high fidelity. However, the advantage of geometric phase has not been fully explored in previous investigations. Here,a scheme is proposed for universal quantum gates with pure nonadiabatic and noncyclic geometric phases from smooth evolution paths. In the scheme, only geometric phase can be accumulated in a fast way, and thus it not only fully utilizes the local noise resistant property of geometric phase but also reduces the difficulty in experimental realization. Numerical results show that the implemented geometric gates have stronger robustness than dynamical gates and the geometric scheme with cyclic path. Furthermore, it proposes to construct universal quantum gate on superconducting circuits, with the fidelities of single-qubit gate and nontrivial two-qubit gate can achieve 99.97% and 99.87%, respectively. Therefore, these high-fidelity quantum gates are promising for large-scale fault-tolerant quantum computation.     

H型魔幻态的纯化研究

魔幻态是解决容错量子计算的通用性的有力工具,因而高保真度魔幻态的获得是可靠的容错量子计算的一个重要问题.本文对H型魔幻态的纯化方案进行了数值模拟.该纯化方案基于7比特Steane码.我们的数值模拟结果显示该纯化方案对输入态围绕H轴的出错有一定容忍度.有趣的是,在H型魔幻态理论纯化阈值面下,我们发现一些量子态可以通过反复纯化,最终以较高的保真度接近H型魔幻态.     

Engineering complex topological memories from simple Abelian models

In three spatial dimensions, particles are limited to either bosonic or fermionic statistics. Two-dimensional systems, on the other hand, can support anyonic quasiparticles exhibiting richer statistical behaviors. An exciting proposal for quantum computation is to employ anyonic statistics to manipulate information. Since such statistical evolutions depend only on topological characteristics, the resulting computation is intrinsically resilient to errors. The so-called non-Abelian anyons are most promising for quantum computation, but their physical realization may prove to be complex. Abelian anyons, however, are easier to understand theoretically and realize experimentally. Here we show that complex topological memories inspired by non-Abelian anyons can be engineered in Abelian models. We explicitly demonstrate the control procedures for the encoding and manipulation of quantum information in specific lattice models that can be implemented in the laboratory. This bridges the gap between requirements for anyonic quantum computation and the potential of state-of-the-art technology.     

An Anyon Model in a Toric Honeycomb Lattice

We study an anyon model in a toric honeycomb lattice. The ground states and the low-lying excitations coincide with those of Kitaev toric code model and then the excitations obey mutual semionic statistics. This model is helpful to understand the toric code of anyons in a more symmetric way. On the other hand, there is a direct relation between this toric honeycomb model and a boundary coupled Ising chain array in a square lattice via Jordan-Wignertransformation. We discuss the equivalence between these two modelsin the low-lying sector and realize these anyon excitations in a conventional fermion system. The analysis for the ground state degeneracy in the last section can also be thought of as a complementarity of our previous work [Phys. A: Math. Theor. 43 (2010) 105306].     

Nonadiabatic geometric quantum computation with optimal control on superconducting circuits

Quantum gates, which are the essential building blocks of quantum computers, are very fragile. Thus, to realize robust quantum gates with high fidelity is the ultimate goal of quantum manipulation. Here, we propose a nonadiabatic geometric quantum computation scheme on superconducting circuits to engineer arbitrary quantum gates, which share both the robust merit of geometric phases and the capacity to combine with optimal control technique to further enhance the gate robustness. Specifically, in our proposal, arbitrary geometric single-qubit gates can be realized on a transmon qubit, by a resonant microwave field driving, with both the amplitude and phase of the driving being timedependent. Meanwhile, nontrivial two-qubit geometric gates can be implemented by two capacitively coupled transmon qubits, with one of the transmon qubits’ frequency being modulated to obtain effective resonant coupling between them. Therefore, our scheme provides a promising step towards fault-tolerant solid-state quantum computation.     

Space-time geometry of topological phases

The 2 + 1 dimensional lattice models of Levin and Wen (2005) [1] provide the most general known microscopic construction of topological phases of matter. Based heavily on the mathematical structure of category theory, many of the special properties of these models are not obvious. In the current paper, we present a geometrical space-time picture of the partition function of the Levin-Wen models which can be described as doubles (two copies with opposite chiralities) of underlying anyon theories. Our space-time picture describes the partition function as a knot invariant of a complicated link, where both the lattice variables of the microscopic Levin-Wen model and the terms of the Hamiltonian are represented as labeled strings of this link. This complicated link, previously studied in the mathematical literature, and known as Chain-Mail, can be related directly to known topological invariants of 3-manifolds such as the so-called Turaev-Viro invariant and the Witten-Reshitikhin-Turaev invariant. We further consider quasi-particle excitations of the Levin-Wen models and we see how they can be understood by adding additional strings to the Chain-Mail link representing quasi-particle world-lines. Our construction gives particularly important new insight into how a doubled theory arises from these microscopic models.     

Analysis and improvement of verifiable blind quantum computation

In blind quantum computation (BQC), a client with weak quantum computation capabilities is allowed to delegate its quantum computation tasks to a server with powerful quantum computation capabilities, and the inputs, algorithms and outputs of the quantum computation are confidential to the server. Verifiability refers to the ability of the client to verify with a certain probability whether the server has executed the protocol correctly and can be realized by introducing trap qubits into the computation graph state to detect server deception. The existing verifiable universal BQC protocols are analyzed and compared in detail. The XTH protocol (proposed by Xu Q S, Tan X Q, Huang R in 2020), a recent improvement protocol of verifiable universal BQC, uses a sandglass-like graph state to further decrease resource expenditure and enhance verification capability. However, the XTH protocol has two shortcomings: limitations in the coloring scheme and a high probability of accepting an incorrect computation result. In this paper, we present an improved version of the XTH protocol, which revises the limitations of the original coloring scheme and further improves the verification ability. The analysis demonstrates that the resource expenditure is the same as for the XTH protocol, while the probability of accepting the wrong computation result is reduced from the original minimum (0.866)^d* to (0.819)^d*, where d^* is the number of repeated executions of the protocol.     

几何量子计算和拓扑量子计算——整体性量子现象的新应用

本文概述介绍量子计算的最新进展:几何量子计算和拓扑量子计算,是初步入门的引论性质。作者从量子力学的整体性现象这一观点出发,阐述作为整体现象的量子力学几何相位(亚贝尔和非亚贝尔几何相位),量子体系的拓扑不变性质等的新应用,为先前一本著作[1]所阐述观点的新发展的补充。     

Quantum teleportation of optical quantum gates

We show that a universal set of gates for quantum computation with optics can be quantum teleported through the use of EPR entangled states, homodyne detection, and linear optics and squeezing operations conditioned on measurement outcomes. This scheme may be used for fault-tolerant quantum computation in any optical scheme (qubit or continuous-variable). The teleportation of nondeterministic nonlinear gates employed in linear optics quantum computation is discussed.     

Homological stabilizer codes

In this paper we define homological stabilizer codes on qubits which encompass codes such as Kitaev’s toric code and the topological color codes. These codes are defined solely by the graphs they reside on. This feature allows us to use properties of topological graph theory to determine the graphs which are suitable as homological stabilizer codes. We then show that all toric codes are equivalent to homological stabilizer codes on 4-valent graphs. We show that the topological color codes and toric codes correspond to two distinct classes of graphs. We define the notion of label set equivalencies and show that under a small set of constraints the only homological stabilizer codes without local logical operators are equivalent to Kitaev’s toric code or to the topological color codes.     

Quantum computation and error correction based on continuous variable cluster states

Measurement-based quantum computation with continuous variables, which realizes computation by performing measurement and feedforward of measurement results on a large scale Gaussian cluster state, provides a feasible way to implement quantum computation. Quantum error correction is an essential procedure to protect quantum information in quantum computation and quantum communication. In this review, we briefly introduce the progress of measurement-based quantum computation and quantum error correction with continuous variables based on Gaussian cluster states. We also discuss the challenges in the fault-tolerant measurement-based quantum computation with continuous variables.     

量子计算与量子模拟

量子计算和量子模拟在过去的几年里发展迅速,今后涉及多量子比特的量子计算和量子模拟将是一个发展的重点.本文回顾了该领域的主要进展,包括量子多体模拟、量子计算、量子计算模拟器、量子计算云平台、量子软件等内容,其中量子多体模拟又涵盖量子多体动力学、时间晶体及多体局域化、量子统计和量子化学等的模拟.这些研究方向的回顾是基于对现阶段量子计算和量子模拟研究特点的考虑,即量子比特数处于中等规模而量子操控精度还不具有大规模逻辑门实现的能力,研究处于基础科研和实用化的过渡阶段,因此综述的内容主要还是希望管窥今后的发展.     

Noisy intermediate-scale quantum computers

Quantum computers have made extraordinary progress over the past decade, and significant milestones have been achieved along the path of pursuing universal fault-tolerant quantum computers. Quantum advantage, the tipping point heralding the quantum era, has been accomplished along with several waves of breakthroughs. Quantum hardware has become more integrated and architectural compared to its toddler days. The controlling precision of various physical systems is pushed beyond the fault-tolerant threshold. Meanwhile, quantum computation research has established a new norm by embracing industrialization and commercialization. The joint power of governments, private investors, and tech companies has significantly shaped a new vibrant environment that accelerates the development of this field, now at the beginning of the noisy intermediate-scale quantum era. Here, we first discuss the progress achieved in the field of quantum computation by reviewing the most important algorithms and advances in the most promising technical routes, and then summarizing the next-stage challenges. Furthermore, we illustrate our confidence that solid foundations have been built for the fault-tolerant quantum computer and our optimism that the emergence of quantum killer applications essential for human society shall happen in the future.     

Experimental preparation of topologically ordered states via adiabatic evolution

Topological orders are a class of exotic states of matter characterized by patterns of long-range entanglement. Certain topologically ordered systems are proposed as potential realization of fault-tolerant quantum computation. Topological orders can arise in two-dimensional spin-lattice models. In this paper, we engineer a time-dependent Hamiltonian to prepare a topologically ordered state through adiabatic evolution. The other sectors in the degenerate ground-state space of the model are obtained by applying nontrivial operations corresponding to closed string operators. Each sector is highly entangled, as shown from the completely reconstructed density matrices. This paves the way towards exploring the properties of topological orders and the application of topological orders in topological quantum memory.     

Quantum computation with two-dimensional graphene quantum dots

We study an array of graphene nano sheets that form a two-dimensional S=1/2 Kagome spin lattice used for quantum computation. The edge states of the graphene nano sheets are used to form quantum dots to confine electrons and perform the computation. We propose two schemes of bang-bang control to combat decoherence and realize gate operations on this array of quantum dots. It is shown that both schemes contain a great amount of information for quantum computation. The corresponding gate operations are also proposed.     

从离散Wigner函数的角度探讨量子相干性度量

量子相干性是量子信息处理的基本要素,在量子计算中扮演着重要的角色.为了便于讨论量子相干性在量子计算中的作用,本文从离散Wigner函数角度对量子相干性进行了探讨.首先对奇素数维量子系统的离散Wigner函数进行了分析,分离出表征相干性的部分,提出了一种可能的基于离散Wigner函数的量子相干性度量方法,并对其进行了量子相干性度量规范的分析;同时也比较了该度量与l_1范数相干性度量之间的关系.重要的是,这种度量方法能够明确给出量子相干性程度与衡量量子态量子计算加速能力的负性和之间不等式关系,由此可以解析地解释量子相干性仅是量子计算加速的必要条件.