A different Deutsch-Jozsa

DOI10.1007/S11128-015-0976-2MaRDI QIDQ2355586zbMATH OpenOpenAlexFDO

Authors Debajyoti Bera

Publication date 24 July 2015

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

Full work available at URL https://doi.org/10.1007/s11128-015-0976-2

zbMATH Keywords

amplitude amplificationDeutsch-Jozsalower boundquantum algorithmrandomized algorithm

Mathematics Subject Classification ID

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

Recommendations

• Quantum and classical query complexities for generalized Deutsch-Jozsa problems
• Revisiting Deutsch-Jozsa algorithm
• scientific article; zbMATH DE number 2103524
• scientific article; zbMATH DE number 2076191
• Initialization-free generalized Deutsch-Jozsa algorithm

Cites work

• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 2103524 (Why is no real title available?)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum algorithms revisited
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Rapid solution of problems by quantum computation

Cited in

(8)

• Quantum cryptographic property testing of multi-output Boolean functions
• Revisiting Deutsch-Jozsa algorithm
• An alternate quantum adiabatic evolution for the Deutsch-Jozsa problem
• Quantum and classical query complexities for generalized Deutsch-Jozsa problems
• scientific article; zbMATH DE number 5953468 (Why is no real title available?)
• Initialization-free generalized Deutsch-Jozsa algorithm
• Randomized decision tree complexity of Deutsch-Jozsa problem and a generalization
• Non-Boolean quantum amplitude amplification and quantum mean estimation

This page was built for publication: A different Deutsch-Jozsa

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