Necessary and sufficient condition for quantum computing

DOI10.1007/s10773-018-3917-xzbMath1414.81075OpenAlexW2896312194WikidataQ62037273 ScholiaQ62037273MaRDI QIDQ1740946

Tadao Nakamura, Ahmed Farouk, Do Ngoc Diep, Koji Nagata

Publication date: 3 May 2019

Published in: International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10773-018-3917-x

zbMATH Keywords

quantum algorithmsquantum computation

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Quantum computation with coherent spin states and the close Hadamard problem
• New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm
• Efficient quantum algorithms of finding the roots of a polynomial function
• Creating very true quantum algorithms for quantum energy based computing
• Quantum cryptography based on the Deutsch-Jozsa algorithm
• Quantum cryptography, quantum communication, and quantum computer in a noisy environment
• Efficient quantum algorithm for the parity problem of a certain function
• Quantum algorithm for the root-finding problem
• A quantum algorithm for approximating the influences of Boolean functions and its applications
• Fiber-Optics Implementation of the Deutsch-Jozsa and Bernstein-Vazirani Quantum Algorithms with Three Qubits
• Experimental Realization of Deutsch’s Algorithm in a One-Way Quantum Computer
• Rapid solution of problems by quantum computation
• Quantum algorithms revisited
• Quantum Complexity Theory
• Quantum complexity theory

This page was built for publication: Necessary and sufficient condition for quantum computing