Quantum first-order logics that capture logarithmic-time/space quantum computability

DOI10.1007/978-3-031-64309-5_25MaRDI QIDQ7030896zbMATH OpenFDO

Authors Tomoyuki Yamakami

Publication date 7 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-64309-5_25

Mathematics Subject Classification ID

Quantum logic (03G12) Logical foundations of quantum mechanics; quantum logic (quantum-theoretic aspects) (81P10) Quantum computation (81P68)

Cites work

• A logic for constant-depth circuits
• A programming language characterizing quantum polynomial time
• A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
• ANALYSIS OF QUANTUM FUNCTIONS
• DYNAMIC QUANTUM LOGIC FOR QUANTUM PROGRAMS
• Expressibility and Parallel Complexity
• Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability
• scientific article; zbMATH DE number 3474957 (Why is no real title available?)
• scientific article; zbMATH DE number 1776257 (Why is no real title available?)
• scientific article; zbMATH DE number 1418357 (Why is no real title available?)
• Languages that Capture Complexity Classes
• Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice
• On uniformity within \(NC^ 1\)
• Quantum Complexity Theory
• Relational queries computable in polynomial time
• The logic of quantum mechanics.
• Toward automatic verification of quantum programs

Cited in

(2)

• Quantum first-order logics and quantum natural deduction
• Quantum programming in polylogarithmic time

This page was built for publication: Quantum first-order logics that capture logarithmic-time/space quantum computability

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