Pages that link to "Item:Q2393688"
From MaRDI portal
The following pages link to Quantum search with certainty based on modified Grover algorithms: optimum choice of parameters (Q2393688):
Displaying 14 items.
- Highlighting the mechanism of the quantum speedup by time-symmetric and relational quantum mechanics (Q285982) (← links)
- Duality quantum computer and the efficient quantum simulations (Q291560) (← links)
- Multiple-server flexible blind quantum computation in networks (Q302400) (← links)
- Asymmetric bidirectional controlled teleportation via seven-qubit cluster state (Q517808) (← links)
- Completing the physical representation of quantum algorithms provides a quantitative explanation of their computational speedup (Q1643528) (← links)
- Dynamic Grover search: applications in recommendation systems and optimization problems (Q1679370) (← links)
- A review on quantum search algorithms (Q1698826) (← links)
- Quantum confidentiality query protocol based on Bell state identity (Q2114031) (← links)
- A relational time-symmetric framework for analyzing the quantum computational speedup (Q2286506) (← links)
- A low failure rate quantum algorithm for searching maximum or minimum (Q2681628) (← links)
- A novel quantum anonymous ranking protocol (Q2685654) (← links)
- Understanding mathematics of Grover's algorithm (Q2690265) (← links)
- Quantum all-subkeys-recovery attacks on 6-round Feistel-\(2^\ast\) structure based on multi-equations quantum claw finding (Q2693895) (← links)
- Non-Boolean quantum amplitude amplification and quantum mean estimation (Q6176970) (← links)