Quantum communication based on an algorithm of determining a matrix
DOI10.1007/S10773-018-3926-9zbMATH Open1414.81070OpenAlexW2897560356WikidataQ62037271 ScholiaQ62037271MaRDI QIDQ1740965FDOQ1740965
Authors: Koji Nagata, Tadao Nakamura 
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-3926-9
Recommendations
Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Cites Work
- Experimental Realization of Deutsch’s Algorithm in a One-Way Quantum Computer
- Quantum algorithms revisited
- Quantum Complexity Theory
- Rapid solution of problems by quantum computation
- Quantum computation with coherent spin states and the close Hadamard problem
- Quantum complexity theory
- A quantum algorithm for approximating the influences of Boolean functions and its applications
- Quantum cryptography based on the Deutsch-Jozsa algorithm
- Quantum cryptography, quantum communication, and quantum computer in a noisy environment
- Fiber-optics implementation of the Deutsch-Jozsa and Bernstein-Vazirani quantum algorithms with three qubits
- 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
- Efficient quantum algorithm for the parity problem of a certain function
Cited In (3)
This page was built for publication: Quantum communication based on an algorithm of determining a matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1740965)
