Implementing Classical Hadamard Transform Algorithm by Continuous Variable Cluster State

Measurement-based one-way quantum computation, which uses cluster states as resources, provides an efficient model to perform computation. However, few of the continuous variable(CV) quantum algorithms and classical algorithms based on one-way quantum computation were proposed. In this work, we propose a method to implement the classical Hadamard transform algorithm utilizing the CV cluster state. Compared with classical computation, only half operations are required when it is operated in the one-way CV quantum computer. As an example, we present a concrete scheme of four-mode classical Hadamard transform algorithm with a four-partite CV cluster state. This method connects the quantum computer and the classical algorithms, which shows the feasibility of running classical algorithms in a quantum computer efficiently.     

Realization of arbitrary two-qubit quantum gates based on chiral Majorana fermions

Quantum computers are in hot-spot with the potential to handle more complex problems than classical computers can.Realizing the quantum computation requires the universal quantum gate set {T,H,CNOT} so as to perform any unitary transformation with arbitrary accuracy.Here we first briefly review the Majorana fermions and then propose the realization of arbitrary two-qubit quantum gates based on chiral Majorana fermions.Elementary cells consist of a quantum anomalous Hall insulator surrounded by a topological superconductor with electric gates and quantum-dot structures,which enable the braiding operation and the partial exchange operation.After defining a qubit by four chiral Majorana fermions,the singlequbit T and H quantum gates are realized via one partial exchange operation and three braiding operations,respectively.The entangled CNOT quantum gate is performed by braiding six chiral Majorana fermions.Besides,we design a powerful device with which arbitrary two-qubit quantum gates can be realized and take the quantum Fourier transform as an example to show that several quantum operations can be performed with this space-limited device.Thus,our proposal could inspire further utilization of mobile chiral Majorana edge states for faster quantum computation.     

Quantum wave processing

In recent years, the concept of quantum computing has arisen as a methodology by which very rapid computations can be achieved. In general, the ‘speed’ of these computations is compared to that of (classical) digital computers, which use sequential algorithms. However, in most quantum computing approaches, the qubits themselves are treated as analog objects. One then needs to ask whether this computational speed-up of the computation is a result of the quantum mechanics, or whether it is due to the nature of the analog structures that are being ‘generated’ for quantum computation? In this paper, we will make two points: (1) quantum computation utilizes analog, parallel computation which often offers no speed advantage over classical computers which are implemented using analog, parallel computation; (2) once this is realized, then there is little advantage in projecting the quantum computation onto the pseudo-binary construct of a qubit. Rather, it becomes more effective to seek the equivalent wave processing that is inherent in the analog, parallel processing. We will examine some wave processing systems which may be useful for quantum computation.     

A compact program code for simulations of quantum algorithms in classical computers

A general quantum simulation language on a classical computer provides the opportunity to compare an experiential result from the development of quantum computers with mathematical theory. The intention of this research is to develop a program language that is able to make simulations of all quantum algorithms in same framework. This study examines the simulation of quantum algorithms on a classical computer with a symbolic programming language. We use the language Mathematica to make simulations of well-known quantum algorithms. The program code implemented on a classical computer will be a straight connection between the mathematical formulation of quantum mechanics and computational methods. This gives us an uncomplicated and clear language for the implementations of algorithms. The computational language includes essential formulations such as quantum state, superposition and quantum operator. This symbolic programming language provides a universal framework for examining the existing as well as future quantum algorithms. This study contributes with an implementation of a quantum algorithm in a program code where the substance is applicable in other simulations of quantum algorithms.     

Information Complexity of Quantum Gates

This paper considers the realizability of quantum gates from the perspective of information complexity. Since the gate is a physical device that must be controlled classically, it is subject to random error. We define the complexity of gate operation in terms of the difference between the entropy of the variables associated with initial and final states of the computation. We argue that the gate operations are irreversible if there is a difference in the accuracy associated with input and output variables. It is shown that under some conditions the gate operation may be associated with unbounded entropy, implying impossibility of implementation. PACS number: 03.65     

Remote interactions on two distributed quantum systems： nonlocal unambiguous quantum-state discrimination

Remote quantum-state discrimination is a critical step for the implementation of quantum communication network and distributed quantum computation. We present a protocol for remotely implementing the unambiguous discrimination between nonorthogonal states using quantum entanglements, local operations, and classical communications. This protocol consists of a remote generalized measurement described by a positive operator valued measurement （POVM）. We explicitly construct the required remote POVM. The remote POVM can be realized by performing a nonlocal controlled-rotation operation on two spatially separated qubits, one is an ancillary qubit and the other is the qubit which is encoded by two nonorthogonal states to be distinguished, and a conventional local Von Neumann orthogonal measurement on the ancilla. The particular pair of states that can be remotely and unambiguously distinguished is specified by the state of the ancilla. The probability of successful discrimination is not optimal for all admissible pairs. However, for some subset it can be very close to an optimal value in an ordinary local POVM.     

量子计算与量子模拟

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

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

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

Shortcut-based quantum gates on superconducting qubits in circuit QED

Construction of optimal gate operations is significant for quantum computation. Here an efficient scheme is proposed for performing shortcut-based quantum gates on superconducting qubits in circuit quantum electrodynamics (QED). Two four-level artificial atoms of Cooper-pair box circuits, having sufficient level anharmonicity, are placed in a common quantized field of circuit QED and are driven by individual classical microwaves. Without the effect of cross resonance, one-qubit NOT gate and phase gate in a decoupled atom can be implemented using the invariant-based shortcuts to adiabaticity. With the assistance of cavity bus, a one-step SWAP gate can be obtained within a composite qubit-photon-qubit system by inversely engineering the classical drivings. We further consider the gate realizations by adjusting the microwave fields. With the accessible decoherence rates, the shortcut-based gates have high fidelities. The present strategy could offer a promising route towards fast and robust quantum computation with superconducting circuits experimentally.     

The Power of Qutrit Logic for Quantum Computation

The critical merits acquired from quantum computation require running in parallel, which cannot be benefited from previous multi-level extensions and are exact our purposes. In this paper, with qutrit subsystems the general quantum computation further reduces into qutrit gates or its controlled operations. This extension plays parallizable and integrable with same construction independent of the qutrit numbers. The qutrit swapping as its basic operations for controlling can be integrated into quantum computers with present physical techniques. Our generalizations are free of elevating the system spaces, and feasible for the universal computation.     

Quantum computation with Turaev-Viro codes

For a 3-manifold with triangulated boundary, the Turaev-Viro topological invariant can be interpreted as a quantum error-correcting code. The code has local stabilizers, identified by Levin and Wen, on a qudit lattice. Kitaev’s toric code arises as a special case. The toric code corresponds to an abelian anyon model, and therefore requires out-of-code operations to obtain universal quantum computation. In contrast, for many categories, such as the Fibonacci category, the Turaev-Viro code realizes a non-abelian anyon model. A universal set of fault-tolerant operations can be implemented by deforming the code with local gates, in order to implement anyon braiding. We identify the anyons in the code space, and present schemes for initialization, computation and measurement. This provides a family of constructions for fault-tolerant quantum computation that are closely related to topological quantum computation, but for which the fault tolerance is implemented in software rather than coming from a physical medium.     

Entanglement generation of Clifford quantum cellular automata

Clifford quantum cellular automata (CQCAs) are a special kind of quantum cellular automata (QCAs) that incorporate Clifford group operations for the time evolution. Despite being classically simulable, they can be used as basic building blocks for universal quantum computation. This is due to the connection to translation-invariant stabilizer states and their entanglement properties. We will give a self-contained introduction to CQCAs and investigate the generation of entanglement under CQCA action. Furthermore, we will discuss finite configurations and applications of CQCAs.     

Deduction, Ordering, and Operations in Quantum Logic

We show that in quantum logic of closed subspaces of Hilbert space one cannot substitute quantum operations for classical (standard Hilbert space) ones and treat them as primitive operations. We consider two possible ways of such a substitution and arrive at operation algebras that are not lattices what proves the claim. We devise algorithms and programs which write down any two-variable expression in an orthomodular lattice by means of classical and quantum operations in an identical form. Our results show that lattice structure and classical operations uniquely determine quantum logic underlying Hilbert space. As a consequence of our result, recent proposals for a deduction theorem with quantum operations in an orthomodular lattice as well as a, substitution of quantum operations for the usual standard Hilbert space ones in quantum logic prove to be misleading. Quantum computer quantum logic is also discussed.     

Ising耦合体系中量子傅里叶变换的优化

量子傅里叶变换是量子计算中一种重要的量子逻辑门. 任意量子位的傅里叶变换可以分解为一系列普适的单比特量子逻辑门和两比特量子逻辑门, 这种分解方式使得傅里叶变换的实验实现简单直观, 但所用的实验时间显然不是最短的. 本文利用优化控制和数值计算方法对Ising耦合体系中多量子位傅里叶变换的实验时间进行优化, 优化后的实现方法明显短于传统方法. 优化方法的核磁共振实验实现验证了其有效性.     

Logical foundation of quantum mechanics

The subject of this article is the reconstruction of quantum mechanics on the basis of a formal language of quantum mechanical propositions. During recent years, research in the foundations of the language of science has given rise to adialogic semantics that is adequate in the case of a formal language for quantum physics. The system ofsequential logic which is comprised by the language is more general than classical logic; it includes the classical system as a special case. Although the system of sequential logic can be founded without reference to the empirical content of quantum physical propositions, it establishes an essential part of the structure of the mathematical formalism used in quantum mechanics. It is the purpose of this paper to demonstrate the connection between the formal language of quantum physics and its representation by mathematical structures in a self-contained way.     

Classical-Operation-Based Deterministic Secure Quantum Communication

We generalize the unitary-operation-based deterministic secure quantum communication (UODSQC) model (protocol) to describe the conventional deterministic secure quantum communication (DSQC) protocols in which unitary operations are usually utilized for encoding or decoding message. However, it is found that unitary operation for message encoding or decoding is not required and can be replaced with classical operation in DSQC. So the classical-operation-based deterministic secure quantum communication (CODSQC) model (protocol) is put forward. Then the rigorous mathematical analysis to explain the reason why classical operations can replace unitary operations to encode or decode secret deterministic message is given. Although unitary operations are still possibly needed in the whole communication of CODSQC model (protocol), those used for message encoding or decoding are omitted and replaced with classical operations in CODSQC model (protocol). As a result, the CODSQC model (protocol) is simpler and even more robust than the UODSQC one.     

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.     

Programmable quantum processor implemented with superconducting circuit

A quantum processor might execute certain computational tasks exponentially faster than a classical processor. Here, using superconducting quantum circuits we design a powerful universal quantum processor with the structure of symmetric all-to-all capacitive connection. We present the Hamiltonian and use it to demonstrate a full set of qubit operations needed in the programmable universal quantum computations. With the device the unwanted crosstalk and ZZ-type couplings between qubits can be effectively suppressed by tuning gate voltages, and the design allows efficient and high-quality couplings of qubits. Within available technology,the scheme may enable a practical programmable universal quantum computer.     

Measurement-Based Quantum Computation and Undecidable Logic

We establish a connection between measurement-based quantum computation and the field of mathematical logic. We show that the computational power of an important class of quantum states called graph states, representing resources for measurement-based quantum computation, is reflected in the expressive power of (classical) formal logic languages defined on the underlying mathematical graphs. In particular, we show that for all graph state resources which can yield a computational speed-up with respect to classical computation, the underlying graphs—describing the quantum correlations of the states—are associated with undecidable logic theories. Here undecidability is to be interpreted in a sense similar to Gödel’s incompleteness results, meaning that there exist propositions, expressible in the above classical formal logic, which cannot be proven or disproven.