Quantum deduction rules

DOI10.1016/J.APAL.2008.09.017zbMATH Open1173.03045OpenAlexW2024450183MaRDI QIDQ1001909FDOQ1001909

Authors: 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

Recommendations

• Extended quantum logic
• Quantum Logic in the Framework of Linear Logic
• Quantum logic as a basis for computations
• Mathematical logic and quantum finite state automata
• Many-valued Logics in Classical and Quantum Gates

zbMATH Keywords

proof complexityquantum computationpropositional logicquantum cryptosystemsquantum Frege proof systems

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Title not available (Why is that?)
• Some consequences of cryptographical conjectures for \(S_2^1\) and EF
• The relative efficiency of propositional proof systems
• EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS
• Propositional consistency proofs
• On Interpolation and Automatization for Frege Systems
• Title not available (Why is that?)
• Quantum computing and hidden variables
• Both Toffoli and Controlled-NOT need little help to universal quantum computing

This page was built for publication: Quantum deduction rules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1001909)