Quantum and classical simulation of quantum branching programs

zbMATH Open1223.68039MaRDI QIDQ3013166FDOQ3013166

Authors: A. F. Gainutdinova 

Publication date: 18 July 2011

Recommendations

• scientific article; zbMATH DE number 6004860
• On complexity of classical simulation of quantum branching programs
• scientific article; zbMATH DE number 1839432
• Classical and Quantum Computations with Restricted Memory
• scientific article; zbMATH DE number 2095528

zbMATH Keywords

branching programscomputation complexityquantum and classical simulation

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12)

Cited In (10)

• On complexity of classical simulation of quantum branching programs
• Title not available (Why is that?)
• 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
• Quantum branching programs and space-bounded nonuniform quantum complexity
• Title not available (Why is that?)
• Improved BDD Algorithms for the Simulation of Quantum Circuits
• Quantum channel simulation of phylogenetic branching models
• Title not available (Why is that?)
• Classical and Quantum Computations with Restricted Memory

This page was built for publication: Quantum and 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 Q3013166)