Quantum communication based on an algorithm of determining a matrix
From MaRDI portal
Publication:1740965
DOI10.1007/s10773-018-3926-9zbMath1414.81070OpenAlexW2897560356WikidataQ62037271 ScholiaQ62037271MaRDI QIDQ1740965
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
Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (1)
Cites Work
- 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
- 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: Quantum communication based on an algorithm of determining a matrix
