量子信息的删除和克隆

利用量子态的约化密度算子研究了量子信息的删除和克隆。证明了被删除态与删除完成后的态无关的量子删除计算机机不存在;然后证明了当输入态为混合态时,也不可以构造出精确克隆混合量子态的量子克隆计算机;最后考虑了混合态的概率克隆和删除问题,得到了在概率形式下,它们可以统一表示的一个充要条件。所获得结果可以加深对量子信息处理的理解并且在量子计算机的实现上有着积极的意义。     

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.     

Controlled teleportation

In this article, we review the recent development of controlled teleportation which can be used for sharing quantum information and has important applications in remote quantum computation. We introduce the principles of a couple of controlled teleportation schemes with maximally entangled quantum channels and those with pure entangled quantum channels (non-maximally entangled states). The schemes based on maximally entangled states have the advantage of having maximal efficiency although there are differences in their implementations in experiment. In the controlled teleportation schemes using non-maximally entangled states as the quantum channels, the receiver can reconstruct the originally unknown state by adding an auxiliary particle and performing a unitary evolution. No matter what the unknown state is (a single qubit state or an m-qudit state), the auxiliary particle required is only a two-level quantum system.     

Random quantum evolution

The quantum no-cloning theorem and no-deleting theorem may be the most important quantum features for quantum communications or quantum computations. In this paper, we concentrate typical properties of random quantum evolution. We obtain that universal random evolutions change the generic unknown pure states into their orthogonal states approximately. Moreover, typical random evolutions distort the von Neumann entropy with constants. These results are extended to mixed states with a stronger orthogonal preparation ability. These typical characters are very important for quantum information retrieving or various quantum tasks.     

Some Issues in Quantum Information Theory

Quantum information theory is a new interdisciplinary research field related to quantum mechanics, computer science, information theory, and applied mathematics. It provides completely new paradigms to do information processing tasks by employing the principles of quantum mechanics. In this review, we first survey some of the significant advances in quantum information theory in the last twenty years. We then focus mainly on two special subjects： discrimination of quantum objects and transformations between entanglements. More specifically, we first discuss discrimination of quantum states and quantum apparatus in both global and local settings. Secondly, we present systematical characterizations and equivalence relations of several interesting entanglement transformation phenomena, namely entanglement catalysis, multiple-copy entanglement transformation, and partial entanglement recovery.     

How Do Two Observers Pool Their Knowledge About a Quantum System?

In the theory of classical statistical inference one can derive a simple rule by which two or more observers may combine independently obtained states of knowledge together to form a new state of knowledge, which is the state which would be possessed by someone having the combined information of both observers. Moreover, this combined state of knowledge can be found without reference to the manner in which the respective observers obtained their information. However, we show that in general this is not possible for quantum states of knowledge; in order to combine two quantum states of knowledge to obtain the state resulting from the combined information of both observers, these observers must also possess information about how their respective states of knowledge were obtained. Nevertheless, we emphasize this does not preclude the possibility that a unique, well motivated rule for combining quantum states of knowledge without reference to a measurement history could be found. We examine both the direct quantum analog of the classical problem, and that of quantum state-estimation, which corresponds to a variant in which the observers share a specific kind of prior information. PACS: 03.67.-a, 02.50.-r, 03.65.Bz     

量子态估计简介及其在超导电路电动力学系统中的应用

量子态估计是量子计算以及量子调控的基础,一般分为量子态层析,即对未知量子态(或过程的初态)进行估计,以及量子滤波,即对量子态进行实时的估计.本文首先介绍了近年来量子态层析技术新的进展,内容包括极大似然方法,压缩感知方法和线性回归方法,并分析了它们的适用范围及各自的优缺点.进一步,基于量子计算的成熟载体超导电路电动力学系统,介绍了基于连续弱测量对量子态进行实时估计的贝叶斯方法,并分析了贝叶斯估计的适用情形.进一步,通过仿真实现了量子贝叶斯估计,可以很容易发现贝叶斯方法能够精确地实时追踪量子态的演化.     

几种确定型量子程序的可达和终止验证

讨论了单量子比特空间中,比特翻转、相位翻转、去极化、幅值阻尼和相位阻尼等量子信道作为特殊的非确定型量子程序—确定型量子程序,从计算基态运行时程序的可达集合和它们终止及发散的情况。研究表明:这些量子信道从计算基态运行时,有的量子程序的终止和发散与刻画量子信道的参数有紧密的联系,而有的量子程序的终止和发散与刻画量子信道的参数没有联系。     

A cloned qutrit and its utility in information processing tasks

We analyze the efficacy of an output as a resource from a universal quantum cloning machine in information processing tasks such as teleportation and dense coding. For this, we have considered the $3 \otimes 3$ dimensional systems. The output states are found to be NPT states for a certain range of machine parameters. Using the output state as an entangled resource, we also study the optimal fidelities of teleportation and capacities of dense coding protocols with respect to the machine parameters and make some interesting observations. Our work is motivated from the fact that the cloning output can be used as a resource in quantum information processing and adds a valuable dimension to the applications of cloning machines.     

辅助量子比特驱动型通用盲量子计算

应用量子隐形传态将Broadbent等人提出的通用盲量子计算(universal blind quantum computation)模型和辅助量子比特驱动型量子计算(ancilla-driven universal quantum computation)模型进行结合, 构造一个新的混合模型来进行计算。此外, 用计算寄存器对量子纠缠的操作来代替量子比特测量操作。因为后者仅限于两个量子比特, 所以代替后的计算优势十分明显。基于上述改进, 设计了实现辅助驱动型通用盲量子计算的协议。协议的实现, 能够使Anders等人的辅助驱动型量子计算增强计算能力, 并保证量子计算的正确性, 从而使得参与计算的任何一方都不能获得另一方的保密信息。     

Arbitrated quantum signature scheme based on cluster states

Cluster states can be exploited for some tasks such as topological one-way computation, quantum error correction, teleportation and dense coding. In this paper, we investigate and propose an arbitrated quantum signature scheme with cluster states. The cluster states are used for quantum key distribution and quantum signature. The proposed scheme can achieve an efficiency of 100 %. Finally, we also discuss its security against various attacks.     

量子计算与量子计算机

量子计算的强大运算能力使得量子计算机具有广阔的应用前景。该文简要介绍了量子计算的发展现状和基本原理,列举了典型的量子算法,阐明了量子计算机的优越性,最后预测了量子计算及量子计算机的应用方向。     

Controllability and Universal Three-qubit Quantum Computation with Trapped Electron States

We show how to control and perform universal three-qubit quantum computation with trapped electron quantum states. The three qubits are the electron spin, and the first two quantum states of the cyclotron and axial harmonic oscillators. We explicitly show how universal three-qubit gates can be performed. As an example of a quantum algorithm, we outline the implementation of the three-qubit Deutsch-Jozsa algorithm in this system.      

Local cloning of multipartite entangled states

No cloning theorem is a very fundamental issue in quantum mechanics. But the issue is much more involved if we consider quantum state shared among two or more than two parties and allow only local operation and classical communication. In the context of the fact that no known bipartite entangled state can be cloned by local operation and classical communication (LOCC) without assistance of extra entangled state, the cloning of unknown orthogonal entangled state becomes meaningful when there is some supply of free entanglement. With restriction on supply of free entanglement, various cases have been studied. In this paper, we try to give an overview of the subject and results that have been obtained across the literature along with a new result on probabilistic LOCC cloning of four Bell states.     

量子假设检验互信息

von Neumann互信息是Shannon互信息在量子信息中的推广,在量子信道容量中有非常好的应用.由于量子态的非对易性,许多经典信息论中的量化在量子信息中有完全不等价的推广定义.量子假设检验相对熵来自于假设检验问题,是量子信息处理中常用的基本量化之一.使用量子假设检验相对熵讨论量子互信息. 首先讨论量子假设检验相对熵的一些基本性质,并给出该量化和其他量子广义熵之间的关系. 然后结合相对熵的性质,给出量子假设检验互信息的定义,并讨论其性质,比如：数据处理不等式.通过互信息与条件熵之和重点讨论互信息的链式法则.     

Graph-theoretic quantum system modelling for information/computation processing circuits

This paper introduces graph-theoretic quantum system modelling (GTQSM), which is facilitated by considering the fundamental unit of quantum computation and information, viz. a quantum bit or qubit as a basic building block. Unit directional vectors ‘ket 0’ and ‘ket 1’ constitute two distinct fundamental quantum across variable orthonormal basis vectors (for the Hilbert space) specifying the direction of propagation, as it were, of information (or computation data) while complementary fundamental quantum through (flow rate) variables specify probability parameters (or amplitudes) as surrogates for scalar quantum information measure (von Neumann entropy). Applications of GTQSM are presented for quantum information/computation processing circuits ranging from a simple qubit and superposition or product of two qubits through controlled NOT and Hadamard gate operations to a substantive case of 3-port, 5-stage circuit for quantum teleportation. An illustrative circuit for teleporting a qubit is modelled as a complex ‘system of systems’ resulting in four probable transfer function models. It has the potential of extending the applications of GTQSM further to systems at the higher end of complexity scale too. The key contribution of this paper lies in generalization or extension of the graph-theoretic system modelling framework, hitherto used for classical (mostly deterministic) systems, to quantum random systems. Further extension of the graph-theoretic system modelling framework to quantum field modelling is the subject of future work.     

Implementing a Quantum Algorithm with Exchange-Coupled Quantum Dots: A Feasibility Study

We present Monte Carlo wavefunction simulations for quantum computations employing an exchange-coupled array of quantum dots. Employing a combination of experimentally and theoretically available parameters, we find that gate fidelities greater than 98% may be obtained with current experimental and technological capabilities. Application to an encoded 3 qubit (nine physical qubits) Deutsch-Josza computation indicates that the algorithmic fidelity is more a question of the total time to implement the gates than of the physical complexity of those gates. PACS: 81.07.Ta, 02.70.Ss, 03.67.Lx, 03.65.Yz     

基于量子漫步的图形匹配算法进展与展望

图形匹配是图形研究中的重要问题,目前的经典算法受限于存储资源和计算复杂度,未能提供有效的解决方法.基于量子效应,将图形信息存储于量子比特,不仅能够极大减少存储资源的消耗,而且对量子比特进行操作可实现对存储信息的并行计算,从而为有效解决图形匹配问题提供了新的可能.量子漫步作为量子计算中的重要模型,是分析研究图形问题的有效工具.总结了量子计算的特点,介绍了量子漫步的2种模型并对二者进行了比较.然后对目前已有的基于量子漫步的图形匹配算法进行了介绍,对其算法思想、计算过程和优缺点进行了描述,同时还提出了相应的改进思路.在总结分析目前研究存在问题的基础上,探讨了今后的研究方向.     

A projected gradient method for optimization over density matrices

An ensemble of quantum states can be described by a Hermitian, positive semidefinite and unit trace matrix called density matrix. Thus, the study of methods for optimizing a certain function (energy, entropy) over the set of density matrices has a direct application to important problems in quantum information and computation. We propose a projected gradient method for solving such problems. By exploiting the geometry of the feasible set, which is the intersection of the cone of Hermitian positive semidefinite matrices with the hyperplane defined by the unit trace constraint, we describe an efficient procedure to compute the projection onto this set using the Frobenius norm. Some important applications, such as quantum state tomography, are described and numerical experiments illustrate the effectiveness of the method when compared to previous methods based on fixed-point iterations or semidefinite programming.     

量子投影滤波

量子滤波器基于贝叶斯原理,利用连续弱测量数据给出当前时刻量子系统状态的最优估计,是量子计算和量子调控技术中极为重要的一环.然而,随着量子系统能级数提高,量子滤波器的实时计算复杂度呈二次型增长.本文介绍了一种量子投影滤波方法,用于减少量子滤波器的实时计算复杂度.基于量子信息几何方法,量子轨迹被限制在了一个由一类非归一化量子密度矩阵组成的子流形中.量子态从而可通过计算子流形的坐标系统来近似获得.仿真实验说明了投影滤波方法的有效性.