A novel quantum information hiding protocol based on entanglement swapping of high-level Bell states

Using entanglement swapping of high-level Bell states, we first derive a covert layer between the secret message and the possible output results of the entanglement swapping between any two generalized Bell states, and then propose a novel high-efficiency quantum information hiding protocol based on the covert layer. In the proposed scheme, a covert channel can be built up under the cover of a high-level quantum secure direct communication(QSDC) channel for securely transmitting secret messages without consuming any auxiliary quantum state or any extra communication resource. It is shown that this protocol not only has a high embedding efficiency but also achieves a good imperceptibility as well as a high security.     

Towards optimization of quantum circuits

Any unitary operation in quantum information processing can be implemented via a sequence of simpler steps — quantum gates. However, actual implementation of a quantum gate is always imperfect and takes a finite time. Therefore, searching for a short sequence of gates — efficient quantum circuit for a given operation, is an important task. We contribute to this issue by proposing optimization of the well-known universal procedure proposed by Barenco et al. [Phys. Rev. A 52, 3457 (1995)]. We also created a computer program which realizes both Barenco’s decomposition and the proposed optimization. Furthermore, our optimization can be applied to any quantum circuit containing generalized Toffoli gates, including basic quantum gate circuits.      

Ballistic Aharonov–Bohm quantum bits and quantum gates

We propose an architecture to perform quantum computation, using ballistic electrons as qubits and coupled quantum rings as quantum gates. In the proposed architecture two adjacent one-dimensional wires, creating a single qubit, are connected to two coupled quantum rings, where the required magnetic flux is provided by enclosed nano-sized magnets. The phase modulation of the wave function of the ballistic electrons under the Aharonov–Bohm effect is carefully designed to facilitate reprogrammable and dynamically controllable quantum gates. Arbitrary single-qubit quantum gates with high fidelity can be constructed on the basis of this architecture.     

非线性相互作用下三qubit系统中的量子关联

通过对系统施加不同的非线性作用,利用量子关联的几何度量,研究了三个qubit体系中的两体量子关联.不同的非线性相互作用模型都能使系统产生最大值为0.1752的量子关联.z方向的横场对量子关联的优化有控制作用,对于三个模型,通过调节z方向的横场,系统能产生最大值为0.09645的平均量子关联.最佳组合的三个横场,不仅能够大幅度提高量子关联的振荡周期,使得两qubit长时间处于量子关联态,而且还能够提高两qubit的平均量子关联.     

Optimization of One-Way Quantum Computation Measurement Patterns

In one-way quantum computation (1WQC), an initial highly entangled state, called a graph state, is used to perform universal quantum computations by a sequence of adaptive single-qubit measurements and post-measurement Pauli-X and Pauli-Z corrections. 1WQC computation can be represented by a measurement pattern (or simply a pattern). The entanglement operations in a pattern can be shown by a graph which together with the identified set of its input and output qubits is called the geometry of the pattern. Since a pattern is based on quantum measurements, which are fundamentally nondeterministic evolutions, there must be conditions over geometries to guarantee determinism. These conditions are formalized by the notions of flow and generalized flow (gflow). Previously, three optimization methods have been proposed to optimize 1WQC patterns which can be performed using the measurement calculus formalism by rewriting rules. However, the serial implementation of these rules is time consuming due to executing many ineffective commutation rules. To overcome this problem, in this paper, a new scheme is proposed to perform the optimization techniques simultaneously on patterns with flow and only gflow based on their geometries. Furthermore, the proposed scheme obtains the maximally delayed gflow order for geometries with flow. It is shown that the time complexity of the proposed approach is improved over the previous ones.     

Novel Quantum Virtual Private Network Scheme for PON via Quantum Secure Direct Communication

Two quantum secure direct communication (QSDC) protocols with quantum identification (QI) based on passive optical network (PON) architecture are proposed. One QSDC protocol can be implemented between two different optical network units just with simple configurations of PON by optical line terminal when they are in the same virtual private network after optical line terminal performing QI to the optical network units in the given PON architecture. The other QSDC protocol is also implemented between any two legitimated users in the virtual private network but with considerable reduction of workload of the optical line terminal. The security analysis shows that the proposed QSDC schemes with quantum identification are unconditionally secure and allow the legitimate users to exchange their secret information efficiently and to realize a quantum virtual private network in the PON networks ultimately.     

Experimental realization of single-shot nonadiabatic holonomic gates in nuclear spins

Nonadiabatic holonomic quantum computation has received increasing attention due to its robustness against control errors.However,all the previous schemes have to use at least two sequentially implemented gates to realize a general one-qubit gate.Based on two recent reports,we construct two Hamiltonians and experimentally realized nonadiabatic holonomic gates by a single-shot implementation in a two-qubit nuclear magnetic resonance(NMR)system.Two noncommuting one-qubit holonomic gates,rotating along x?and z?axes respectively,are implemented by evolving a work qubit and an ancillary qubit nonadiabatically following a quantum circuit designed.Using a sequence compiler developed for NMR quantum information processor,we optimize the whole pulse sequence,minimizing the total error of the implementation.Finally,all the nonadiabatic holonomic gates reach high unattenuated experimental fidelities over 98%.     

Generation of pure electrical quadrature amplitude modulation with photonic vector modulator

A photonic vector modulator architecture for generating pure quadrature amplitude modulation (QAM) signals is presented. An electrical quadrature-modulated signal at microwave-millimeter-wave frequencies is generated from its corresponding baseband in-phase (I) and quadrature (Q) components. In the proposed scheme, no electrical devices apart from the electrical tone oscillator are needed in the generation process. In addition, the purity of the generated signal is increased, and the hardware requirements are reduced when compared with previously proposed architectures so a highly compact low-cost architecture can be implemented. A pure 1.25 Gbit/s 4-QAM signal has been experimentally generated at a 42 GHz carrier frequency.     

Universal fault-tolerant quantum computation on decoherence-free subspaces

A general scheme to perform universal, fault-tolerant quantum computation within decoherence-free subspaces (DFSs) is presented. At most two-qubit interactions are required, and the system remains within the DFS throughout the entire implementation of a quantum gate. We show explicitly how to perform universal computation on clusters of the four-qubit DFS encoding one logical qubit each under spatially symmetric (collective) decoherence. Our results have immediate relevance to quantum computer implementations in which quantum logic is implemented through exchange interactions, such as the recently proposed spin-spin coupled quantum dot arrays and donor-atom arrays.     

基于深度架构网络的矮新星自动分类研究

矮新星是一类特殊而稀少的半相接双星。发现更多的矮新星对于深入研究物质转移理论、理解密近双星演化过程意义深远。利用深度学习技术提取天体光谱特征并进而分类是天文数据处理领域的研究热点。传统的自编码器是仅包含一个隐层的经典神经网络模型,编码能力有限,数据表征学习能力不足。模块化拓宽神经网络的深度能够驱使网络继承地学习到天体光谱的特征,通过对底层特征的逐渐抽象学习获得高层特征,进而提高光谱的分类准确率。以自编码器为基础构建了由输入层、若干隐藏层和输出层组成的基于多层感知器架构的深度前馈堆栈式自编码器网络,用于处理海量的光谱数据集,挖掘隐藏在光谱内部具有区分度的深度结构特征,实现对矮新星光谱的准确分类。鉴于深度架构网络的参数设置会严重影响所构建网络的性能,将网络参数的优化分为逐层训练和反向传播两个过程。预处理后的光谱数据先由输入层进入网络,再经自编码器算法和权值共享实现对网络参数的逐层训练。反向传播阶段将初始样本数据再次输入网络,以逐层训练所得的权值对网络初始化,再把网络各层的局部优化训练结果融合起来,根据所设置的输出误差代价函数调整网络参数。反复地逐层训练和反向传播,直到获得全局最优的网络参数。最后由末隐层作为重构层搭建支持向量机分类器,实现对矮新星的特征提取与分类。网络参数优化过程中利用均值网络思想使网络隐层单元输出按照dropout系数衰减,并由反向传播算法微调整个网络,从而防止发生深度过拟合现象,减少因隐层神经元间的相互节制而学习到重复的数据表征,提高网络的泛化能力。该网络分布式的多层次架构能够提供有效的数据抽象和表征学习能力,其特征检测层可从无标注数据中隐式地学习到深度结构特征,有效刻画光谱数据的非线性和随机波动性,避免了光谱特征的显式提取,体现出较强的数据拟合和泛化能力。不同层之间的权值共享能够减少冗余信息的干扰,有效化解传统多层次架构网络易陷入权值局部最小化的风险。实验表明,该深度架构网络在矮新星分类任务中能达到95.81%的准确率,超过了经典的LM-BP网络。     

离散混沌系统的最小能量控制

对于离散混沌系统的最小能量控制问题，提出了一种框架性方法，该方法具有通用性.首先，设计一个二次目标函数，同时把混沌系统分解为线性部分和非线性部分两项和.然后，提出了求解非线性最优控制问题的两级算法：第一级对混沌系统中的非线性部分进行预估，以使原系统变为带有常数项的线性系统；第二级用动态规划求解一个非典型线性二次最优控制问题，并把解返回第一级，第一级根据第二级的解对非线性部分重新预估.这样通过两级间不断的信息交换，最终得到混沌系统的最优控制律.该方法不仅实现了对混沌系统的控制，而且在整个控制过程中消耗的控制能量最小. 关键词： 混沌系统 两级优化 最优控制     

Classical Concepts in Quantum Programming

The rapid progress of computer technology has been accompanied by a corresponding evolution of software development, from hardwired components and binary machine code to high level programming languages, which allowed to master the increasing hardware complexity and fully exploit its potential. This paper investigates, how classical concepts like hardware abstraction, hierarchical programs, data types, memory management, flow of control, and structured programming can be used in quantum computing. The experimental language QCL will be introduced as an example, how elements like irreversible functions, local variables, and conditional branching, which have no direct quantum counterparts, can be implemented, and how nonclassical features like the reversibility of unitary transformation or the nonobservability of quantum states can be accounted for within the framework of a procedural programming language.     

Modeling and performance analysis of optical WDM node architecture using SRR protocol

In order to enhance the data transport capability and overall throughput of an optical wavelength division multiplexing (WDM) system, a proper node architecture design is necessary. In the present paper a simple node architecture model based on media access control protocols for bursty data traffic of variable time slot duration and data rate has been proposed to decrease the packet loss probability and to increase the efficiency of an optical WDM system using synchronous round robin (SRR) protocol. An appropriate mathematical model has been derived to evaluate performance of the proposed node architecture. It has been observed that the network performance is well controlled through implemented model and the corresponding network design parameters.     

量子过程神经网络模型算法及应用

为提高过程神经网络的逼近和泛化能力, 从研究过程神经元信息处理的量子计算实现机理入手, 提出基于量子旋转门及多位受控非门的物理意义构造量子过程神经元的新思想. 将离散化后的过程式输入信息作为受控非门的控制位, 经过量子旋转门作用后控制目标量子位的状态, 以目标量子位处于状态|1>概率幅作为量子过程神经元的输出. 以量子过程神经元为隐层, 普通神经元为输出层, 可构成量子过程神经网络. 基于量子计算机理推导了该模型的学习算法. 将该模型用于太阳黑子数年均值预测, 应用结果表明, 所提方法与普通过程神经网络相比, 预测精度有所提高, 对于复杂预测问题具有一定理论意义和实用价值.     

基于哈希理论和线性近邻传递反馈的乳腺X线图像肿块检索方法

在乳腺X线图像肿块检测中存在较高的假阳性率,通过基于内容的肿块检索,将待判定肿块与已确诊肿块进行相似性分析,可有效降低假阳性率.本文提出了一种结合可区分锚点图哈希和线性近邻传递的乳腺图像肿块检索方法.针对传统锚点图哈希在相似度定义中没有考虑病理相关性的问题,引入病理类别至锚点图哈希图像相似度计算,提出了可区分锚点图哈希以重新表示图像.利用线性近邻传递作为相关反馈技术,基于图像底层特征表达与图像高层语义间的学习机制,实现交互式肿块图像检索.采用北京大学人民医院乳腺中心提供的临床图像作为实验数据,实验结果表明,引入病理类别的可区分锚点图哈希图像表达在肿块相似性分析上优于传统锚点图哈希.相比于现有方法,本文提出的方法在肿块检索性能上得到明显提高.     

Linear-scaling and parallelisable algorithms for stochastic quantum chemistry

For many decades, quantum chemical method development has been dominated by algorithms which involve increasingly complex series of tensor contractions over one-electron orbital spaces. Procedures for their derivation and implementation have evolved to require the minimum amount of logic and rely heavily on computationally efficient library-based matrix algebra and optimised paging schemes. In this regard, the recent development of exact stochastic quantum chemical algorithms to reduce computational scaling and memory overhead requires a contrasting algorithmic philosophy, but one which when implemented efficiently can achieve higher accuracy/cost ratios with small random errors. Additionally, they can exploit the continuing trend for massive parallelisation which hinders the progress of deterministic high-level quantum chemical algorithms. In the Quantum Monte Carlo community, stochastic algorithms are ubiquitous but the discrete Fock space of quantum chemical methods is often unfamiliar, and the methods introduce new concepts required for algorithmic efficiency. In this paper, we explore these concepts and detail an algorithm used for Full Configuration Interaction Quantum Monte Carlo (FCIQMC), which is implemented and available in MOLPRO and as a standalone code, and is designed for high-level parallelism and linear-scaling with walker number. Many of the algorithms are also in use in, or can be transferred to, other stochastic quantum chemical methods and implementations. We apply these algorithms to the strongly correlated chromium dimer to demonstrate their efficiency and parallelism.     

一种NMR谱仪控制台软件系统的多层架构设计

提出了一种用于核磁共振（Nuclear Magnetic Resonance, NMR）谱仪控制台软件系统的多层架构设计. 该设计在逻辑功能上将系统抽象为Linux硬件设备驱动、驱动接口、业务逻辑、网络传输和协议控制5层,每一层完成系统中特定的功能,并且独立维护. 这种采用分层的设计方式降低了系统的耦合性,简化了系统结构; 并且能多层同时开发,提高了编程效率,缩短了开发周期. 严格测试后,该软件系统与实验室自主研发的硬件联合调试,运行良好,能够长期稳定的进行实验操作,满足设计要求.     

Data provider system — research and development of data service at Huairou Solar Observing Station (HSOS)

The data provider system has to provide users with reliable, constant and timely data information, and it has to guarantee further developments of new data applications. We develop a data provider system of hierarchical architecture with components, interactions and relationships in each layer. The system enables each layer to act in concert with each other without restrictions. It contributes to implementing the goal. The main frame of the data provider system has already been successfully implemented, the others of each layer are on the way according to the architecture.     

Fast Gaussian wavepacket transforms and Gaussian beams for the Schrödinger equation

This paper introduces a wavepacket-transform-based Gaussian beam method for solving the Schrödinger equation. We focus on addressing two computational issues of the Gaussian beam method: how to generate a Gaussian beam representation for general initial conditions and how to perform long time propagation for any finite period of time. To address the first question, we introduce fast Gaussian wavepacket transforms and develop on top of them an efficient initialization algorithm for general initial conditions. Based on this new initialization algorithm, we address the second question by reinitializing the beam representation when the beams become too wide. Numerical examples in one, two, and three dimensions demonstrate the efficiency and accuracy of the proposed algorithms. The methodology can be readily generalized to deal with other semi-classical quantum mechanical problems.     

Data center application oriented control architecture in multi-domain optical networks

With the rapid development of cloud computing, data center application based on considerable storage and computing has become one of the most important service types. Currently the high performance computing facilities and large-capacity storage devices are highly distributed in different locations. Then how to make full use of the current data center mainly depends on the effective joint scheduling of application layer and network layer resources. According to the rigid requirement of data center application, a novel convergence control architecture, i.e. Service-Oriented Group Engine (SOGE) framework is proposed in multi-domain optical networks based on DREAM architecture, and also the corresponding resource demand model (RDM) is built. A resource joint scheduling algorithm (RJSA) for application layer and network layer resource is proposed and implemented based on SOGE framework. Moreover, the SOGE framework and resource joint scheduling algorithm are validated and demonstrated on the test-bed based on DREAM architecture.