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.     

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.     

Secure deterministic communication in a quantum loss channel using quantum error correction code

The loss of a quantum channel leads to an irretrievable particle loss as well as information. In this paper, the loss of quantum channel is analysed and a method is put forward to recover the particle and information loss effectively using universal quantum error correction. Then a secure direct communication scheme is proposed, such that in a loss channel the information that an eavesdropper can obtain would be limited to arbitrarily small when the code is properly chosen and the correction operation is properly arranged.     

Suppressing decoherence of quantum algorithms by jump codes

The stabilizing properties of one-error correcting jump codes are explored under the realistic non-ideal condition of finite recovery times. For this purpose the quantum algorithm of the tent-map is decomposed into a universal set of Hamiltonian quantum gates which ensure perfect correction of spontaneous decay processes under ideal circumstances even if they occur during a gate operation. An entanglement gate is presented which is capable of entangling any two logical qubits of different one-error correcting code spaces. With the help of this gate simultaneous spontaneous decay processes affecting physical qubits of different code spaces can be corrected and decoherence can be suppressed significantly.     

H型魔幻态的纯化研究

魔幻态是解决容错量子计算的通用性的有力工具,因而高保真度魔幻态的获得是可靠的容错量子计算的一个重要问题.本文对H型魔幻态的纯化方案进行了数值模拟.该纯化方案基于7比特Steane码.我们的数值模拟结果显示该纯化方案对输入态围绕H轴的出错有一定容忍度.有趣的是,在H型魔幻态理论纯化阈值面下,我们发现一些量子态可以通过反复纯化,最终以较高的保真度接近H型魔幻态.     

量子Turbo码

量子纠错编码技术在量子通信和量子计算领域起着非常重要的作用.构造量子纠错编码的主要方法是借鉴经典纠错编码技术,目前几乎所有经典纠错编码方案都已经被移植到量子领域中来,然而在经典编码领域纠错性能最杰出的Turbo码却至今没有量子对应.提出了一种利用量子寄存器网络构造量子递归系统卷积码的简单实现方案,同时利用量子SWAP门设计了一种高效的量子交织器门组网络方案.最后仿照经典Turbo码的设计原理提出串行级联的量子Turbo码,同时提出了可行的译码方法.量子Turbo码不仅丰富了量子纠错码研究的领域,同时为解释 关键词： 量子递归系统卷积码 量子Turbo码 量子纠错编码 量子信息     

Universal R Matrix of Two-Parameter Deformed Quantum Group Uqs(SU(1, 1))

The universal R matrix of the two-parameterdeformed quantum group U_qs(SU(1, 1)) isderived. In previous work we suggested a method toderive the universal R matrix of the two-parameterdeformed quantum group U_qs(SU(2)). This method isdifferent from that of the quantum double; it is simpleand efficient for quantum groups of low rank at least.This paper studies the universal R matrix of thetwo-parameter deformed quantum group U_qs(SU(1, 1))using the same approach.     

From entanglement renormalisation to the disentanglement of quantum double models

We describe how the entanglement renormalisation approach to topological lattice systems leads to a general procedure for treating the whole spectrum of these models in which the Hamiltonian is gradually simplified along a parallel simplification of the connectivity of the lattice. We consider the case of Kitaev’s quantum double models, both Abelian and non-Abelian, and we obtain a rederivation of the known map of the toric code to two Ising chains; we pay particular attention to the non-Abelian models and discuss their space of states on the torus. Ultimately, the construction is universal for such models and its essential feature, the lattice simplification, may point towards a renormalisation of the metric in continuum theories.     

一类基于级联结构的量子好码

借助经典级联码的思想，详细阐述了通过适当选择量子码作为外码和内码，构造一般意义量子级联码的过程.在此基础上，通过选择量子RS码作为外码，一组特殊结构的量子码作为内码，具体构造出了一类量子级联码，证明了其是量子好码.在量子纠错码领域中，这是首次利用经典坏码构造出量子好码.     

Contextual, optimal, and universal realization of the quantum cloning machine and of the NOT gate

A simultaneous realization of the universal optimal quantum cloning machine and of the universal-NOT gate by a quantum injected optical parametric amplification, is reported. The two processes, forbidden in their exact form for fundamental quantum limitations, are found universal and optimal, and the measured fidelity F<1 is found close to the limit values evaluated by quantum theory. This work may enlighten the yet little explored interconnections of fundamental axiomatic properties within the deep structure of quantum mechanics.     

Time-reversal characteristics of quantum normal diffusion: time-continuous models

In quantum map systems exhibiting normal diffusion, time-reversal characteristics converge to a universal scaling behavior which implies a prototype of irreversible quantum process [H.S. Yamada, K.S. Ikeda, Eur. Phys. J. B 85, 41 (2012)]. In the present paper, we extend the investigation of time-reversal characteristic to time-continuous quantum systems which show normal diffusion. Typical four representative models are examined, which is either deterministic or stochastic, and either has or not has the classical counterpart. Extensive numerical examinations demonstrate that three of the four models have the time-reversal characteristics obeying the same universal limit as the quantum map systems. The only nontrivial counterexample is the critical Harper model, whose time-reversal characteristics significantly deviates from the universal curve. In the critical Harper model modulated by a weak noise that does not change the original diffusion constant, time-reversal characteristic recovers the universal behavior.     

Effective Field Theory of Random Quantum Circuits

Quantum circuits have been widely used as a platform to simulate generic quantum many-body systems. In particular, random quantum circuits provide a means to probe universal features of many-body quantum chaos and ergodicity. Some such features have already been experimentally demonstrated in noisy intermediate-scale quantum (NISQ) devices. On the theory side, properties of random quantum circuits have been studied on a case-by-case basis and for certain specific systems, and a hallmark of quantum chaos—universal Wigner–Dyson level statistics—has been derived. This work develops an effective field theory for a large class of random quantum circuits. The theory has the form of a replica sigma model and is similar to the low-energy approach to diffusion in disordered systems. The method is used to explicitly derive the universal random matrix behavior of a large family of random circuits. In particular, we rederive the Wigner–Dyson spectral statistics of the brickwork circuit model by Chan, De Luca, and Chalker [Phys. Rev. X 8, 041019 (2018)] and show within the same calculation that its various permutations and higher-dimensional generalizations preserve the universal level statistics. Finally, we use the replica sigma model framework to rederive the Weingarten calculus, which is a method of evaluating integrals of polynomials of matrix elements with respect to the Haar measure over compact groups and has many applications in the study of quantum circuits. The effective field theory derived here provides both a method to quantitatively characterize the quantum dynamics of random Floquet systems (e.g., calculating operator and entanglement spreading) and a path to understanding the general fundamental mechanism behind quantum chaos and thermalization in these systems.     

A small error-correction code for protecting three-qubit quantum information

We present a quantum error correction code which protects three quantum bits (qubits) of quantum information against one erasure, i.e., a single-qubit arbitrary error at a known position. The present code has a high encoding efficiency, since only one auxiliary qubit is needed for one message qubit on average. In addition, we note that the code can also work even in a worse case that the interaction with the environment causes a leakage out of the qubit space. The code may have some applications in the storage of quantum information for small-scale quantum computing, quantum information processing, and quantum communication.     

Practical scheme for quantum computation with any two-qubit entangling gate

Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-not, are universal when assisted by arbitrary one-qubit gates, it has only recently become clear precisely what class of two-qubit gates is universal in this sense. We present an elementary proof that any entangling two-qubit gate is universal for quantum computation, when assisted by one-qubit gates. A proof of this result for systems of arbitrary finite dimension has been provided by Brylinski and Brylinski; however, their proof relies on a long argument using advanced mathematics. In contrast, our proof provides a simple constructive procedure which is close to optimal and experimentally practical.     

A no-go theorem for halting a universal quantum computer

A very brief introduction to quantum computing with an emphasis on the distinction between universal quantum computers and quantum networks. We then prove that, under very general and desirable assumptions, it is not possible to check for halting a universal quantum computer without losing the quantum computation.     

Universal invariants in quantum mechanics and physics of optical and particle beams

We give a brief review of the theory of quantum universal invariants and their counterparts in the physics of light and particle beams. The invariants concerned are certain combinations of the second- and higher-order moments (variances) of quantum-mechanical operators, or the transverse phase-space coordinates of the paraxial beams of light or particles. They are conserved in time (or along the beam axis) independently of the concrete form of the coefficients of the Schrödinger-like equations governing the evolution of the systems, provided that the effective Hamiltonian is either a generic quadratic form of the generalized coordinate-momenta operators or a linear combination of generators of some finite-dimensional algebra (in particular, any semisimple Lie algebra). Using the phase space representation of quantum mechanics (paraxial optics) in terms of the Wigner function, we elucidate the relation of the quantum (optical) invariants to the classical universal integral invariants of Poincaré and Cartan. The specific features of Gaussian beams are discussed as examples. The concept of the universal quantum integrals of motion is introduced, and examples of the “universal invariant solutions” to the Schrödinger equation, i.e., self-consistent eigenstates of the universal integrals of motion, are given.     

Asymmetric universal entangling machine

We give a definition of an asymmetric universal entangling machine which entangles a system in an unknown state to a specially prepared ancilla. The machine produces a fixed state-independent amount of entanglement in exchange for a fixed degradation of the system state fidelity. We describe explicitly such a machine for any quantum system having d levels and prove its optimality. We show that a d ²-dimensional ancilla is sufficient for reaching optimality. The introduced machine is a generalization to a number of widely investigated universal quantum devices such as the symmetric and asymmetric quantum cloners, the symmetric and antisymmetric quantum entanglers, the quantum information distributor and the universal-NOT gate. The text was submitted by the authors in English.     

The Optimal Uncertainty Relation

Employing the lattice theory on majorization, the universal quantum uncertainty relation for any number of observables and general measurement is investigated. It is found that 1) the least bounds of the universal uncertainty relations can only be properly defined in the lattice theory; 2) contrary to variance and entropy, the metric induced by the majorization lattice implies an intrinsic structure of the quantum uncertainty; and 3) the lattice theory correlates the optimization of uncertainty relation with the entanglement transformation under local quantum operation and classical communication. Interestingly, the optimality of the universal uncertainty relation found can be mimicked by the Lorenz curve, initially introduced in economics to measure the wealth concentration degree of a society.