Pages that link to "Item:Q4376184"
From MaRDI portal
The following pages link to Strengths and Weaknesses of Quantum Computing (Q4376184):
Displaying 8 items.
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- One complexity theorist's view of quantum computing (Q1870556) (← links)
- A lower bound on the quantum query complexity of read-once functions (Q1880783) (← links)
- Quantum speed-up for unsupervised learning (Q1945031) (← links)
- Intricacies of quantum computational paths (Q1952642) (← links)
- A new sure-success generalization of Grover iteration and its application to weight decision problem of Boolean functions (Q2436429) (← links)
- Quantum simulation from the bottom up: the case of rebits (Q4565125) (← links)
- Decoherence in quantum walks – a review (Q5437029) (← links)
