scientific article; zbMATH DE number 1500664

zbMATH Open0964.81019MaRDI QIDQ4501686FDOQ4501686

Tomoyuki Yamakami

Publication date: 4 September 2000

Title of this publication is not available (Why is that?)

Recommendations

• ANALYSIS OF QUANTUM FUNCTIONS
• Characterizing classes of functions computable by quantum parallelism
• Computations on quantum computers based on non-classic probability theory
• Reversibility and Irreversibility in Quantum Computation and in Quantum Computational Logics

zbMATH Keywords

quantum mechanical computation

Mathematics Subject Classification ID

Quantum computation (81P68)

Cited In (8)

• Interactive proofs with quantum finite automata
• Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
• A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
• Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice
• A compositional approach to quantum functions
• ANALYSIS OF QUANTUM FUNCTIONS
• An application of quantum finite automata to interactive proof systems
• Theory of one-tape linear-time Turing machines

This page was built for publication:

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