How many questions do you need to prove that unasked questions have no answers?

被引:9
作者
Cabello, A [1 ]
机构
[1] Univ Seville, Dept Fis Aplicada 2, E-41012 Seville, Spain
关键词
Kochen-Specker theorem;
D O I
10.1142/S021974990600161X
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Suppose a quantum system is prepared in an arbitrary quantum state. How many yes-no questions about that system would you have to consider to prove that such questions have no predefined answers? Peres conjectured that the minimum number was 18, as in the case of the set found in 1995. Asher's conjecture has recently been proven correct: there are no sets with fewer than 18 questions. This is the end of a long story which began in 1967, when Kochen and Specker found a similar set requiring 117 questions.
引用
收藏
页码:55 / 61
页数:7
相关论文
共 46 条
[1]  
[Anonymous], TRCS9002
[2]  
BELINFANTE FJ, 1973, SURVEY HIDDEN VARIAB
[3]   ON PROBLEM OF HIDDEN VARIABLES IN QUANTUM MECHANICS [J].
BELL, JS .
REVIEWS OF MODERN PHYSICS, 1966, 38 (03) :447-&
[4]  
Bell JS., 1964, PHYS PHYS FIZIKA, V1, P195, DOI [10.1103/Physics-PhysiqueFizika.1.195, 10.1103/PhysicsPhysiqueFizika.1.195, DOI 10.1103/PHYSICSPHYSIQUEFIZIKA.1.195]
[5]  
BENNETT CH, 2004, RECENT DEV QUANTUM P
[6]   Schutte's tautology and the Kochen-Specker theorem [J].
Bub, J .
FOUNDATIONS OF PHYSICS, 1996, 26 (06) :787-806
[7]  
Bub J., 1997, Interpreting the quantum world
[8]   Simple proof of the Kochen. Specker theorem [J].
Cabello, A. .
European Journal of Physics, 1994, 15 (04)
[9]   Recursive proof of the Bell-Kochen-Specker theorem in any dimension n>3 [J].
Cabello, A ;
Estebaranz, JA ;
García-Alcaine, G .
PHYSICS LETTERS A, 2005, 339 (06) :425-429
[10]  
Cabello A, 1997, FUND THEOR, V81, P59