Comparing two quantum oracles using the Deutsch-Jozsa algorithm

zbMATH Open1474.81015MaRDI QIDQ5149804FDOQ5149804

Authors: A. Kiss, Krisztián Varga 

Publication date: 8 February 2021

Full work available at URL: http://ac.inf.elte.hu/Vol_050_2020/199_50.pdf

Recommendations

• Method for organizing Grover's quantum oracle
• Complexity of Grover's algorithm: an algebraic approach
• scientific article; zbMATH DE number 2076191
• Quantum and classical query complexities for generalized Deutsch-Jozsa problems
• Revisiting Deutsch-Jozsa algorithm

zbMATH Keywords

algorithmsquantum computingqueryblack box function

Mathematics Subject Classification ID

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

Cited In (8)

• Revisiting Deutsch-Jozsa algorithm
• Can von Neumann's theory meet the Deutsch-Jozsa algorithm?
• Method for organizing Grover's quantum oracle
• New summing algorithm using ensemble computing
• Title not available (Why is that?)
• Performance analysis of the hardware-efficient quantum search algorithm
• Comparison of quantum binary experiments
• An algorithm based on quantum phase estimation for the identification of patterns

This page was built for publication: Comparing two quantum oracles using the Deutsch-Jozsa algorithm

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