Some theoretically organized algorithm for quantum computers

DOI10.1007/s10773-019-04354-7zbMath1436.68123OpenAlexW2996241660MaRDI QIDQ2300853

Tadao Nakamura, Koji Nagata

Publication date: 28 February 2020

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

Full work available at URL: https://doi.org/10.1007/s10773-019-04354-7

zbMATH Keywords

quantum algorithmsquantum computationBoolean function

Mathematics Subject Classification ID

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

Related Items (4)

Quantum algorithm for evaluating two of logical functions simultaneously ⋮ Generalization of Deutsch's algorithm ⋮ A quantum algorithm for a FULL adder operation based on registers of the CPU in a quantum-gated computer ⋮ Physics' evolution toward computing

Cites Work

• Unnamed Item
• Unnamed Item
• Dynamical analysis of Grover's search algorithm in arbitrarily high-dimensional search spaces
• Quantum computation with coherent spin states and the close Hadamard problem
• Application of quantum Gauss-Jordan elimination code to quantum secret sharing code
• Quantum communication and quantum multivariate polynomial interpolation
• A quantum algorithm for approximating the influences of Boolean functions and its applications
• Quantum Gauss-Jordan elimination and simulation of accounting principles on quantum computers
• 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 theory, the Church–Turing principle and the universal quantum computer
• Quantum algorithms revisited
• Quantum Complexity Theory
• Quantum complexity theory

This page was built for publication: Some theoretically organized algorithm for quantum computers