Formalizing CHSH Rigidity in Lean 4
Fuente:
arXiv
Saved in:
| Main Authors: | Zhao, Tianrun, Yu, Nengkun |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
SAQR-QC: A Logic for Scalable but Approximate Quantitative Reasoning about Quantum Circuits
by: Yu, Nengkun, et al.
Published: (2025)
by: Yu, Nengkun, et al.
Published: (2025)
Model Checking Quantum Continuous-Time Markov Chains
by: Xu, Ming, et al.
Published: (2021)
by: Xu, Ming, et al.
Published: (2021)
End-to-End Formalization of Quantum Error Correction
by: Ehatamm, Mattias, et al.
Published: (2026)
by: Ehatamm, Mattias, et al.
Published: (2026)
Formal Verification of Quantum Programs: Theory, Tools and Challenges
by: Lewis, Marco, et al.
Published: (2021)
by: Lewis, Marco, et al.
Published: (2021)
Formally Verifying Quantum Phase Estimation Circuits with 1,000+ Qubits
by: Govindankutty, Arun, et al.
Published: (2026)
by: Govindankutty, Arun, et al.
Published: (2026)
LeanBET: Formally-verified surface area calculations in Lean
by: Ugwuanyi, Ejike D., et al.
Published: (2026)
by: Ugwuanyi, Ejike D., et al.
Published: (2026)
Formalization of physics index notation in Lean 4
by: Tooby-Smith, Joseph
Published: (2024)
by: Tooby-Smith, Joseph
Published: (2024)
Formalizing Wu-Ritt Method in Lean 4
by: Xiao, Yuxuan, et al.
Published: (2026)
by: Xiao, Yuxuan, et al.
Published: (2026)
Bit-Vector Abstractions to Formally Verify Quantum Error Detection & Entanglement
by: Govindankutty, Arun
Published: (2026)
by: Govindankutty, Arun
Published: (2026)
MerLean: An Agentic Framework for Autoformalization in Quantum Computation
by: Ren, Yuanjie, et al.
Published: (2026)
by: Ren, Yuanjie, et al.
Published: (2026)
Sequencelib: A Computational Platform for Formalizing the OEIS in Lean
by: Moreira, Walter, et al.
Published: (2026)
by: Moreira, Walter, et al.
Published: (2026)
Formalizing multi-graded Brenner-Schröer Proj schemes and dilatations of rings in Lean4
by: Mayeux, Arnaud, et al.
Published: (2026)
by: Mayeux, Arnaud, et al.
Published: (2026)
Formalizing Mason-Stothers Theorem and its Corollaries in Lean 4
by: Baek, Jineon, et al.
Published: (2024)
by: Baek, Jineon, et al.
Published: (2024)
Basic interactive algorithms: Preview
by: Gurevich, Yuri
Published: (2025)
by: Gurevich, Yuri
Published: (2025)
A Complete and Natural Rule Set for Multi-Qutrit Clifford Circuits
by: Li, Sarah Meng, et al.
Published: (2025)
by: Li, Sarah Meng, et al.
Published: (2025)
Formalizing Automated Market Makers in the Lean 4 Theorem Prover
by: Pusceddu, Daniele, et al.
Published: (2024)
by: Pusceddu, Daniele, et al.
Published: (2024)
Formalizing $A_1^{(1)}$ Curve Neighborhoods in Lean 4
by: Huang, Yihe, et al.
Published: (2026)
by: Huang, Yihe, et al.
Published: (2026)
Checking Continuous Stochastic Logic against Quantum Continuous-Time Markov Chains
by: Xu, Ming, et al.
Published: (2022)
by: Xu, Ming, et al.
Published: (2022)
Lean-auto: An Interface between Lean 4 and Automated Theorem Provers
by: Qian, Yicheng, et al.
Published: (2025)
by: Qian, Yicheng, et al.
Published: (2025)
The Chase in Lean -- Crafting a Formal Library for Existential Rule Research
by: Gerlach, Lukas
Published: (2026)
by: Gerlach, Lukas
Published: (2026)
Model Checking Matrix Product States against Linear Chain Logic
by: Xu, Ming, et al.
Published: (2026)
by: Xu, Ming, et al.
Published: (2026)
A Complete Equational Presentation of Qudit Circuits via Polycontrolled PROPs
by: Blake, Colin
Published: (2026)
by: Blake, Colin
Published: (2026)
Simpler Presentations for Many Fragments of Quantum Circuits
by: Blake, Colin
Published: (2026)
by: Blake, Colin
Published: (2026)
Algebraic Structure of Quantum Controlled States and Operators
by: Agnew, Edwin, et al.
Published: (2026)
by: Agnew, Edwin, et al.
Published: (2026)
Planted-solution SAT and Ising benchmarks from integer factorization
by: Hen, Itay
Published: (2026)
by: Hen, Itay
Published: (2026)
A Complete Equational Theory for Real-Clifford+CH Quantum Circuits
by: Clément, Alexandre
Published: (2026)
by: Clément, Alexandre
Published: (2026)
Commutation Groups and State-Independent Contextuality
by: Abramsky, Samson, et al.
Published: (2026)
by: Abramsky, Samson, et al.
Published: (2026)
Complexity of Satisfiability in Kochen-Specker Partial Boolean Algebras
by: Dawar, Anuj, et al.
Published: (2026)
by: Dawar, Anuj, et al.
Published: (2026)
Classical Explanations in (and of) General Probabilistic Theories
by: Harding, John, et al.
Published: (2026)
by: Harding, John, et al.
Published: (2026)
Quantum Petri Nets with Event Structures semantics
by: Joachim, Julien Saan, et al.
Published: (2025)
by: Joachim, Julien Saan, et al.
Published: (2025)
Verification of Quantum Circuits through Barrier Certificates using a Scenario Approach
by: Hu, Siwei, et al.
Published: (2025)
by: Hu, Siwei, et al.
Published: (2025)
QReach: A Reachability Analysis Tool for Quantum Markov Chains
by: Dai, Aochu, et al.
Published: (2025)
by: Dai, Aochu, et al.
Published: (2025)
What are kets?
by: Gurevich, Yuri, et al.
Published: (2024)
by: Gurevich, Yuri, et al.
Published: (2024)
Proceedings of the 21st International Conference on Quantum Physics and Logic
by: Díaz-Caro, Alejandro, et al.
Published: (2024)
by: Díaz-Caro, Alejandro, et al.
Published: (2024)
Verifying Quantum Phase Estimation (QPE) using Prove-It
by: Witzel, Wayne M., et al.
Published: (2023)
by: Witzel, Wayne M., et al.
Published: (2023)
A Quantum-Control Lambda-Calculus with Multiple Measurement Bases
by: Díaz-Caro, Alejandro, et al.
Published: (2025)
by: Díaz-Caro, Alejandro, et al.
Published: (2025)
The decohered ZX-calculus
by: Carette, Titouan, et al.
Published: (2025)
by: Carette, Titouan, et al.
Published: (2025)
The Many-Worlds Calculus
by: Chardonnet, Kostia, et al.
Published: (2022)
by: Chardonnet, Kostia, et al.
Published: (2022)
Potential for Polynomial Solution for NP-Complete Problems using Quantum Computation
by: Badihian, Neema Rustin
Published: (2025)
by: Badihian, Neema Rustin
Published: (2025)
Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing
by: Vilmart, Renaud
Published: (2023)
by: Vilmart, Renaud
Published: (2023)
Similar Items
-
SAQR-QC: A Logic for Scalable but Approximate Quantitative Reasoning about Quantum Circuits
by: Yu, Nengkun, et al.
Published: (2025) -
Model Checking Quantum Continuous-Time Markov Chains
by: Xu, Ming, et al.
Published: (2021) -
End-to-End Formalization of Quantum Error Correction
by: Ehatamm, Mattias, et al.
Published: (2026) -
Formal Verification of Quantum Programs: Theory, Tools and Challenges
by: Lewis, Marco, et al.
Published: (2021) -
Formally Verifying Quantum Phase Estimation Circuits with 1,000+ Qubits
by: Govindankutty, Arun, et al.
Published: (2026)