Quantum Algorithm for Multiplicative Linear Logic
Lorenzo Saraiva, Edward Hermann Haeusler, Vaston Costa
TL;DR
This paper introduces a quantum algorithm leveraging Grover's search to perform proof search in a subset of Linear Logic, demonstrating its implementation on quantum simulators.
Contribution
It presents a novel quantum algorithm for proof search in Linear Logic using Grover's algorithm, with detailed steps and simulation results.
Findings
Successful implementation on quantum simulators
Potential for faster proof search in Linear Logic
Foundation for quantum logic proof systems
Abstract
This paper describes a quantum algorithm for proof search in sequent calculus of a subset of Linear Logic using the Grover Search Algorithm. We briefly overview the Grover Search Algorithm and Linear Logic, show the detailed steps of the algorithm and then present the results obtained on quantum simulators.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Computability, Logic, AI Algorithms · Quantum Information and Cryptography