Randomized decision tree complexity of Deutsch-Jozsa problem and a generalization

DOI10.1007/S11128-024-04292-2MaRDI QIDQ6129149zbMATH OpenOpenAlexFDO

Authors Guo-Liang Xu, Daowen Qiu, Binbin Zhang, Tian-Yin Wang, Yongxin Zhang

Publication date 16 April 2024

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11128-024-04292-2

zbMATH Keywords

Boolean functionquantum computationrandomized decision tree complexityquantum algorithm and complexity

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• Quantum and classical query complexities for generalized Deutsch-Jozsa problems
• A different Deutsch-Jozsa
• Revisiting Deutsch-Jozsa algorithm
• The Deutsch-Jozsa problem: de-quantisation and entanglement
• Generalizations of the distributed Deutsch-Jozsa promise problem

This page was built for publication: Randomized decision tree complexity of Deutsch-Jozsa problem and a generalization

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