Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Applied Mathematics and Physics

Computational Cluster with Entangled States

Nikolay Raychev

Published Jan 1, 2016• 2 citations
Publisher

Abstract

In this article the inherent computational power of the quantum entangled cluster states examined by measurement-based quantum computations is studied. By defining a common framework of rules for measurement of quantum entangled cluster states based on classical computations, the precise and detailed meaning of the computing power of the correlations in the quantum cluster states is made. This study exposes a connection, arousing interest, between the infringement of the realistic models that are local and the computing power of the quantum entangled cluster states.

DOI
10.4236/jamp.2016.49183

Related papers

Computational Power of Correlations

Janet Anders, Dan E. Browne

We study the intrinsic computational power of correlations exploited in measurement-based quantum computation. By defining a general framework, the meaning of the computational power of correlations is made precise. This leads to a notion of resource states for measurement-based classical computation. Surprisingly, the Greenberger-Horne-Zeilinger and Clauser-Horne-Shimony-Holt problems emerge as optimal examples. Our work exposes an intriguing relationship between the violation of local realistic models and the computational power of entangled resource states.

arXiv:0805.1002•Physical Review Letters•Feb 4, 2009•183 citations

Quantum Computation in Correlation Space and Extremal Entanglement

Jianming Cai, Wolfgang Dür, M. Van den Nest +2 more

Recently, a framework was established to systematically construct novel universal resource states for measurement-based quantum computation using techniques involving finitely correlated states. With these methods, universal states were found which are in certain ways much less entangled than the original cluster-state model, and it was hence believed that with this approach, many of the extremal entanglement features of the cluster states could be relaxed. The new resources were constructed as "computationally universal" states-i.e., they allow one to efficiently reproduce the classical output of each quantum computation-whereas the cluster states are universal in a stronger sense since they are "universal state preparators." Here, we show that the new resources are universal state preparators after all, and must therefore exhibit a whole class of extremal entanglement features, similar to the cluster states.

arXiv:0902.1097•Physical Review Letters•Jul 30, 2009•43 citations

Novel Schemes for Measurement-Based Quantum Computation

D. Gross, Jens Eisert

We establish a framework which allows one to construct novel schemes for measurement-based quantum computation. The technique develops tools from many-body physics-based on finitely correlated or projected entangled pair states-to go beyond the cluster-state based one-way computer. We identify resource states radically different from the cluster state, in that they exhibit nonvanishing correlations, can be prepared using nonmaximally entangling gates, or have very different local entanglement properties. In the computational models, randomness is compensated in a different manner. It is shown that there exist resource states which are locally arbitrarily close to a pure state. We comment on the possibility of tailoring computational models to specific physical systems.

arXiv:quant-ph/0609149•Physical Review Letters•May 31, 2007•253 citations

Measurement-based quantum computation on cluster states

Robert Raussendorf, Dan E. Browne, Hans J. Briegel

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.

arXiv:quant-ph/0301052•Physical Review A•Aug 25, 2003•1,650 citations

Computational potency of quantum many-body systems

David J. Gross, Jens Eisert

We establish a framework which allows one to systematically construct novel schemes for measurement-based quantum computation. The technique utilizes tools from many-body physics - based on finitely correlated or projected entangled pair states - to go beyond the cluster-state based one-way computer. We also identify resource states with radically different entanglement properties than the cluster state. It is shown that there exist universal resource states which are locally arbitrarily close to a pure state. We find that non-vanishing two-point correlation functions are no obstacle to universality. An explicit example for a resource state is presented, which can partly be prepared by gates with non-maximal entangling power. Finally, we comment on the possibility of tailoring computational models to specific physical systems as, e.g. in linear optical experiments.

•Sep 20, 2006•2 citations

Cluster state quantum computation for many-level systems

W. Hall

The cluster state model for quantum computation [Phys. Rev. Lett. \textbf{86}, 5188] outlines a scheme that allows one to use measurement on a large set of entangled quantum systems in what is known as a cluster state to undertake quantum computations. The model itself and many works dedicated to it involve using entangled qubits. In this paper we consider the issue of using entangled qudits instead. We present a complete framework for cluster state quantum computation using qudits, which not only contains the features of the original qubit model but also contains the new idea of adaptive computation: via a change in the classical computation that helps to correct the errors that are inherent in the model, the implemented quantum computation can be changed. This feature arises through the extra degrees of freedom that appear when using qudits. Finally, for prime dimensions, we give a very explicit description of the model, making use of mutually unbiased bases.

arXiv:quant-ph/0512130•Quantum Information and Computation•Mar 1, 2007•9 citations
In this article the inherent computational power of the quantum entangled cluster states examined by measurement-based quantum computations is studied. By defining a common framework of rules for measurement of quantum entangled cluster states based on classical computations, the precise and detailed meaning of the computing power of the correlations in the quantum cluster states is made. This study exposes a connection, arousing interest, between the infringement of the realistic models that are local and the computing power of the quantum entangled cluster states.
We study the intrinsic computational power of correlations exploited in measurement-based quantum computation. By defining a general framework, the meaning of the computational power of correlations is made precise. This leads to a notion of resource states for measurement-based classical computation. Surprisingly, the Greenberger-Horne-Zeilinger and Clauser-Horne-Shimony-Holt problems emerge as optimal examples. Our work exposes an intriguing relationship between the violation of local realistic models and the computational power of entangled resource states.
Recently, a framework was established to systematically construct novel universal resource states for measurement-based quantum computation using techniques involving finitely correlated states. With these methods, universal states were found which are in certain ways much less entangled than the original cluster-state model, and it was hence believed that with this approach, many of the extremal entanglement features of the cluster states could be relaxed. The new resources were constructed as "computationally universal" states-i.e., they allow one to efficiently reproduce the classical output of each quantum computation-whereas the cluster states are universal in a stronger sense since they are "universal state preparators." Here, we show that the new resources are universal state preparators after all, and must therefore exhibit a whole class of extremal entanglement features, similar to the cluster states.
We establish a framework which allows one to construct novel schemes for measurement-based quantum computation. The technique develops tools from many-body physics-based on finitely correlated or projected entangled pair states-to go beyond the cluster-state based one-way computer. We identify resource states radically different from the cluster state, in that they exhibit nonvanishing correlations, can be prepared using nonmaximally entangling gates, or have very different local entanglement properties. In the computational models, randomness is compensated in a different manner. It is shown that there exist resource states which are locally arbitrarily close to a pure state. We comment on the possibility of tailoring computational models to specific physical systems.
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.
We establish a framework which allows one to systematically construct novel schemes for measurement-based quantum computation. The technique utilizes tools from many-body physics - based on finitely correlated or projected entangled pair states - to go beyond the cluster-state based one-way computer. We also identify resource states with radically different entanglement properties than the cluster state. It is shown that there exist universal resource states which are locally arbitrarily close to a pure state. We find that non-vanishing two-point correlation functions are no obstacle to universality. An explicit example for a resource state is presented, which can partly be prepared by gates with non-maximal entangling power. Finally, we comment on the possibility of tailoring computational models to specific physical systems as, e.g. in linear optical experiments.
The cluster state model for quantum computation [Phys. Rev. Lett. \textbf{86}, 5188] outlines a scheme that allows one to use measurement on a large set of entangled quantum systems in what is known as a cluster state to undertake quantum computations. The model itself and many works dedicated to it involve using entangled qubits. In this paper we consider the issue of using entangled qudits instead. We present a complete framework for cluster state quantum computation using qudits, which not only contains the features of the original qubit model but also contains the new idea of adaptive computation: via a change in the classical computation that helps to correct the errors that are inherent in the model, the implemented quantum computation can be changed. This feature arises through the extra degrees of freedom that appear when using qudits. Finally, for prime dimensions, we give a very explicit description of the model, making use of mutually unbiased bases.