Quantum deduction rules

DOI10.1016/j.apal.2008.09.017zbMath1173.03045OpenAlexW2024450183MaRDI QIDQ1001909

Pavel Pudlák

Publication date: 19 February 2009

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2008.09.017

zbMATH Keywords

propositional logicquantum computationproof complexityquantum cryptosystemsquantum Frege proof systems

Mathematics Subject Classification ID

Quantum computation (81P68) Mechanization of proofs and logical operations (03B35) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Abstract deductive systems (03B22) Complexity of proofs (03F20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Propositional consistency proofs
• Some consequences of cryptographical conjectures for \(S_2^1\) and EF
• Quantum computing and hidden variables
• The relative efficiency of propositional proof systems
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On Interpolation and Automatization for Frege Systems
• EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS

This page was built for publication: Quantum deduction rules