Pages that link to "Item:Q5172735"
From MaRDI portal
The following pages link to Efficient discrete-time simulations of continuous-time quantum query algorithms (Q5172735):
Displaying 11 items.
- On the efficiency of quantum algorithms for Hamiltonian simulation (Q424226) (← links)
- On the relationship between continuous- and discrete-time quantum walk (Q625458) (← links)
- Nonadiabatic quantum search algorithm with analytical success rate (Q1741058) (← links)
- How quantum is the speedup in adiabatic unstructured search? (Q2100794) (← links)
- EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS (Q2971052) (← links)
- (Q3522379) (← links)
- Nonlinear quantum search using the Gross–Pitaevskii equation (Q5141506) (← links)
- Floating point representations in quantum circuit synthesis (Q5141571) (← links)
- Ancilla-approximable quantum state transformations (Q5250073) (← links)
- A universal adiabatic quantum query algorithm (Q5278028) (← links)
- Exponentially more precise quantum simulation of fermions in second quantization (Q5854995) (← links)