On complexity of classical simulation of quantum branching programs

MaRDI QIDQ3013162zbMATH OpenFDO

Authors F. Ablayev

Publication date 18 July 2011

zbMATH Keywords

branching programquantum algorithmssimulation complexity

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Quantum and classical simulation of quantum branching programs
• scientific article; zbMATH DE number 6004860
• scientific article; zbMATH DE number 2095528
• scientific article; zbMATH DE number 1839432
• Quantum branching programs and space-bounded nonuniform quantum complexity

Cited in

(8)

• Quantum simulation of generalized Hardy's paradox and corresponding Hardy's inequality via quantum programming
• On the computational power of probabilistic and quantum branching program
• scientific article; zbMATH DE number 1696662 (Why is no real title available?)
• Quantum and classical simulation of quantum branching programs
• scientific article; zbMATH DE number 6004860 (Why is no real title available?)
• A LOGIC FOR QUANTUM COMPUTATION AND CLASSICAL SIMULATION OF QUANTUM ALGORITHMS
• scientific article; zbMATH DE number 2086634 (Why is no real title available?)
• scientific article; zbMATH DE number 2095528 (Why is no real title available?)

This page was built for publication: On complexity of classical simulation of quantum branching programs

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