The following pages link to (Q3171707):
Displaying 11 items.
- Challenges of adiabatic quantum evaluation of NAND trees (Q264902) (← links)
- The complexity of the quantum adiabatic algorithm (Q546837) (← links)
- A study of heuristic guesses for adiabatic quantum computation (Q632202) (← links)
- Entangling problem Hamiltonian for adiabatic quantum computation (Q2095868) (← links)
- A new post-quantum voting protocol based on physical laws (Q2101594) (← links)
- Unstructured randomness, small gaps and localization (Q3101856) (← links)
- Schedule path optimization for adiabatic quantum computing and optimization (Q3186634) (← links)
- The quantum adiabatic optimization algorithm and local minima (Q3581005) (← links)
- Exploring adiabatic quantum trajectories via optimal control (Q5143256) (← links)
- Iterative classical superadiabatic algorithm for combinatorial optimization (Q5869986) (← links)
- Grover search inspired alternating operator ansatz of quantum approximate optimization algorithm for search problems (Q6098281) (← links)