本文介绍了基于测量的量子计算（MBQC）的原理，详细比较了利用连续变量和离散变量物理实现 cluster states 的多种方法，并报告了光子与超导量子比特的最新成果。
摘要：
利用量子力学特性，量子计算机在许多应用中有望超越经典计算机，并被设想为影响我们社会的各个方面。目前人们正在探索构建此类计算机的不同方法。其中一种潜在的方法是由 Raussendorf 和 Briegel 于 2001 年提出的基于测量的量子计算（MBQC）。在 MBQC 中，大量量子比特被制备在高度纠缠的簇态中，称为 cluster states。随后，通过一系列测量来执行所需的量子计算。人们正在使用连续变量（CV）和离散变量（DV）方法对 cluster states 进行物理实现。基于 CV 的方法可进一步分为频域复用（FDM）、时域复用（TDM）、空域复用（SDM）和混合复用。我们详细讨论并比较了这些方法。我们还讨论了 DV 中 cluster states 的生成，并报告了一些使用光子和超导量子比特的最新成果。
英文摘要：
Harnessing quantum mechanics properties, quantum computers have the potential to outperform classical computers in many applications and are envisioned to affect various aspects of our society. Different approaches are being explored for building such computers. One of such potential approaches is Measurement based quantum computation (MBQC), introduced by Raussendorf and Briegel in 2001. In MBQC a large number of qubits are prepared in a highly entangled clusters, called cluster states. The required quantum computation is then performed by a sequence of measurements. Cluster states are being physically realized using continuous variables (CV) and discrete variables (DV) approaches. CV-based approaches can be further categorized as Frequency domain multiplexing (FDM), Time domain multiplexing (TDM), Spatial domain multiplexing (SDM) and hybrid. We discuss and compare these approaches in detail. We also discuss cluster states generation in DV and report some recent results where photons and superconducting qubits are used.
We discuss an efficient physical realization of topological quantum walks on a finite lattice. The $N$-point lattice is realized with $\log_2 N$ qubits, and the quantum circuit utilizes a number of quantum gates which is polynomial in the number of qubits. In a certain scaling limit, we show that a large number of steps is implemented with a number of quantum gates which is independent of the number of steps. We ran the quantum algorithm on the IBM-Q five-qubit quantum computer, thus experimentally demonstrating topological features, such as boundary bound states, on a lattice with $N=4$ point…
A physical realization of scattering by ${\cal{PT}}$-symmetric potentials is provided: we show that the Maxwell equations for an electromagnetic wave travelling along a planar slab waveguide filled with gain and absorbing media in contiguous regions, can be approximated in a parameter range by a Schrödinger equation with a ${\cal{PT}}$-symmetric scattering potential.
Network centrality has important implications well beyond its role in physical and information transport analysis; as such, various quantum walk-based algorithms have been proposed for measuring network vertex centrality. In this work, we propose a continuous-time quantum walk algorithm for determining vertex centrality, and show that it generalizes to arbitrary graphs via a statistical analysis of randomly generated scale-free and Erdős-Rényi networks. As a proof of concept, the algorithm is detailed on a 4-vertex star graph and physically implemented via linear optics, using spatial and pola…
Conventional statistical mechanics describes large systems and averages over many particles or over many trials. But work, heat, and entropy impact the small scales that experimentalists can increasingly control, e.g., in single-molecule experiments. The statistical mechanics of small scales has been quantified with two toolkits developed in quantum information theory: resource theories and one-shot information theory. The field has boomed recently, but the theorems amassed have hardly impacted experiments. Can thermodynamic resource theories be realized experimentally? Via what steps can we s…
A fundamental requirement of quantum information processing is the protection from the adverse effects of decoherence and noise. Decoherence-free subspaces and geometric processing are important steps of quantum information protection. Here, we provide a new experimentally feasible scheme to combine decoherence-free subspaces with nonadiabatic geometric manipulations to attain a universal quantum computation. The proposed scheme is different from previous proposals and is based on the typical XY interaction coupling, which can be set up in various nano-engineered systems and therefore open up …
The Measurement Based Quantum Computation (MBQC) model achieves universal quantum computation by employing projective single qubit measurements with classical feedforward on a highly entangled multipartite cluster state. Rapid advances in improving scalability of quantum computing systems have enabled the generation of large cluster states for implementing MBQC on various platforms. This review focuses on three such efforts, each utilizing a different quantum computing technology viz., superconducting qubits, trapped ion qubits and squeezed photon states. MBQC is being increasingly employed on…
To construct a quantum network with many end users, it is critical to have a cost-efficient way to distribute entanglement over different network ends. We demonstrate an entanglement access network, where the expensive resource, the entangled photon source at the telecom wavelength and the core communication channel, is shared by many end users. Using this cost-efficient entanglement access network, we report experimental demonstration of a secure multiparty computation protocol, the privacy-preserving secure sum problem, based on the network quantum cryptography.
We describe a physical implementation of a quantum finite automaton recognizing a well known family of periodic languages. The realization exploits the polarization degree of freedom of single photons and their manipulation through linear optical elements. We use techniques of confidence amplification to reduce the acceptance error probability of the automaton. It is worth remarking that the quantum finite automaton we physically realize is not only interesting per se, but it turns out to be a crucial building block in many quantum finite automaton design frameworks theoretically settled in th…
Disordered photonic structures are promising materials for the realization of physical unclonable functions (PUF), physical objects that can overcome the limitations of conventional digital security methods and that enable cryptographic protocols immune against attacks by future quantum computers. One PUF limitation, so far, has been that their physical configuration is either fixed or can only be permanently modified, and hence allowing only one token per device. We show that it is possible to overcome this limitation by creating a reconfigurable structure made by light-transformable polymers…
Nonadiabatic holonomic quantum computation as one of the key steps to achieve fault tolerant quantum information processing has so far been realized in a number of physical settings. However, in some physical systems particularly in spin qubit systems, which are actively considered for realization of quantum computers, experimental challenges are undeniable and the lack of a practically feasible and scalable scheme that supports universal holonomic quantum computation all in a single well defined setup is still an issue. Here, we propose and discuss a scalable star-shape architecture with prom…
Experimental realization of a universal set of quantum logic gates is the central requirement for implementation of a quantum computer. An all-geometric approach to quantum computation offered a paradigm for implementation where all the quantum gates are achieved based on the Berry phases and their non-abelian extensions, the holonomies, from geometric transformation of quantum states in the Hilbert space. Apart from its fundamental interest and rich mathematical structure, the geometric approach has some built-in noise-resilient features. On the experimental side, geometric phases and holonom…
Realization of the quantum Toffoli gate with trapped ions
用于量子信息处理的算法通常被分解为量子门操作的序列，最常使用单量子比特门和双量子比特门来实现[1]。虽然这样的操作构成了量子计算的通用集合，但作用于两个以上量子比特的门可以简化复杂量子算法的实现[2]。因此，单个三量子位操作可以取代复杂的两量子位门序列，这反过来又保证了更快的执行速度和更高的保真度。一个重要的三量子位操作是量子Toffoli门，它根据两个控制量子位的状态对目标量子位执行NOT操作。在这里，我们提出了第一个实验实现的量子Toffoli门的离子阱量子计算机。我们的实现是特别有效的，因为我们直接编码的相关逻辑信息的离子串的运动。[1]Diplenenzo，D.两位门是量子计算的通用门。Cond-mat/9407022，Phys.Rev. A 51，1015-1022（1995）。[2]Chiaverini，J. et al.实现量子纠错. Nature 432，602-605（2004）.
Holonomic quantum computation is the idea to use non-Abelian geometric phases to implement universal quantum gates that are robust to fluctuations in control parameters. Here, we propose a compact design for a holonomic quantum computer based on coupled three-level systems. The scheme does not require adiabatic evolution and can be implemented in arrays of atoms or ions trapped in tailored standing wave potentials.
Nonadiabatic holonomic quantum computation in decoherence-free subspaces has attracted increasing attention recently, as it allows for high-speed implementation and combines both the robustness of holonomic gates and the coherence stabilization of decoherence-free subspaces. Since the first protocol of nonadiabatic holonomic quantum computation in decoherence-free subspaces, a number of schemes for its physical implementation have been put forward. However, all previous schemes require two noncommuting gates to realize an arbitrary one-qubit gate, which doubles the exposure time of gates to er…
