Quantum deduction rules

DOI10.1016/J.APAL.2008.09.017MaRDI QIDQ1001909zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

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)