Pages that link to "Item:Q1701186"
From MaRDI portal
The following pages link to Quantum cryptography, quantum communication, and quantum computer in a noisy environment (Q1701186):
Displayed 12 items.
- New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm (Q726023) (← links)
- Efficient quantum algorithms of finding the roots of a polynomial function (Q1616488) (← links)
- Creating very true quantum algorithms for quantum energy based computing (Q1643461) (← links)
- Quantum communication and quantum multivariate polynomial interpolation (Q1685708) (← links)
- Quantum cryptography based on the Deutsch-Jozsa algorithm (Q1685724) (← links)
- Efficient quantum algorithm for the parity problem of a certain function (Q1740738) (← links)
- Necessary and sufficient condition for quantum computing (Q1740946) (← links)
- Quantum communication based on an algorithm of determining a matrix (Q1740965) (← links)
- Continuous-variable quantum computing and its applications to cryptography (Q2208007) (← links)
- Quantum cryptography based on an algorithm for determining a function using qudit systems (Q2208054) (← links)
- A quantum algorithm for a FULL adder operation based on registers of the CPU in a quantum-gated computer (Q2239688) (← links)
- Quantum algorithm for the root-finding problem (Q2329950) (← links)