scholarly journals Hardy’s paradox according to non-classical semantics

2018 ◽  
Vol 59 (6) ◽  
pp. 062101
Author(s):  
Arkady Bolotin
Keyword(s):  
2015 ◽  
Vol 91 (1) ◽  
Author(s):  
Kazuo Fujikawa ◽  
C. H. Oh ◽  
Sixia Yu
Keyword(s):  

2014 ◽  
Vol 89 (3) ◽  
Author(s):  
Ebrahim Karimi ◽  
Filippo Cardano ◽  
Maria Maffei ◽  
Corrado de Lisio ◽  
Lorenzo Marrucci ◽  
...  

2017 ◽  
Vol 31 (02) ◽  
pp. 1750007 ◽  
Author(s):  
A. V. Melkikh

Quantum entanglement is discussed as a consequence of the quantization of fields. The inclusion of quantum fields self-consistently explains some quantum paradoxes (EPR and Hardy’s paradox). The definition of entanglement was introduced, which depends on the maximum energy of the interaction of particles. The destruction of entanglement is caused by the creation and annihilation of particles. On this basis, an algorithm for quantum particle evolution was formulated.


2018 ◽  
Vol 120 (5) ◽  
Author(s):  
Shu-Han Jiang ◽  
Zhen-Peng Xu ◽  
Hong-Yi Su ◽  
Arun Kumar Pati ◽  
Jing-Ling Chen
Keyword(s):  

2015 ◽  
Vol 15 (15&16) ◽  
pp. 1317-1332
Author(s):  
Laura Mančinska ◽  
Thomas Vidick

Quantum entanglement is known to provide a strong advantage in many two-party distributed tasks. We investigate the question of how much entanglement is needed to reach optimal performance. For the first time we show that there exists a purely classical scenario for which no finite amount of entanglement suffices. To this end we introduce a simple two-party nonlocal game H, inspired by Lucien Hardy’s paradox. In our game each player has only two possible questions and can provide bit strings of any finite length as answer. We exhibit a sequence of strategies which use entangled states in increasing dimension d and succeed with probability 1 − O(d−c ) for some c ≥ 0.13. On the other hand, we show that any strategy using an entangled state of local dimension d has success probability at most 1 − Ω(d−2 ). In addition, we show that any strategy restricted to producing answers in a set of cardinality at most d has success probability at most 1 − Ω(d−2 ). Finally, we generalize our construction to derive similar results starting from any game G with two questions per player and finite answers sets in which quantum strategies have an advantage.


2014 ◽  
Vol 12 (06) ◽  
pp. 1450039 ◽  
Author(s):  
Zhen-Peng Xu ◽  
Hong-Yi Su ◽  
Jing-Ling Chen

Hardy's paradox is of fundamental importance in quantum information theory. So far, there have been two types of its extensions into higher dimensions: in the first type the maximum probability of nonlocal events is roughly 9% and remains the same as the dimension changes (dimension-independent), while in the second type the probability becomes larger as the dimension increases, reaching approximately 40% in the infinite limit. Here, we (i) give an alternative proof of the first type, (ii) study the situation in which the maximum probability of nonlocal events can also be dimension-independent in the second type and (iii) conjecture how the situation could be changed in order that (ii) still holds.


Sign in / Sign up

Export Citation Format

Share Document