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:2303.02080

Nonlocality under Computational Assumptions

Khashayar Barooti, Alexandru Gheorghiu, Grzegorz Głuch, Marc-Olivier Renou

Published Mar 3, 2023• 1 citation
arXivHTMLPDF

Abstract

Nonlocality and its connections to entanglement are fundamental features of quantum mechanics that have found numerous applications in quantum information science. A set of correlations is said to be nonlocal if it cannot be reproduced by spacelike-separated parties sharing randomness and performing local operations. An important practical consideration is that the runtime of the parties has to be shorter than the time it takes light to travel between them. One way to model this restriction is to assume that the parties are computationally bounded. We therefore initiate the study of nonlocality under computational assumptions and derive the following results: (a) We define the set $\mathsf{NeL}$ (not-efficiently-local) as consisting of all bipartite states whose correlations arising from local measurements cannot be reproduced with shared randomness and \emph{polynomial-time} local operations. (b) Under the assumption that the Learning With Errors problem cannot be solved in \emph{quantum} polynomial-time, we show that $\mathsf{NeL}=\mathsf{ENT}$, where $\mathsf{ENT}$ is the set of \emph{all} bipartite entangled states (pure and mixed). This is in contrast to the standard notion of nonlocality where it is known that some entangled states, e.g. Werner states, are local. In essence, we show that there exist (efficient) local measurements producing correlations that cannot be reproduced through shared randomness and quantum polynomial-time computation. (c) We prove that if $\mathsf{NeL}=\mathsf{ENT}$ unconditionally, then $\mathsf{BQP}\neq\mathsf{PP}$. In other words, the ability to certify all bipartite entangled states against computationally bounded adversaries gives a non-trivial separation of complexity classes. (d) Using (c), we show that a certain natural class of 1-round delegated quantum computation protocols that are sound against $\mathsf{PP}$ provers cannot exist.

DOI
10.48550/arxiv.2303.02080

Related papers

Nonlocality under Computational Assumptions

Grzegorz Głuch, Khashayar Barooti, Alexandru Gheorghiu +1 more

Nonlocality and its connections to entanglement are fundamental features of quantum mechanics that have found numerous applications in quantum information science. A set of correlations is said to be nonlocal if it cannot be reproduced by spacelike-separated parties sharing randomness and performing local operations. An important practical consideration is that the runtime of the parties has to be shorter than the time it takes light to travel between them. One way to model this restriction is to assume that the parties are computationally bounded. We therefore initiate the study of nonlocality under computational assumptions and derive the following results:

ACM Symposium on Theory of Computing (STOC)•Jun 10, 2024•0 citations

Nonlocality in multipartite correlation networks

Lars Erik Würflinger

Despite the success of quantum mechanics in predicting the outcomes of experiments in many branches of physics, the foundations of the theory have remained subject of research and dispute. At the basis of this struggle with the theory lie the phenomena of nonlocality and entanglement. Since it was first predicted by Bell in 1964, nonlocality was not only verified in numerous experiments, but also identified as a useful resource for quantum information processing. Thus, the study of nonlocality is important both from a fundamental point of view and with respect to new applications in quantum information theory, such as secure cryptography and randomness generation. The identification of entanglement as a resource for quantum information led to a strong theoretical effort devoted to its characterisation and detection. Many of the resulting mathematical tools find application in several domains of physics. Although the only known way to create nonlocal correlations is to measure entangled quantum systems, it has been shown that entanglement and nonlocality constitute two inequivalent properties. Therefore, in the light of the success of entanglement theory, it is of interest to also devise a resource theory of nonlocality. The task of this thesis is to develop such a theoretical framework for the characterisation of nonlocality as a resource. To gain a better understanding of nonlocal correlations it will be necessary to investigate correlation scenarios that go beyond the situation originally considered by Bell. In doing so, this thesis provides new description of nonlocality that also have implications for the characterisation of quantum correlations and the detection of new forms of nonlocality. The first question we address is how nonlocality can consistently be defined in a scenario of arbitrarily many parties that may collaborate among each other. To this end we recognise which are the allowed physical operations in this situation and then define nonlocality as the resource that cannot be created by these operations. Our approach shows that the conventional definition of multipartite nonlocality, adopted by the community so far, is inconsistent with this operational definition; we further propose and analyse new models that do not suffer from these inconsistencies. Furthermore, we show that our findings have implications for the characterisation of quantum correlations. A recent approach to describe the set of quantum correlation consists in using principles inspired from information theory. By using a special instance of the models we defined earlier we show a fundamental limitation of this approach: no bipartite information principle is sufficient to single out the set of quantum correlations from the set of nonsignalling correlations. We then developed a description of nonlocality in an even more generalised scenario of several parties. Motivated by a result of Popescu we study scenarios where the parties are allowed to perform not only a single but sequences of measurements on their systems. Characterising nonlocality also in this scenario in operational terms and defining local models compatible with this definition, we show that a new form of nonlocality can be detected Lastly, we examine the problem of detecting the presence of nonlocality in a multipartite scenario when one is given only partial access to the global system. We find that one can verify that the total system must display nonlocality, even though the accessible subsystems only exhibit local correlations.

•Sep 18, 2013•0 citations

Extent of multiparticle quantum nonlocality

Nick S. Jones, Noah Linden, Serge Massar

It is well known that entangled quantum states are nonlocal: the corrrelations between local measurements carried out on these states cannot be reproduced by local hidden variable models. Svetlichny, followed by others, showed that multipartite quantum states are more nonlocal than bipartite ones in the sense that even some nonlocal classical models with (super-luminal) communication between some of the parties cannot reproduce the quantum correlations. Here we study in detail the kinds of nonlocality present in quantum states. More precisely, we enquire what kinds of classical communication patterns cannot reproduce quantum correlations. By studying the extremal points of the space of all multiparty probability distributions, in which all parties can make one of a pair of measurements each with two possible outcomes, we find a necessary condition for classical nonlocal models to reproduce the statistics of all quantum states. This condition extends and generalizes work of Svetlichny and others in which it was showed that a particular class of classical nonlocal models, the ``separable'' models, cannot reproduce the statistics of all multiparticle quantum states. Our condition shows that the nonlocality present in some entangled multiparticle quantum states is much stronger than previously thought. We also study the sufficiency of our condition.

arXiv:quant-ph/0407018•Physical Review A•Apr 19, 2005•51 citations

Quantum nonlocality, cryptography and complexity

Anne Broadbent

Quantum computing is the study of what we can and cannot do with quantum computers: computers operating based on the laws of quantum mechanics. This thesis is a collection of seven papers, dealing with three aspects of quantum computing: non-locality, cryptography and complexity. Nonlocality. Quantum nonlocality refers to the fact that, using a resource called quantum entanglement, two participants who are physically separated and unable to communicate can exhibit correlations that cannot be produced without entanglement. This gives rise to nonlocal games, which are multi-player cooperative games for which quantum players (who share entanglement) have an advantage over classical players (who share only classical information). A pseudo-telepathy game is a special case of a nonlocal game for which quantum players have a perfect winning strategy. The first paper in this thesis, On the power of non-local boxes, is a study of quantum correlations (which are non-signalling, i.e. they do not allow faster-than-light communication), as well as superquantum correlations (which are also non-signalling, but stronger than those predicted by quantum mechanics). We consider the simulation of pseudo-telepathy winning strategies with the nonlocal box (which can be seen as the most basic superquantum correlation), revealing that nonlocality and entanglement are different resources. Before our work, it was common to equate these two notions. The second paper, Classical, quantum and non-signalling resources in bipartite games, shows that the problem of deciding if a fixed game has a perfect classical winning strategy is NP-complete, while deciding if a perfect strategy exists with superquantum correlations is in P. We also establish links with the Bell-Kochen-Specker theorem, orthogonality graphs and two-prover interactive proofs. Quantum nonlocality is a phenomenon that we can, in theory, witness in the laboratory. Many experiments have been performed, but none so far have simultaneously closed all experimental loopholes. There is currently a substantial scientific effort to achieve the perfect laboratory experiment. Yet not all experimental setups are created equally: the third and fourth paper of this thesis, Entanglement swapping, light cones and elements of reality and On the logical structure of Bell theorems, show that recent proposals have classical explanations, and thus do nothing to aid in our comprehension of the quantum world. This work is scientifically valuable, since it tells us that we should not invest in the proposed lines of research. Classical and quantum cryptography. The groundbreaking work of Peter Shor in 1995 established that quantum computers can efficiently factor large integers, thus rendering most modern cryptographic systems insecure. But what quantum computers break, they also fix: Bennett and Brassard had already given in 1984 a protocol for key distribution whose security is based only on the laws of quantum mechanics. In a world with quantum computers, it seems like the only way to ensure perfect security in cryptographic tasks is to do away with computational assumptions (such as the apparent difficulty of factoring): this is the realm of information-theoretic security. In the fifth paper of this thesis, Information-theoretic security without an honest majority we give protocols to accomplish a series of six private distributed tasks (in particular, vote and anonymous message transmission), while ensuring information-theoretic security. Then, in Anonymous quantum communication, we give a protocol which, within a group, allows a sender to transfer a quantum message to a receiver ofhis choosing. The protocol ensures information-theoretic anonymity for the sender and the receiver as well as information-theoretic privacy for the message. Complexity in the measurement-based model. Finally, in Parallelizing quantum circuits, we study the depth complexity of quantum circuits, giving an automated technique for the parrallelization of quantum circuits. The development of parallel (low-depth) quantum circuits seems almost essential if we wish to implement quantum algorithms in the near future with available technology. Quantum information is usually unstable, hence we can only operate on it for a very short period of time. Parallel circuits maximize the use of this fragile quantum information. Our method is based on the recent paradigm for quantum computing called the measurement-based model. Key words: quantum information processing, pseudo-telepathy, nonlocal boxes, Bell's theorem, multi-party computation, information-theoretic security, anonymity, quantum depth complexity, measurement-based quantum computing, measurement calculus.

•Jan 1, 2008•0 citations

Quantifying quantum nonlocality

Ben Toner

Quantum mechanics is nonlocal, meaning it cannot be described by any classical local hidden variable model. In this thesis we study two aspects of quantum nonlocality. Part I addresses the question of what classical resources are required to simulate nonlocal quantum correlations. We start by constructing new local models for noisy entangled quantum states. These constructions exploit the connection between nonlocality and Grothendieck's inequality, first noticed by Tsirelson. Next, we consider local models augmented by a limited amount of classical communication. After generalizing Bell inequalities to this setting, we show that (i) one bit of communication is sufficient to simulate the correlations of projective measurements on a maximally entangled state of two qubits, and (ii) five bits of communication are sufficient to simulate the joint correlation of two-outcome measurements on any bipartite quantum state. The latter result can be interpreted as a stronger (constrained) version of Grothendieck's inequality. In part II, we investigate the monogamy of nonlocal correlations. In a setting where three parties, A, B, and C, share an entangled quantum state of arbitrary dimension, we: (i) bound the trade-off between AB's and AC's violation of the CHSH inequality, obtaining an intriguing generalization of Tsirelson's bound, and (ii) demonstrate that forcing B and C to be classically correlated prevents A and B from violating certain Bell inequalities. We study not only correlations that arise within quantum theory, but also arbitrary correlations that do not allow signaling between separate groups of parties. These results are based on new techniques for obtaining Tsirelson bounds, or bounds on the quantum value of a Bell inequality, and have applications to interactive proof systems and cryptography.

•Aug 12, 2013•3 citations

Quantification and distribution of genuinely nonlocal resources

Zhaofeng Su

Quantum mechanics is nonlocal, which makes it different from classical mechanics. Quantum information and quantum computation is a promising frontier science which is based on quantum mechanics. The nonlocality of quantum mechanics is the fundamental reason that many quantum information processing tasks have significant advantages over their classical counterparts. \nIn this dissertation, we study three aspects of quantum nonlocality, which include the quantitative relationship between entanglement and nonlocality, the quantification of genuine tripartite nonlocality and the distribution of nonlocal quantum resources. To be specific, \n•\tWe investigate the quantitative relationship between entanglement and nonlocality of bipartite quantum systems. We start by exploiting the condition that the nonlocality of two different two-qubit states can be optimally examined by a same nonlocality test setting. Via numerical simulation, we find that the nonlocality of a generic two-qubit state is upper bounded by a function of the corresponding entanglement. Further, we give an analytical proof for the upper bound and find the class of two-qubit states that can reach the upper bound. \n•\tWe analyze the quantification of genuine tripartite nonlocality of a generic three-qubit state. We find a method to solve the problem for a special class of three-qubit states which include not only pure states but also mixed states. Applying the method, we drive analytical results for the genuine tripartite nonlocality of generalized GHZ states, generalized Werner states and two class of mixed states with special correlation matrices. \n•\tWe investigate the distribution of nonlocal quantum resources. To distribute bipartite nonlocal quantum resources, we design an efficient quantum repeater scheme, which not only achieves the optimal transmission rate but also consumes less resources of local operations and classical communication, for the case of general pure states of two-qubit system. We also analyze the case of bipartite pure states of arbitrary dimensional quantum system and get an upper bound on the probability of a successful projection operation to produce a maximally nonlocal state. To distribute tripartite nonlocal resources, we propose a simple scenario to generate tripartite nonlocal resources from bipartite nonlocal resources. As examples, we examine the cases that two-qubit Werner states and general two-qubit pure states are prepared as resources, respectively. We get the upper bounds on the genuine tripartite nonlocality that can be generated in the scenario. We also provide the optimal measurement settings to achieve the upper bounds.

•Jan 1, 2018•0 citations
Nonlocality and its connections to entanglement are fundamental features of quantum mechanics that have found numerous applications in quantum information science. A set of correlations is said to be nonlocal if it cannot be reproduced by spacelike-separated parties sharing randomness and performing local operations. An important practical consideration is that the runtime of the parties has to be shorter than the time it takes light to travel between them. One way to model this restriction is to assume that the parties are computationally bounded. We therefore initiate the study of nonlocality under computational assumptions and derive the following results: (a) We define the set NeL\mathsf{NeL}NeL (not-efficiently-local) as consisting of all bipartite states whose correlations arising from local measurements cannot be reproduced with shared randomness and \emph{polynomial-time} local operations. (b) Under the assumption that the Learning With Errors problem cannot be solved in \emph{quantum} polynomial-time, we show that NeL=ENT\mathsf{NeL}=\mathsf{ENT}NeL=ENT, where ENT\mathsf{ENT}ENT is the set of \emph{all} bipartite entangled states (pure and mixed). This is in contrast to the standard notion of nonlocality where it is known that some entangled states, e.g. Werner states, are local. In essence, we show that there exist (efficient) local measurements producing correlations that cannot be reproduced through shared randomness and quantum polynomial-time computation. (c) We prove that if NeL=ENT\mathsf{NeL}=\mathsf{ENT}NeL=ENT unconditionally, then BQP≠PP\mathsf{BQP}\neq\mathsf{PP}BQP=PP. In other words, the ability to certify all bipartite entangled states against computationally bounded adversaries gives a non-trivial separation of complexity classes. (d) Using (c), we show that a certain natural class of 1-round delegated quantum computation protocols that are sound against PP\mathsf{PP}PP provers cannot exist.
Nonlocality and its connections to entanglement are fundamental features of quantum mechanics that have found numerous applications in quantum information science. A set of correlations is said to be nonlocal if it cannot be reproduced by spacelike-separated parties sharing randomness and performing local operations. An important practical consideration is that the runtime of the parties has to be shorter than the time it takes light to travel between them. One way to model this restriction is to assume that the parties are computationally bounded. We therefore initiate the study of nonlocality under computational assumptions and derive the following results:
Despite the success of quantum mechanics in predicting the outcomes of experiments in many branches of physics, the foundations of the theory have remained subject of research and dispute. At the basis of this struggle with the theory lie the phenomena of nonlocality and entanglement. Since it was first predicted by Bell in 1964, nonlocality was not only verified in numerous experiments, but also identified as a useful resource for quantum information processing. Thus, the study of nonlocality is important both from a fundamental point of view and with respect to new applications in quantum information theory, such as secure cryptography and randomness generation. The identification of entanglement as a resource for quantum information led to a strong theoretical effort devoted to its characterisation and detection. Many of the resulting mathematical tools find application in several domains of physics. Although the only known way to create nonlocal correlations is to measure entangled quantum systems, it has been shown that entanglement and nonlocality constitute two inequivalent properties. Therefore, in the light of the success of entanglement theory, it is of interest to also devise a resource theory of nonlocality. The task of this thesis is to develop such a theoretical framework for the characterisation of nonlocality as a resource. To gain a better understanding of nonlocal correlations it will be necessary to investigate correlation scenarios that go beyond the situation originally considered by Bell. In doing so, this thesis provides new description of nonlocality that also have implications for the characterisation of quantum correlations and the detection of new forms of nonlocality. The first question we address is how nonlocality can consistently be defined in a scenario of arbitrarily many parties that may collaborate among each other. To this end we recognise which are the allowed physical operations in this situation and then define nonlocality as the resource that cannot be created by these operations. Our approach shows that the conventional definition of multipartite nonlocality, adopted by the community so far, is inconsistent with this operational definition; we further propose and analyse new models that do not suffer from these inconsistencies. Furthermore, we show that our findings have implications for the characterisation of quantum correlations. A recent approach to describe the set of quantum correlation consists in using principles inspired from information theory. By using a special instance of the models we defined earlier we show a fundamental limitation of this approach: no bipartite information principle is sufficient to single out the set of quantum correlations from the set of nonsignalling correlations. We then developed a description of nonlocality in an even more generalised scenario of several parties. Motivated by a result of Popescu we study scenarios where the parties are allowed to perform not only a single but sequences of measurements on their systems. Characterising nonlocality also in this scenario in operational terms and defining local models compatible with this definition, we show that a new form of nonlocality can be detected Lastly, we examine the problem of detecting the presence of nonlocality in a multipartite scenario when one is given only partial access to the global system. We find that one can verify that the total system must display nonlocality, even though the accessible subsystems only exhibit local correlations.
It is well known that entangled quantum states are nonlocal: the corrrelations between local measurements carried out on these states cannot be reproduced by local hidden variable models. Svetlichny, followed by others, showed that multipartite quantum states are more nonlocal than bipartite ones in the sense that even some nonlocal classical models with (super-luminal) communication between some of the parties cannot reproduce the quantum correlations. Here we study in detail the kinds of nonlocality present in quantum states. More precisely, we enquire what kinds of classical communication patterns cannot reproduce quantum correlations. By studying the extremal points of the space of all multiparty probability distributions, in which all parties can make one of a pair of measurements each with two possible outcomes, we find a necessary condition for classical nonlocal models to reproduce the statistics of all quantum states. This condition extends and generalizes work of Svetlichny and others in which it was showed that a particular class of classical nonlocal models, the ``separable'' models, cannot reproduce the statistics of all multiparticle quantum states. Our condition shows that the nonlocality present in some entangled multiparticle quantum states is much stronger than previously thought. We also study the sufficiency of our condition.
Quantum computing is the study of what we can and cannot do with quantum computers: computers operating based on the laws of quantum mechanics. This thesis is a collection of seven papers, dealing with three aspects of quantum computing: non-locality, cryptography and complexity. Nonlocality. Quantum nonlocality refers to the fact that, using a resource called quantum entanglement, two participants who are physically separated and unable to communicate can exhibit correlations that cannot be produced without entanglement. This gives rise to nonlocal games, which are multi-player cooperative games for which quantum players (who share entanglement) have an advantage over classical players (who share only classical information). A pseudo-telepathy game is a special case of a nonlocal game for which quantum players have a perfect winning strategy. The first paper in this thesis, On the power of non-local boxes, is a study of quantum correlations (which are non-signalling, i.e. they do not allow faster-than-light communication), as well as superquantum correlations (which are also non-signalling, but stronger than those predicted by quantum mechanics). We consider the simulation of pseudo-telepathy winning strategies with the nonlocal box (which can be seen as the most basic superquantum correlation), revealing that nonlocality and entanglement are different resources. Before our work, it was common to equate these two notions. The second paper, Classical, quantum and non-signalling resources in bipartite games, shows that the problem of deciding if a fixed game has a perfect classical winning strategy is NP-complete, while deciding if a perfect strategy exists with superquantum correlations is in P. We also establish links with the Bell-Kochen-Specker theorem, orthogonality graphs and two-prover interactive proofs. Quantum nonlocality is a phenomenon that we can, in theory, witness in the laboratory. Many experiments have been performed, but none so far have simultaneously closed all experimental loopholes. There is currently a substantial scientific effort to achieve the perfect laboratory experiment. Yet not all experimental setups are created equally: the third and fourth paper of this thesis, Entanglement swapping, light cones and elements of reality and On the logical structure of Bell theorems, show that recent proposals have classical explanations, and thus do nothing to aid in our comprehension of the quantum world. This work is scientifically valuable, since it tells us that we should not invest in the proposed lines of research. Classical and quantum cryptography. The groundbreaking work of Peter Shor in 1995 established that quantum computers can efficiently factor large integers, thus rendering most modern cryptographic systems insecure. But what quantum computers break, they also fix: Bennett and Brassard had already given in 1984 a protocol for key distribution whose security is based only on the laws of quantum mechanics. In a world with quantum computers, it seems like the only way to ensure perfect security in cryptographic tasks is to do away with computational assumptions (such as the apparent difficulty of factoring): this is the realm of information-theoretic security. In the fifth paper of this thesis, Information-theoretic security without an honest majority we give protocols to accomplish a series of six private distributed tasks (in particular, vote and anonymous message transmission), while ensuring information-theoretic security. Then, in Anonymous quantum communication, we give a protocol which, within a group, allows a sender to transfer a quantum message to a receiver ofhis choosing. The protocol ensures information-theoretic anonymity for the sender and the receiver as well as information-theoretic privacy for the message. Complexity in the measurement-based model. Finally, in Parallelizing quantum circuits, we study the depth complexity of quantum circuits, giving an automated technique for the parrallelization of quantum circuits. The development of parallel (low-depth) quantum circuits seems almost essential if we wish to implement quantum algorithms in the near future with available technology. Quantum information is usually unstable, hence we can only operate on it for a very short period of time. Parallel circuits maximize the use of this fragile quantum information. Our method is based on the recent paradigm for quantum computing called the measurement-based model. Key words: quantum information processing, pseudo-telepathy, nonlocal boxes, Bell's theorem, multi-party computation, information-theoretic security, anonymity, quantum depth complexity, measurement-based quantum computing, measurement calculus.
Quantum mechanics is nonlocal, meaning it cannot be described by any classical local hidden variable model. In this thesis we study two aspects of quantum nonlocality. Part I addresses the question of what classical resources are required to simulate nonlocal quantum correlations. We start by constructing new local models for noisy entangled quantum states. These constructions exploit the connection between nonlocality and Grothendieck's inequality, first noticed by Tsirelson. Next, we consider local models augmented by a limited amount of classical communication. After generalizing Bell inequalities to this setting, we show that (i) one bit of communication is sufficient to simulate the correlations of projective measurements on a maximally entangled state of two qubits, and (ii) five bits of communication are sufficient to simulate the joint correlation of two-outcome measurements on any bipartite quantum state. The latter result can be interpreted as a stronger (constrained) version of Grothendieck's inequality. In part II, we investigate the monogamy of nonlocal correlations. In a setting where three parties, A, B, and C, share an entangled quantum state of arbitrary dimension, we: (i) bound the trade-off between AB's and AC's violation of the CHSH inequality, obtaining an intriguing generalization of Tsirelson's bound, and (ii) demonstrate that forcing B and C to be classically correlated prevents A and B from violating certain Bell inequalities. We study not only correlations that arise within quantum theory, but also arbitrary correlations that do not allow signaling between separate groups of parties. These results are based on new techniques for obtaining Tsirelson bounds, or bounds on the quantum value of a Bell inequality, and have applications to interactive proof systems and cryptography.
Quantum mechanics is nonlocal, which makes it different from classical mechanics. Quantum information and quantum computation is a promising frontier science which is based on quantum mechanics. The nonlocality of quantum mechanics is the fundamental reason that many quantum information processing tasks have significant advantages over their classical counterparts. \nIn this dissertation, we study three aspects of quantum nonlocality, which include the quantitative relationship between entanglement and nonlocality, the quantification of genuine tripartite nonlocality and the distribution of nonlocal quantum resources. To be specific, \n•\tWe investigate the quantitative relationship between entanglement and nonlocality of bipartite quantum systems. We start by exploiting the condition that the nonlocality of two different two-qubit states can be optimally examined by a same nonlocality test setting. Via numerical simulation, we find that the nonlocality of a generic two-qubit state is upper bounded by a function of the corresponding entanglement. Further, we give an analytical proof for the upper bound and find the class of two-qubit states that can reach the upper bound. \n•\tWe analyze the quantification of genuine tripartite nonlocality of a generic three-qubit state. We find a method to solve the problem for a special class of three-qubit states which include not only pure states but also mixed states. Applying the method, we drive analytical results for the genuine tripartite nonlocality of generalized GHZ states, generalized Werner states and two class of mixed states with special correlation matrices. \n•\tWe investigate the distribution of nonlocal quantum resources. To distribute bipartite nonlocal quantum resources, we design an efficient quantum repeater scheme, which not only achieves the optimal transmission rate but also consumes less resources of local operations and classical communication, for the case of general pure states of two-qubit system. We also analyze the case of bipartite pure states of arbitrary dimensional quantum system and get an upper bound on the probability of a successful projection operation to produce a maximally nonlocal state. To distribute tripartite nonlocal resources, we propose a simple scenario to generate tripartite nonlocal resources from bipartite nonlocal resources. As examples, we examine the cases that two-qubit Werner states and general two-qubit pure states are prepared as resources, respectively. We get the upper bounds on the genuine tripartite nonlocality that can be generated in the scenario. We also provide the optimal measurement settings to achieve the upper bounds.