We give a detailed account of the one-way quantum computer, a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states. We prove its universality, describe why its underlying computational model is different from the network model of quantum computation and relate quantum algorithms to mathematical graphs. Further we investigate the scaling of required resources and give a number of examples for circuits of practical interest such as the circuit for quantum Fourier transformation and for the quantum adder. Finally, we describe computation with clusters of finite size.
In this paper, we study the transformations that are obtained in one-way quantum computation on continuous-variable cluster states of various configurations. Of all possible cluster configurations, we choose those that are suitable for universal Gaussian operations.
In this paper, we estimate the errors of Gaussian transformations implemented using one-way quantum computations on cluster states of various configurations. From all possible cluster state configurations, we choose those that give the smallest computation error. Furthermore, we evaluate errors in hybrid computational schemes, in which Gaussian operations are performed using one-way computations with additional linear transformations. As a result, we find the optimal strategy for the implementation of universal Gaussian computations with minimal errors.
Considering the simultaneous measurement of non-commuting observables, we define a geometric measure for the degree of non-commuting behavior of quantum measurements coming from the initial and final states of the measurements. The rationality of our geometric measure is demonstrated and the application of it is presented. The connection between our measure and Heisenberg's uncertainty principle is discussed as well. Our work deepens the understanding of quantum non-commuting measurement.
Measurement-based quantum computing (MBQC) is a model of quantum computation where quantum information is coherently processed by means of projective measurements on highly entangled states. Following the introduction of MBQC, cluster states have been studied extensively both from the theoretical and experimental point of view. Indeed, the study of MBQC was catalysed by the realisation that cluster states are universal for MBQC with (X,Y)-plane and Z measurements. Here we examine the question of whether the requirement for Z measurements can be dropped while maintaining universality. We answer…
In this study, we demonstrate the possibility of the implementation of universal Gaussian computation on a two-node cluster state ensemble. We consider the phase-locked sub-Poissonian lasers, which radiate the bright light with squeezed quadrature, as the resource to generate these states.
We present an algorithm to reliably generate various quantum states critical to quantum error correction and universal continuous-variable (CV) quantum computing, such as Schrödinger cat states and Gottesman-Kitaev-Preskill (GKP) grid states, out of Gaussian CV cluster states. Our algorithm is based on the Photon-counting-Assisted Node-Teleportation Method (PhANTM), which uses standard Gaussian information processing on the cluster state with the only addition of local photon-number-resolving measurements. We show that PhANTM can apply polynomial gates and embed cat states within the cluster. …
Measurement-based quantum computation with continuous variables in an optical setup shows the great promise towards implementation of large-scale quantum computation, where the time-domain multiplexing approach enables us to generate the large-scale cluster state used to perform measurement-based quantum computation. To make effective use of the advantage of the time-domain multiplexing approach, in this paper, we propose the method to generate the large-scale 3-dimensional cluster state which is a platform for topologically protected measurement-based quantum computation. Our method combines …
Cluster state quantum computation for many-level systems
量子计算的簇态模型[Phys. Rev. Lett. 86，5188]概述了一个方案，允许人们使用测量一个大的纠缠量子系统在什么是所谓的集群状态进行量子计算。该模型本身和许多致力于它的工作涉及使用纠缠量子比特。在本文中，我们考虑的问题，而不是使用纠缠量子点。我们提出了一个完整的框架，簇态量子计算使用qudits，它不仅包含了原来的量子比特模型的功能，但也包含了新的自适应计算的想法：通过改变经典计算，有助于纠正错误的模型中固有的，可以改变实现的量子计算。这个特性是通过使用qudits时出现的额外自由度而产生的。最后，对于素数维，我们给出了一个非常明确的描述模型，利用相互无偏的基础。
To apply network coding for quantum computation, we study the distributed implementation of unitary operations over all separated input and output nodes of quantum networks. We consider a setting of networks where quantum communication between nodes is restricted to sending just a qubit, but classical communication is unrestricted. We analyze which N-qubit unitary operations are implementable over cluster networks by investigating transformations of a given cluster network into quantum circuits. We show that any two-qubit unitary operation is implementable over the butterfly network and the gr…
Phase-sensitive framed-ribbon representation of single-qubit Pauli measurements in linear cluster states
Indian Institute of Technology, Indore（印度印多尔理工学院）；Techno Main Salt Lake (Engg. Colg.), Techno India Group（Techno India集团Salt Lake技术主校区（工程学院））；Centre of Advanced Studies and Innovation Lab (CASILAB)（先进研究与创新实验室（CASILAB））
The Measurement-based quantum computation provides an alternate model for quantum computation compared to the well-known gate-based model. It uses qubits prepared in a specific entangled state followed by single-qubit measurements. The stabilizers of cluster states are well defined because of their graph structure. We exploit this graph structure extensively to design non-CSS codes using measurement in a specific basis on the cluster state. % We aim to construct $[[n,1]]$ non-CSS code from a $(n+1)$ qubit cluster state. The procedure is general and can be used specifically as an encoding techn…
We show that 2D fractal subsystem symmetry-protected topological phases may serve as resources for universal measurement-based quantum computation. This is demonstrated explicitly for two cluster models known to lie within fractal symmetry-protected topological phases, and computational universality is shown to persist throughout those phases. One of the models considered is simply the cluster model on the honeycomb lattice in one limit. We discuss the importance of rigid subsystem symmetries, as opposed to global or $(\text{D}-1)$-form symmetries, in this context.
We address the characterization of molecular nanomagnets at the quantum level and analyze the performance of local measurements in estimating the physical parameters in their spin Hamiltonians. To this aim, we compute key quantities in quantum estimation theory, such as the classical and the quantum Fisher information, in the prototypical case of an heterometallic antiferromagnetic ring. We show that local measurements, performed only on a portion of the molecule, allow a precise estimate of the parameters related to both magnetic defects and avoided level crossings.
Although it is well known that all quantum states can be produced by single qubit measurements on the cluster states, it is not a simple task to explicitly find which measurement patterns on the cluster states can generate different quantum states. In this paper we introduce a general scheme to find measurement patterns corresponding to different topological CSS states containing Kitaev's toric code states and color code states on different lattices and in different dimensions. Furthermore, we find a measurement pattern for generating non abelian anyons where measurement induced defects on a t…
Measurement-based quantum computation offers exponential computational speed-up via simple measurements on a large entangled cluster state. We propose and demonstrate a scalable scheme for the generation of photonic cluster states suitable for universal measurement-based quantum computation. We exploit temporal multiplexing of squeezed light modes, delay loops, and beam-splitter transformations to deterministically generate a cylindrical cluster state with a two-dimensional (2D) topological structure as required for universal quantum information processing. The generated state consists of more…
We propose a method, based on matrix product states, for studying the time evolution of many-body quantum lattice systems under continuous and site-resolved measurement. Both the frequency and the strength of generalized measurements can be varied within our scheme, thus allowing us to explore the corresponding two-dimensional phase diagram. The method is applied to one-dimensional chains of nearest-neighbor interacting hard-core bosons. A transition from an entangling to a disentangling (area-law) phase is found. However, by resolving time-dependent density correlations in the monitored syste…
