Substituting a qubit for an arbitrarily large number of classical bits

We show that a qubit can be used to substitute for a classical analog system requiring an arbitrarily large number of classical bits to represent digitally. Let a physical system S interact locally with a classical field varphi(x) as S travels directly from point A to point B. Our task is to use S to answer a simple yes/no question about varphi(x). If S is a qubit, the task can be done perfectly. We show that any classical system S must encode an arbitrarily large number of classical bits to solve the same task. This result implies a large quantum advantage in the memory size necessary for some computations. We also show that no finite amount of one-way classical communication can perfectly simulate the effect of quantum entanglement.     

Computing with a single qubit faster than the computation quantum speed limit

The possibility to save and process information in fundamentally indistinguishable states is the quantum mechanical resource that is not encountered in classical computing. I demonstrate that, if energy constraints are imposed, this resource can be used to accelerate information-processing without relying on entanglement or any other type of quantum correlations. In fact, there are computational problems that can be solved much faster, in comparison to currently used classical schemes, by saving intermediate information in nonorthogonal states of just a single qubit. There are also error correction strategies that protect such computations.     

量子算法的NMR实现方法

量子计算机是一种以量子耦合方式进行信息处理的装置[1 ] 。原则上 ,它能利用量子相干干涉方法以比传统计算机更快的速度进行诸如大数的因式分解、未排序数据库中的数据搜索等工作[2 ] 。建造大型量子计算机的主要困难是噪音、去耦和制造工艺。一方面 ,虽然离子陷阱和光学腔实验方法大有希望 ,但这些方法都还没有成功实现过量子计算。另一方面 ,因为隔离于自然环境 ,核自旋可以成为很好的“量子比特” ,可能以非传统方式使用核磁共振 (NMR)技术实现量子计算。本文介绍一种用NMR方法实现量子计算的方法 ,该方法能够用比传统方法少的步骤解决一个纯数学问题。基于该方法的简单量子计算机使用比传统计算机使用更少的函数“调用”判断一未知函数的类别。     

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.     

Operational interpretation for global multipartite entanglement

We introduce an operational interpretation for pure-state global multipartite entanglement based on quantum estimation. We show that the estimation of the strength of low-noise locally depolarizing channels, as quantified by the regularized quantum Fisher information, is directly related to the Meyer-Wallach multipartite entanglement measure. Using channels that depolarize across different partitions, we obtain related multipartite entanglement measures. We show that this measure is the sum of expectation values of local observables on two copies of the state.     

利用光子回声技术产生光的三体纠缠态的研究

量子纠缠是实现量子通信和量子计算的重要资源,其中多体纠缠更是构建量子网络实现全局量子计算的基础。本文主要研究如何利用经典的光子回声技术实现光量子态的三体纠缠。在自由空间中向掺杂稀土离子的固态离子系综中射入经典光场,当离子体系达到相位重构条件时即可获得三束存在纠缠的量子光场。基于本方案纠缠产生的技术特点,发现其在提高量子中继器的工作效率上有着潜在的应用价值。     

Quantum computation through entangling single photons in multipath interferometers

Single-photon interferometry has been used to simulate quantum computations. Its use has been limited to studying few-bit applications due to rapid growth in physical size with numbers of bits. We propose a hybrid approach that employs n photons, each having L degrees of freedom yielding L(n) basis states. The photons are entangled via a quantum nondemolition measurement. This approach introduces the essential element of quantum computing, that is, entanglement into the interferometry. Using these techniques, we demonstrate a controlled-NOT gate and a Grover's search circuit. These ideas are also applicable to the study of nonlocal correlations in many dimensions.     

How Much of One-Way Computation Is Just Thermodynamics?

In this paper we argue that one-way quantum computation can be seen as a form of phase transition with the available information about the solution of the computation being the order parameter. We draw a number of striking analogies between standard thermodynamical quantities such as energy, temperature, work, and corresponding computational quantities such as the amount of entanglement, time, potential capacity for computation, respectively. Aside from being intuitively pleasing, this picture allows us to make novel conjectures, such as an estimate of the necessary critical time to finish a computation and a proposal of suitable architectures for universal one-way computation in 1D.     

Entanglement of a degenerate system in adiabatic process

Entanglement evolution of a degenerate system is studied. It is found that an entangled state becomes unentangled under an adiabatic variation of the system, and vice versa. The amount of entanglement varies with different adiabatic paths. It is concluded that the entanglement of complete set of eigenstates of a system at thermal equilibrium is independent on perturbations, but the entanglement of partial eigenstates may change with adiabatic perturbations. This can help us to control entanglement properties and is very useful in the quantum computations.     

Quantum Communication Complexity

Can quantum communication be more efficient than its classical counterpart? Holevo's theorem rules out the possibility of communicating more than n bits of classical information by the transmission of n quantum bits—unless the two parties are entangled, in which case twice as many classical bits can be communicated but no more. In apparent contradiction, there are distributed computational tasks for which quantum communication cannot be simulated efficiently by classical means. In some cases, the effect of transmitting quantum bits cannot be achieved classically short of transmitting an exponentially larger number of bits. In a similar vein, can entanglement be used to save on classical communication? It is well known that entanglement on its own is useless for the transmission of information. Yet, there are distributed tasks that cannot be accomplished at all in a classical world when communication is not allowed, but that become possible if the non-communicating parties share prior entanglement. This leads to the question of how expensive it is, in terms of classical communication, to provide an exact simulation of the spooky power of entanglement.     

Dicke模型的量子经典对应关系

非旋波近似条件下Dicke模型表现为量子混沌动力学特征.在详细考察Dicke模型经典相空间结构特点的基础上,采用经典-量子"一对多"的思想,即经典相空间中的一点对应于量子体系两个初始相干态的演化,利用对两个初态量子纠缠动力学演化取统计平均的方法,得到了与经典相空间对应非常好的量子相空间结构.数值计算结果表明:经典混沌有利地促进系统两体纠缠的产生,平均纠缠可以作为量子混沌的标识,利用平均纠缠可以得到一种较好的量子动力学与经典相空间的对应关系. 关键词： Dicke模型 非旋波近似 量子混沌 经典量子对应     

Classical images as quantum entanglement: An image processing analogy of the GHZ experiment

In this paper we present an optical analogy of quantum entanglement by means of classical images. As in previous works, the quantum state of two or more qbits is encoded by using the spatial modulation in amplitude and phase of an electromagnetic field. We show here that bidimensional encoding of two qbit states allows us to interpret some non local features of the joint measurement by the assumption of “astigmatic” observers with different resolving power in two orthogonal directions. As an application, we discuss the optical simulation of measuring a system characterized by multiparticle entanglement. The simulation is based on a local representation of entanglement and a classical interferometric system. In particular we show how to simulate the Greenberger-Horne Zeilinger (GHZ) argument and the experimental results which interpretation illustrates the conflict between quantum mechanics and local realism.     

The Quantum Reverse Shannon Theorem Based on One-Shot Information Theory

The Quantum Reverse Shannon Theorem states that any quantum channel can be simulated by an unlimited amount of shared entanglement and an amount of classical communication equal to the channel’s entanglement assisted classical capacity. In this paper, we provide a new proof of this theorem, which has previously been proved by Bennett, Devetak, Harrow, Shor, and Winter. Our proof has a clear structure being based on two recent information-theoretic results: one-shot Quantum State Merging and the Post-Selection Technique for quantum channels.     

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.     

Efficient self-testing system for quantum computations based on permutations

Verification in quantum computations is crucial since quantum systems are extremely vulnerable to the environment.However,verifying directly the output of a quantum computation is difficult since we know that efficiently simulating a large-scale quantum computation on a classical computer is usually thought to be impossible.To overcome this difficulty,we propose a self-testing system for quantum computations,which can be used to verify if a quantum computation is performed correctly by itself.Our basic idea is using some extra ancilla qubits to test the output of the computation.We design two kinds of permutation circuits into the original quantum circuit:one is applied on the ancilla qubits whose output indicates the testing information,the other is applied on all qubits(including ancilla qubits) which is aiming to uniformly permute the positions of all qubits.We show that both permutation circuits are easy to achieve.By this way,we prove that any quantum computation has an efficient self-testing system.In the end,we also discuss the relation between our self-testing system and interactive proof systems,and show that the two systems are equivalent if the verifier is allowed to have some quantum capacity.     

Interferences,ghost images and other quantum correlations according to stochastic optics

There are an extensive variety of experiments in quantum optics that emphasize the non-local character of the coincidence measurements recorded by spatially separated photocounters. These are the cases of ghost image and other interference experiments based on correlated photons produced in, for instance, the process of parametric down-conversion or photon cascades. We propose to analyse some of these correlations in the light of stochastic optics, a local formalism based on classical electrodynamics with added background fluctuations that simulate the vacuum field of quantum electrodynamics, and raise the following question: can these experiments be used to distinguish between quantum entanglement and classical correlations?     

Experimental realization of quantum games on a quantum computer

We generalize the quantum prisoner's dilemma to the case where the players share a nonmaximally entangled states. We show that the game exhibits an intriguing structure as a function of the amount of entanglement with two thresholds which separate a classical region, an intermediate region, and a fully quantum region. Furthermore this quantum game is experimentally realized on our nuclear magnetic resonance quantum computer.     

Simpler criterion and flexibility of operation complexity for perfectly teleporting arbitrary n-qubit state with 2n-qubit pure state

A criterion for whether a pure-state quantum channel consisting of 2n qubits averagely distributed between two nodes can be used for perfectly teleporting an arbitrary n-qubit state via Bell-state measurements is educed.Specifically,a matrix is composed of the coefficients of the known channel state and whether the matrix is unitary decides the criterion.As the criterion is apparently different from the usual standard entanglement criterion (USEC),its applicability is enlarged and verified by other measuring bases.Thorough analyses have further simplified the resultant criterion,so that a much simpler criterion than the USEC is conclusively obtained.Moreover,the flexibility of operation complexity between the non-unitary measurements and the unitary reconstructions is explicitly exhibited.     

Entanglement versus correlations in spin systems

We consider pure quantum states of N>1 spins or qubits and study the average entanglement that can be localized between two separated spins by performing local measurements on the other individual spins. We show that all classical correlation functions provide lower bounds to this localizable entanglement, which follows from the observation that classical correlations can always be increased by doing appropriate local measurements on the other qubits. We analyze the localizable entanglement in familiar spin systems and illustrate the results on the hand of the Ising spin model, in which we observe characteristic features for a quantum phase transition such as a diverging entanglement length.     

Classical simulation of limited-width cluster-state quantum computation

We present a classical protocol, using the matrix product-state representation, to simulate cluster-state quantum computation at a cost polynomial in the number of qubits in the cluster and exponential in d---the width of the cluster. We use this result to show that any log-depth quantum computation in the gate array model, with gates linking only nearby qubits, can be simulated efficiently on a classical computer.