Pages that link to "Item:Q1616488"
From MaRDI portal
The following pages link to Efficient quantum algorithms of finding the roots of a polynomial function (Q1616488):
Displaying 8 items.
- On zeros of exponential polynomials and quantum algorithms (Q989909) (← 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)
- Solving Bernstein and Vazirani's problem with the 2-bit permutation function (Q2102201) (← links)
- Quantum algorithm for the root-finding problem (Q2329950) (← links)
- (Q4598149) (← links)
- Generalization of the Bernstein-Vazirani algorithm beyond qubit systems (Q6590040) (← links)