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.     

量子Harper模型的量子计算鲁棒性与耗散退相干

运用量子轨迹和量子Monte Carlo仿真的方法，研究耗散退相干对周期驱动的量子Harper (quantum kicked Harper, QKH)模型量子计算的影响.数值仿真结果表明，一定强度的耗散干扰将破坏QKH特征状态的动态局域化以及相空间的随机网结构.以相位阻尼信道噪声模型为例分析了保真度的衰减规律以及可信计算时间尺度.与静态干扰相比，在干扰强度小于某一阈值时，耗散干扰下的可信计算时间尺度随量子比特的增加而快速下降；而在干扰强度大于该阈值时，静态干扰下的可信计算时间尺度下降更快.     

量子Harper模型的量子计算鲁棒性与耗散退相干

运用量子轨迹和量子Monte Carlo仿真的方法,研究耗散退相干对周期驱动的量子Harper (quantum kicked Harper, QKH)模型量子计算的影响.数值仿真结果表明,一定强度的耗散干扰将破坏QKH特征状态的动态局域化以及相空间的随机网结构.以相位阻尼信道噪声模型为例分析了保真度的衰减规律以及可信计算时间尺度.与静态干扰相比,在干扰强度小于某一阈值时,耗散干扰下的可信计算时间尺度随量子比特的增加而快速下降;而在干扰强度大于该阈值时,静态干扰下的可信计算时间尺度下降更快. 关键词： 量子计算 量子Harper模型 主方程 量子Monte Carlo方法     

量子计算与量子模拟

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

量子计算的物理实现

与经典计算相比，量子计算对信息的处理和计算有很大的优越性．在量子计算研究中，其物理实现方法的研究是一个重要部分．文章首先介绍了DiVincenzo关于量子计算的物理实现技术的7个判据，然后简要介绍了目前实现量子计算的10种物理实现方法，包括离子阱、中性原子、光学、超导约瑟夫森结、腔量子电动力学、液体核磁共振、Kane的硅基半导体方案、富勒球、量子点和液氦表面电子，基本上涵盖了目前的量子计算物理实现的进展情况．     

几何量子计算

实现可集成的量子计算的关键步骤是实现保真度足够高的一组普适量子逻辑门，最近几年发展的几何量子计算使用几何位相来实现量子逻辑门，其特点是利用几何位相的整体几何性质来避免某些局域的无规噪声的影响，从而实现较高保真度的量子门，文章先简要介绍常规几何量子逻辑门的概念，然后重点介绍最近提出的非常规几何量子计算：量子计算中使用的逻辑门的总位相既包含有几何位相，又包含有动力学位相，但它仅依赖于一些几何特征，而且，对于任意的量子位输入态，在量子门操作过程中积累的位相要么是零，要么是仅依赖几何特征的位相。     

周期驱动的Harper模型的量子计算鲁棒性与量子混沌

以周期驱动的量子Harper(quantum kicked Harper, QKH)模型为例，研究复杂量子动力系统的量子计算在各种干扰下的稳定性.通过对Floquet算子本征态的统计遍历性及其Husimi函数的分析，比较随机噪声干扰和静态干扰对量子计算不同程度的影响.进一步的保真度摄动分析表明，在随机噪声干扰下保真度随系统演化呈指数衰减，而静态干扰下的保真度为高斯衰减，并通过数值计算得到了干扰下的可信计算时间尺度.与经典混沌仿真中误差使状态产生指数分离不同，量子计算对状态干扰的稳定性和仿真模型的动力学特性无关. 关键词： 量子Harper模型 量子计算 量子混沌 保真度     

从分数量子霍尔效应到拓扑量子计算

分数量子霍尔效应系统是奇异的量子液体,其中的准粒子激发可以带分数电荷,甚至具有非阿贝尔的统计性质。理论研究表明,这些准粒子可以用来实现在硬件上可容错的量子计算,即拓扑量子计算。文章在介绍分数量子霍尔效应及其在拓扑量子计算中的潜在应用基础上,重点回顾了近五年来对填充因子为5/2的分数量子霍尔态中非阿贝尔准粒子的实验探测和部分相关理论诠释。     

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.     

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.     

约瑟夫森器件中的宏观量子现象及超导量子计算

超导体中的电子结成库珀对，凝聚到可以用一个宏观波函数来描绘的能量基态，该波函数的位相是代表了成百万库珀对集体运动的宏观变量．以约瑟夫森结为基础元件的超导约瑟夫森器件，使人们能够控制并测量一个超导体的位相和库珀对数目，因此是研究宏观量子现象的理想系统．文章回顾了约瑟夫森器件中的宏观量子现象研究的发展历程，介绍了当前超导约瑟夫森器件在量子计算中的重要应用，并对它们的未来作了简要的展望．     

Quantum simulation and quantum computation of noisy-intermediate scale

In the past years, great progresses have been made on quantum computation and quantum simulation. Increasing the number of qubits in the quantum processors is expected to be one of the main motivations in the next years, while noises in manipulation of quantum states may still be inevitable even the precision will improve. For research in this direction, it is necessary to review the available results about noisy multiqubit quantum computation and quantum simulation. The review focuses on multiqubit state generations, quantum computational advantage, and simulating physics of quantum many-body systems. Perspectives of near term noisy intermediate-quantum processors will be discussed.     

Blind quantum computation with identity authentication

Blind quantum computation (BQC) allows a client with relatively few quantum resources or poor quantum technologies to delegate his computational problem to a quantum server such that the client's input, output, and algorithm are kept private. However, all existing BQC protocols focus on correctness verification of quantum computation but neglect authentication of participants' identity which probably leads to man-in-the-middle attacks or denial-of-service attacks. In this work, we use quantum identification to overcome such two kinds of attack for BQC, which will be called QI-BQC. We propose two QI-BQC protocols based on a typical single-server BQC protocol and a double-server BQC protocol. The two protocols can ensure both data integrity and mutual identification between participants with the help of a third trusted party (TTP). In addition, an unjammable public channel between a client and a server which is indispensable in previous BQC protocols is unnecessary, although it is required between TTP and each participant at some instant. Furthermore, the method to achieve identity verification in the presented protocols is general and it can be applied to other similar BQC protocols.     

A realizable quantum encryption algorithm for qubits

A realizable quantum encryption algorithm for qubits is presented by employing bit-wise quantum computation. System extension and bit-swapping are introduced into the encryption process, which makes the ciphertext space expanded greatly. The security of the proposed algorithm is analysed in detail and the schematic physical implementation is also provided. It is shown that the algorithm, which can prevent quantum attack strategy as well as classical attack strategy, is effective to protect qubits. Finally, we extend our algorithm to encrypt classical binary bits and quantum entanglements.     

Geometric global quantum discord of two-qubit states

We consider the geometric global quantum discord(GGQD) of two-qubit systems. By analyzing the symmetry of geometric global quantum discord we give an approach for deriving analytical formulae of the extremum problem which lies at the core of computing the GGQD for arbitrary two-qubit states. Furthermore, formulae of GGQD of arbitrary two-qubit states and some concrete examples are presented.     

光子两自由度超并行量子计算与超纠缠态操控

光子系统在量子信息处理和传输过程中有非常重要的应用. 譬如, 利用光子与原子(或人工原子)之间的相互作用, 可以完成信息的安全传输、存储和快速的并行计算处理等任务. 光子系统具有多个自由度, 如极化、空间模式、轨道角动量、时间-能量、频率等自由度. 光子系统的多个自由度可以同时应用于量子信息处理过程. 超并行量子计算利用光子系统多个自由度的光量子态同时进行量子并行计算, 使量子计算具有更强的并行性, 且需要的量子资源少, 更能抵抗光子数损耗等噪声的影响. 多个自由度同时存在纠缠的光子系统量子态称为超纠缠态, 它能够提高量子通信的容量与安全性, 辅助完成一些重要的量子通信任务. 在本综述中, 我们简要介绍了光子系统两自由度量子态在量子信息中的一些新应用, 包括超并行量子计算、超纠缠态分析、超纠缠浓缩和纯化三个部分.     

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.     

A new computation scheme for triangular quantum billiards

A new scheme for computing the eigenvalues and eigenstates of the Laplacian with Dirichlet boundary conditions on arbitrary triangular domains is presented. Its reliability is tested by comparing numerical results with analytical ones whenever possible. The computation of eigenvalues shows a good agreement with analytical results. The procedure is shown to give accurate results also in the case of eigenfunctions computation. Finally, the sensitivity of our scheme to the geometry of the domain is discussed and the algorithm is shown to detect small changes in the shape of the domain.     

Rydberg quantum computation with nuclear spins in two-electron neutral atoms

Alkaline-earth-like (AEL) atoms with two valence electrons and a nonzero nuclear spin can be excited to Rydberg state for quantum computing. Typical AEL ground states possess no hyperfine splitting, but unfortunately a GHz-scale splitting seems necessary for Rydberg excitation. Though strong magnetic fields can induce a GHz-scale splitting, weak fields are desirable to avoid noise in experiments. Here, we provide two solutions to this outstanding challenge with realistic data of well-studied AEL isotopes. In the first theory, the two nuclear spin qubit states |0〉 and |1〉 are excited to Rydberg states |r〉 with detuning Δ and 0, respectively, where a MHz-scale detuning Δ arises from a weak magnetic field on the order of 1 G. With a proper ratio between Δ and Ω, the qubit state |1〉 can be fully excited to the Rydberg state while |0〉 remains there. In the second theory, we show that by choosing appropriate intermediate states a two-photon Rydberg excitation can proceed with only one nuclear spin qubit state. The second theory is applicable whatever the magnitude of the magnetic field is. These theories bring a versatile means for quantum computation by combining the broad applicability of Rydberg blockade and the incomparable advantages of nuclear-spin quantum memory in two-electron neutral atoms.