Proof of the Peres Conjecture for Contextuality

Area of Science:

• Foundations of quantum mechanics
• Quantum information theory
• Mathematical physics

Background:

• The Kochen-Specker theorem is a cornerstone in quantum mechanics, demonstrating the impossibility of reconciling quantum theory with noncontextual classical models for ideal measurements.
• Early derivations of the theorem were complex, prompting ongoing research into simpler and more fundamental proofs.
• Quantum contextuality, a key concept, highlights that measurement outcomes can depend on the set of other compatible measurements performed.

Purpose of the Study:

• To develop a systematic approach for identifying minimal Hardy-type and Greenberger-Horne-Zeilinger-type (GHZ-type) proofs of the Kochen-Specker theorem.
• To verify the conjecture by Peres regarding the minimality of the 18-vector Kochen-Specker set for any dimension.
• To explore the identification of minimal contextuality scenarios and their applications in quantum information processing.

Main Methods:

• Development of a systematic methodology to construct minimal proofs of the Kochen-Specker theorem.
• Analysis of Hardy-type and Greenberger-Horne-Zeilinger-type (GHZ-type) proof structures.
• Verification of the minimality of a specific Kochen-Specker set using the developed systematic approach.

Main Results:

• A systematic method for finding minimal Hardy-type and GHZ-type proofs of the Kochen-Specker theorem has been established.
• The study confirms that the 18-vector Kochen-Specker set is indeed the minimal set required for any dimension, validating Peres' conjecture.
• The research provides a framework for identifying minimal contextuality scenarios.

Conclusions:

• The Kochen-Specker theorem's proofs can be systematically simplified to minimal forms.
• The minimality of the 18-vector set has been rigorously confirmed, advancing the understanding of quantum contextuality.
• The findings have implications for understanding and utilizing quantum contextuality in information processing tasks.