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

arXiv:0805.1002 · Physical Review Letters

Computational Power of Correlations

Janet Anders, Dan E. Browne

Published Feb 4, 2009• 190 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physrevlett.102.050502

Related papers

Computational Cluster with Entangled States

Nikolay Raychev

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.

Journal of Applied Mathematics and Physics•Jan 1, 2016•2 citations

Non-adaptive measurement-based quantum computation and multi-party Bell inequalities

Matty J Hoban, Earl T. Campbell, Klearchos Loukopoulos +1 more

Quantum correlations exhibit behaviour that cannot be resolved with a local hidden variable picture of the world. In quantum information, they are also used as resources for information processing tasks, such as measurement-based quantum computation (MQC). In MQC, universal quantum computation can be achieved via adaptive measurements on a suitable entangled resource state. In this paper, we look at a version of MQC in which we remove the adaptivity of measurements and aim to understand what computational abilities remain in the resource. We show that there are explicit connections between this model of computation and the question of non-classicality in quantum correlations. We demonstrate this by focusing on deterministic computation of Boolean functions, in which natural generalizations of the Greenberger–Horne–Zeilinger paradox emerge; we then explore probabilistic computation via, which multipartite Bell inequalities can be defined. We use this correspondence to define families of multi-party Bell inequalities, which we show to have a number of interesting contrasting properties.

arXiv:1009.5213•New Journal of Physics•Feb 3, 2011•56 citations

Fundamentals of universality in one-way quantum computation

M Van den Nest, Wolfgang Dür, A Miyake +1 more

In this paper, we build a framework allowing for a systematic investigation of the fundamental issue: ' Which quantum states serve as universal resources for measurement-based (one-way) quantum computation? ' We start our study by re-examining what is exactly meant by 'universality' in quantum computation, and what the implications are for universal one-way quantum computation. Given the framework of a measurement-based quantum computer, where quantum information is processed by local operations only, we find that the most general universal one-way quantum computer is one which is capable of accepting arbitrary classical inputs and producing arbitrary quantum outputs—we refer to this property as CQ-universality. We then show that a systematic study of CQ-universality in one-way quantum computation is possible by identifying entanglement features that are required to be present in every universal resource. In particular, we find that a large class of entanglement measures must reach its supremum on every universal resource. These insights are used to identify several families of states as being not universal, such as one-dimensional (1D) cluster states, Greenberger–Horne–Zeilinger (GHZ) states, W states, and ground states of non-critical 1D spin systems. Our criteria are strengthened by considering the efficiency of a quantum computation, and we find that entanglement measures must obey a certain scaling law with the system size for all efficient universal resources. This again leads to examples of non-universal resources, such as, e.g. ground states of critical 1D spin systems. On the other hand, we provide several examples of efficient universal resources, namely graph states corresponding to hexagonal, triangular and Kagome lattices. Finally, we consider the more general notion of encoded CQ-universality, where quantum outputs are allowed to be produced in an encoded form. Again we provide entanglement-based criteria for encoded universality. Moreover, we present a general procedure to construct encoded universal resources.

arXiv:quant-ph/0702116•New Journal of Physics•Jun 29, 2007•102 citations

Scalable Bell inequalities for multiqubit systems

Yingqiu He, Dong Ding, Fengli Yan +1 more

Based on Clauser-Horne-Shimony-Holt inequality, we show a fruitful method to exploit Bell inequalities for multipartite qubit systems. These Bell inequalities are designed with a simpler architecture tailored to experimental demonstration. With the point of view of the stabilizer formalism, we suggest a method to investigate quantum nonlocality for multipartite systems. Under the optimal setting we derive a set of compact Mermin-type inequalities and then discuss quantum violations for generalized Greenberger-Horne-Zeilinger (GGHZ) states and two kinds of mixed states. Also, as an example, we reveal relationship between quantum nonlocality and four-partite entanglement for four-qubit GGHZ states.

arXiv:1411.4337•Europhysics Letters (EPL)•Aug 1, 2015•6 citations

Computational power and correlation in a quantum computational tensor network

Keisuke Fujii, Tomoyuki Morimae

We investigate relationships between computational power and correlation in resource states for quantum computational tensor network, which is a general framework for measurement-based quantum computation. We find that if the size of resource states is finite, not all resource states allow correct projective measurements in the correlation space, which is related to nonvanishing two-point correlations in the resource states. On the other hand, for infinite-size resource states, we can always implement correct projective measurements if the resource state can simulate arbitrary single-qubit rotations, since such a resource state exhibits exponentially decaying two-point correlations. This implies that a many-body state whose two-point correlation cannot be upper bounded by an exponentially decaying function cannot simulate arbitrary single-qubit rotations.

arXiv:1106.3377•Physical Review A•Mar 30, 2012•12 citations

Variant of the Clauser-Horne-Shimony-Holt inequality

Zeqian Chen

We construct a Bell inequality from the Clauser-Horne-Shimony-Holt inequality for two qubits that provides a stronger bound on the correlations of entangled states than allowed by the CHSH inequality. The argument involved here can be generalized to $n$ qubits. The inequalities obtained are violated by all the generalized Greenberger-Horne-Zeilinger states of multiqubits.

arXiv:0711.0810•Nov 6, 2007•0 citations
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.
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.
Quantum correlations exhibit behaviour that cannot be resolved with a local hidden variable picture of the world. In quantum information, they are also used as resources for information processing tasks, such as measurement-based quantum computation (MQC). In MQC, universal quantum computation can be achieved via adaptive measurements on a suitable entangled resource state. In this paper, we look at a version of MQC in which we remove the adaptivity of measurements and aim to understand what computational abilities remain in the resource. We show that there are explicit connections between this model of computation and the question of non-classicality in quantum correlations. We demonstrate this by focusing on deterministic computation of Boolean functions, in which natural generalizations of the Greenberger–Horne–Zeilinger paradox emerge; we then explore probabilistic computation via, which multipartite Bell inequalities can be defined. We use this correspondence to define families of multi-party Bell inequalities, which we show to have a number of interesting contrasting properties.
In this paper, we build a framework allowing for a systematic investigation of the fundamental issue: ' Which quantum states serve as universal resources for measurement-based (one-way) quantum computation? ' We start our study by re-examining what is exactly meant by 'universality' in quantum computation, and what the implications are for universal one-way quantum computation. Given the framework of a measurement-based quantum computer, where quantum information is processed by local operations only, we find that the most general universal one-way quantum computer is one which is capable of accepting arbitrary classical inputs and producing arbitrary quantum outputs—we refer to this property as CQ-universality. We then show that a systematic study of CQ-universality in one-way quantum computation is possible by identifying entanglement features that are required to be present in every universal resource. In particular, we find that a large class of entanglement measures must reach its supremum on every universal resource. These insights are used to identify several families of states as being not universal, such as one-dimensional (1D) cluster states, Greenberger–Horne–Zeilinger (GHZ) states, W states, and ground states of non-critical 1D spin systems. Our criteria are strengthened by considering the efficiency of a quantum computation, and we find that entanglement measures must obey a certain scaling law with the system size for all efficient universal resources. This again leads to examples of non-universal resources, such as, e.g. ground states of critical 1D spin systems. On the other hand, we provide several examples of efficient universal resources, namely graph states corresponding to hexagonal, triangular and Kagome lattices. Finally, we consider the more general notion of encoded CQ-universality, where quantum outputs are allowed to be produced in an encoded form. Again we provide entanglement-based criteria for encoded universality. Moreover, we present a general procedure to construct encoded universal resources.
Based on Clauser-Horne-Shimony-Holt inequality, we show a fruitful method to exploit Bell inequalities for multipartite qubit systems. These Bell inequalities are designed with a simpler architecture tailored to experimental demonstration. With the point of view of the stabilizer formalism, we suggest a method to investigate quantum nonlocality for multipartite systems. Under the optimal setting we derive a set of compact Mermin-type inequalities and then discuss quantum violations for generalized Greenberger-Horne-Zeilinger (GGHZ) states and two kinds of mixed states. Also, as an example, we reveal relationship between quantum nonlocality and four-partite entanglement for four-qubit GGHZ states.
We investigate relationships between computational power and correlation in resource states for quantum computational tensor network, which is a general framework for measurement-based quantum computation. We find that if the size of resource states is finite, not all resource states allow correct projective measurements in the correlation space, which is related to nonvanishing two-point correlations in the resource states. On the other hand, for infinite-size resource states, we can always implement correct projective measurements if the resource state can simulate arbitrary single-qubit rotations, since such a resource state exhibits exponentially decaying two-point correlations. This implies that a many-body state whose two-point correlation cannot be upper bounded by an exponentially decaying function cannot simulate arbitrary single-qubit rotations.
We construct a Bell inequality from the Clauser-Horne-Shimony-Holt inequality for two qubits that provides a stronger bound on the correlations of entangled states than allowed by the CHSH inequality. The argument involved here can be generalized to nnn qubits. The inequalities obtained are violated by all the generalized Greenberger-Horne-Zeilinger states of multiqubits.