Parameter estimation and system identification for continuously-observed quantum systems

This paper gives an overview of parameter estimation and system identification for quantum input–output systems by continuous observation of the output field. We present recent results on the quantum Fisher information of the output with respect to unknown dynamical parameters. We discuss the structure of continuous-time measurements as solutions of the quantum Zakai equation, and their relationship to parameter estimation methods. Proceeding beyond parameter estimation, the paper also gives an overview of the emerging topic of quantum system identification for black-box modelling of quantum systems by continuous observation of a travelling wave probe, for the case of ergodic quantum input–output systems and linear quantum systems. Empirical methods for such black-box modelling are also discussed.     

基于机器学习的量子通信激光器功率控制系统设计

量子通信激光器的频段的带宽更宽,在无线通信方面具有潜在的超高传输容量,也能够发挥快速波载的应用特性。但受功率控制的不协调因素限制,量子通信激光器在数据传输中脉冲功率会产生波动,导致传输带宽产生畸变,研究基于机器学习的量子通信激光器功率控制系统设计方法。以获取不同的控制指令为前提条件,将单片机和FPGA作为量子通信激光器主控单元。采用A/D作为转换单元,通过串行封装设计转换电路。基于机器学习分析电流与电压关系,实现系统硬件设计;构建量子通信激光机通信检测单元,在多量子耦合关系下,设定激光器有源区控制形式,基于介电常数分析激光器运行模式,对应量子通信功率反馈条件。基于机器学习中Q函数算法,寻找功率最优控制方案,完成系统软件设计。实验结果表明：以小信号增益为测试的变量条件,应用本文系统控制量子通信激光器脉冲功率,能够在50次往返过程中实现功率的稳定控制,且脉冲宽度没有发生畸变,具有应用效果。     

量子系统中状态估计方法的综述

从广泛用于实验量子领域的典型状态估计方法,到基于系统论观点、可用于量子反馈控制的状态估计方法,详细综述了4种测量方式下的相应量子状态估计方法及其适用背景.通过其发展历程的叙述,从本质上阐述了估计的基本原理,从技术上对各种方法进行了相应的分析和比较.同时,对量子状态估计和经典状态估计进行了相应的比较,并对量子系统中的状态估计方法作了总结.     

Classically-controlled Quantum Computation

It is reasonable to assume that quantum computations take place under the control of the classical world. For modelling this standard situation, we introduce a Classically-controlled Quantum Turing Machine (CQTM) which is a Turing machine with a quantum tape for acting on quantum data, and a classical transition function for a formalized classical control. In CQTM, unitary transformations and quantum measurements are allowed. We show that any classical Turing machine is simulated by a CQTM without loss of efficiency. Furthermore, we show that any k-tape CQTM is simulated by a 2-tape CQTM with a quadratic loss of efficiency. The gap between classical and quantum computations which was already pointed out in the framework of measurement-based quantum computation (see [S. Perdrix, Ph. Jorrand, Measurement-Based Quantum Turing Machines and their Universality, arXiv, quant-ph/0404146, 2004]) is confirmed in the general case of classically-controlled quantum computation. In order to appreciate the similarity between programming classical Turing machines and programming CQTM, some examples of CQTM will be given in the full version of the paper. Proofs of lemmas and theorems are omitted in this extended abstract.     

量子机器学习

人工智能和量子物理是上世纪发展起来的两个截然不同但又影响深远的学科.近年来,它们在数据科学方面的结合引起了学术界的高度关注,形成了量子机器学习这个新兴领域.利用量子态的叠加性,量子机器学习有望通过量子并行解决目前机器学习中数据量大,训练过程慢的困难,并有望从量子物理的角度提出新的学习模型.目前该领域的研究还处于探索阶段,涵盖内容虽然广泛,但还缺乏系统的梳理.本文将从数据和算法角度总结量子机器学习与经典机器学习的不同,以及其中涉及的关键加速技巧,针对数据结构(数字型、模拟型),计算技巧(相位估计、Grover搜索、内积计算),基础算法(求解线性系统、主成分分析、梯度算法),学习模型(支持向量机、近邻法、感知器、玻尔兹曼机)等4个方面对现有研究成果进行综述,并建议一些可能的研究方向,供本领域的研究人员参考.     

基于相干控制的二能级量子系统退相干抑制

对于二能级开放量子系统,研究了利用相干控制抑制退相干效应的问题.首先讨论了二能级开放量子系统在相干控制下的建模问题,将退相干抑制归结为与环境噪声解耦的控制问题.然后,引入开环控制抑制退相干,并证明该控制可使系统状态中的部分分量与环境噪声渐近解耦.最后引入反馈控制,使得系统状态的相应分量可以与环境精确解耦,同时能够避免测量引入的量子噪声的影响.     

Analysis and synthesis of attractive quantum Markovian dynamics

We propose a general framework for investigating a large class of stabilization problems in Markovian quantum systems. Building on the notions of invariant and attractive quantum subsystem, we characterize attractive subspaces by exploring the structure of the invariant sets for the dynamics. Our general analysis results are exploited to assess the ability of open-loop Hamiltonian and output-feedback control strategies to synthesize Markovian generators which stabilize a target subsystem, subspace, or pure state. In particular, we provide an algebraic characterization of the manifold of stabilizable pure states in arbitrary finite-dimensional Markovian systems, that leads to a constructive strategy for designing the relevant controllers. Implications for stabilization of entangled pure states are addressed by example.     

Estimation of Quantum Channels with Finite Resources

We examine the problem of determining the parameters that describe a quantum channel. It is assumed that the users of the channel have at best only partial knowledge of it and make use of a finite amount of resources to estimate it. We discuss simple protocols for the estimation of the parameters of several classes of channels that are studied in the current literature. A quantitative measures of the quality of the estimation schemes can be given on the basis of the standard deviation or of the fidelity. Protocols that employ entangled particles are also discussed. The use of entangled particles as a nonclassical resource enhances the estimation quality of some classes of quantum channel. Further, the methods presented here can be extended to higher dimensional quantum systems. PACS: 03.67.Hk     

Quantum Fuzzy Support Vector Machine for Binary Classification

In the objective world, how to deal with the complexity and uncertainty of big data efficiently and accurately has become the premise and key to machine learning. Fuzzy support vector machine (FSVM) not only deals with the classification problems for training samples with fuzzy information, but also assigns a fuzzy membership degree to each training sample, allowing different training samples to contribute differently in predicting an optimal hyperplane to separate two classes with maximum margin, reducing the effect of outliers and noise, Quantum computing has super parallel computing capabilities and holds the promise of faster algorithmic processing of data. However, FSVM and quantum computing are incapable of dealing with the complexity and uncertainty of big data in an efficient and accurate manner. This paper research and propose an efficient and accurate quantum fuzzy support vector machine (QFSVM) algorithm based on the fact that quantum computing can efficiently process large amounts of data and FSVM is easy to deal with the complexity and uncertainty problems. The central idea of the proposed algorithm is to use the quantum algorithm for solving linear systems of equations (HHL algorithm) and the least-squares method to solve the quadratic programming problem in the FSVM. The proposed algorithm can determine whether a sample belongs to the positive or negative class while also achieving a good generalization performance. Furthermore, this paper applies QFSVM to handwritten character recognition and demonstrates that QFSVM can be run on quantum computers, and achieve accurate classification of handwritten characters. When compared to FSVM, QFSVM’s computational complexity decreases exponentially with the number of training samples.     

Kernel methods in system identification,machine learning and function estimation: A survey

Most of the currently used techniques for linear system identification are based on classical estimation paradigms coming from mathematical statistics. In particular, maximum likelihood and prediction error methods represent the mainstream approaches to identification of linear dynamic systems, with a long history of theoretical and algorithmic contributions. Parallel to this, in the machine learning community alternative techniques have been developed. Until recently, there has been little contact between these two worlds. The first aim of this survey is to make accessible to the control community the key mathematical tools and concepts as well as the computational aspects underpinning these learning techniques. In particular, we focus on kernel-based regularization and its connections with reproducing kernel Hilbert spaces and Bayesian estimation of Gaussian processes. The second aim is to demonstrate that learning techniques tailored to the specific features of dynamic systems may outperform conventional parametric approaches for identification of stable linear systems.     

基于量子神经网络的油田水淹层识别方法

针对油藏测井解释中的水淹层识别问题,提出一种量子神经网络模型。该模型用量子旋转门更新量子比特的相位,用受控旋转门实现网络的非线性映射功能。网络可调参数为量子旋转门的旋转角度和受控非门的控制参数。基于梯度下降法设计了学习算法。仿真结果表明,该模型的预测能力优于普通BP网络、模糊神经网络和过程神经网络等其他方法。     

Mathematical models of quantum computation

In this paper, we introduce two mathematical models of realistic quantum computation. First, we develop a theory of bulk quantum computation such as NMR (Nuclear Magnetic Resonance) quantum computation. For this purpose, we define bulk quantum Turing machine (BQTM for short) as a model of bulk quantum computation. Then, we define complexity classes EBQP, BBQP and ZBQP as counterparts of the quantum complexity classes EQP, BQP and ZQP, respectively, and show that EBQP=EQP, BBQP=BQP and ZBQP=ZQP. This implies that BQTMs are polynomially related to ordinary QTMs as long as they are used to solve decision problems. We also show that these two types of QTMs are also polynomially related when they solve a function problem which has a unique solution. Furthermore, we show that BQTMs can solve certain instances of NP-complete problems efficiently. On the other hand, in the theory of quantum computation, only feed-forward quantum circuits are investigated, because a quantum circuit represents a sequence of applications of time evolution operators. But, if a quantum computer is a physical device where the gates are interactions controlled by a current computer such as laser pulses on trapped ions, NMR and most implementation proposals, it is natural to describe quantum circuits as ones that have feedback loops if we want to visualize the total amount of the necessary hardware. For this purpose, we introduce a quantum recurrent circuit model, which is a quantum circuit with feedback loops. LetC be a quantum recurrent circuit which solves the satisfiability problem for a blackbox Boolean function includingn variables with probability at least 1/2. And lets be the size ofC (i.e. the number of the gates inC) andt be the number of iterations that is needed forC to solve the satisfiability problem. Then, we show that, for those quantum recurrent circuits, the minimum value ofmax(s, t) isO(n ²2 ^n/3). Tetsuro Nishino, D.Sc.: He is presently an Associate Professor in the Department of Information and Communication Engineering, The University of Electro-Communications. He received the B.S., M.S. and D.Sc degrees in mathematics from Waseda University, in 1982, 1984 and 1991 respectively. From 1984 to 1987, he joined Tokyo Research Laboratory, IBM Japan. From 1987 to 1992, he was a Research Associate of Tokyo Denki University, and from 1992 to 1994, he was an Associate Professor of Japan Advanced Institute of Science and Technology, Hokuriku. His main interests are circuit complexity theory, computational learning theory and quantum complexity theory.     

Coherent quantum LQG control

Based on a recently developed notion of physical realizability for quantum linear stochastic systems, we formulate a quantum LQG optimal control problem for quantum linear stochastic systems where the controller itself may also be a quantum system and the plant output signal can be fully quantum. Such a control scheme is often referred to in the quantum control literature as “coherent feedback control”. It distinguishes the present work from previous works on the quantum LQG problem where measurement is performed on the plant and the measurement signals are used as the input to a fully classical controller with no quantum degrees of freedom. The difference in our formulation is the presence of additional non-linear and linear constraints on the coefficients of the sought after controller, rendering the problem as a type of constrained controller design problem. Due to the presence of these constraints, our problem is inherently computationally hard and this also distinguishes it in an important way from the standard LQG problem. We propose a numerical procedure for solving this problem based on an alternating projections algorithm and, as an initial demonstration of the feasibility of this approach, we provide fully quantum controller design examples in which numerical solutions to the problem were successfully obtained. For comparison, we also consider the case of classical linear controllers that use direct or indirect measurements, and show that there exists a fully quantum linear controller which offers an improvement in performance over the classical ones.     

Moment quantization of inhomogeneous spin ensembles

Robust excitation of a large spin ensemble is a long-standing problem in the field of quantum information science and engineering and presents a grand challenge in quantum control. A formal theoretical treatment of this task is to formulate it as an ensemble control problem defined on an infinite-dimensional space. In this paper, we present a distinct perspective to understand and control quantum ensemble systems. Instead of directly analyzing spin ensemble systems defined on a Hilbert space, we transform them to a space where the systems have reduced dimensions with distinctive network structures through the introduction of moment representations. In particular, we illustrate the idea of moment quantization for a spin ensemble and illuminate how this technique leads to a dynamically equivalent control system of moments. This equivalence enables the control of spin ensembles through the control of their moment systems, which in turn creates a new control analysis and design paradigm for quantum ensemble systems based on the use of truncated moment systems.     

Quantum covariance and filtering

We give a tutorial exposition of the analogue of the filtering equation for quantum systems focusing on the quantum probabilistic framework and developing the ideas from the classical theory. Quantum covariances and conditional expectations on von Neumann algebras play an essential part in the presentation.     

基于参数化量子电路的量子卷积神经网络模型及应用

量子神经网络结合了量子计算与经典神经网络模型的各自优势, 为人工智能领域的未来发展提供了一种 全新的思路. 本文提出一种基于参数化量子电路的量子卷积神经网络模型, 能够针对欧几里得结构数据与非欧几里 得结构数据, 利用量子系统的计算优势加速经典机器学习任务. 在MNIST数据集上的数值仿真结果表明, 该模型具 有较强的学习能力和良好的泛化性能.     

An efficient quantum neuro-fuzzy classifier based on fuzzy entropy and compensatory operation

In this paper, a quantum neuro-fuzzy classifier (QNFC) for classification applications is proposed. The proposed QNFC model is a five-layer structure, which combines the compensatory-based fuzzy reasoning method with the traditional Takagi–Sugeno–Kang (TSK) fuzzy model. The compensatory-based fuzzy reasoning method uses adaptive fuzzy operations of neuro-fuzzy systems that can make the fuzzy logic system more adaptive and effective. Layer 2 of the QNFC model contains quantum membership functions, which are multilevel activation functions. Each quantum membership function is composed of the sum of sigmoid functions shifted by quantum intervals. A self-constructing learning algorithm, which consists of the self-clustering algorithm (SCA), quantum fuzzy entropy and the backpropagation algorithm, is also proposed. The proposed SCA method is a fast, one-pass algorithm that dynamically estimates the number of clusters in an input data space. Quantum fuzzy entropy is employed to evaluate the information on pattern distribution in the pattern space. With this information, we can determine the number of quantum levels. The backpropagation algorithm is used to tune the adjustable parameters. The simulation results have shown that (1) the QNFC model converges quickly; (2) the QNFC model has a higher correct classification rate than other models.     

基于序列输入的量子神经网络模型及算法

为提高神经网络的逼近能力,提出一种各维输入为离散序列的量子神经网络模型及算法.该模型为3层结构,隐层为量子神经元,输出层为普通神经元.量子神经元由量子旋转门和多位受控非门组成,利用多位受控非门中目标量子位的输出向输入端的反馈,实现对输入序列的整体记忆,利用受控非门输出中多位量子比特的纠缠获得量子神经元的输出.基于量子计算理论设计该模型的学习算法.该模型可从宽度和深度两方面获取输入序列的特征.仿真结果表明,当输入节点数和序列长度满足一定关系时,该模型明显优于普通神经网络.     

The Feynman tools for quantum information processing: Design and implementation

The Feynman tools have been re-designed with the goal to establish and implement a high-level (computer) language that is capable to deal with the physics of finite, n$n$-qubit systems, from frequently required computations to mathematically advanced tasks in quantum information processing. In particular, emphasis has been placed to introduce a small but powerful set of keystring-driven commands in order to support both, symbolic and numerical computations. Though the current design is implemented again within the framework of Maple, it is general and flexible enough to be utilized and combined with other languages and computational environments. The present implementation facilitates a large number of computational tasks, including the definition, manipulation and parametrization of quantum states, the evaluation of quantum measures and quantum operations, the evolution of quantum noise in discrete models, quantum measurements and state estimation, and several others. The design is based on a few high-level commands, with a syntax close to the mathematical notation and its use in the literature, and which can be generalized quite readily in order to solve computational tasks at even higher degree of complexity.     

一种量子神经网络模型及改进学习算法

提出一种量子BP网络模型及改进学习算法,该BP网络模型首先基于量子学中一位相移门和两位受控非门的通用性,构造出一种量子神经元,然后由该量子神经元构造隐含层,采用梯度下降法进行学习。输出层采用传统神经元构造,采用基于改进的带动量自适应学习率梯度下降法学习。在UCI两个数据集上采用该模型及算法,实验结果表明该方法比传统的BP网络具有较好的收敛速度和正确率。