On the robustness of bucket brigade quantum RAM
From MaRDI portal
Recommendations
Cites work
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Error Correcting Codes in Quantum Theory
- Exponential algorithmic speedup by a quantum walk
- Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes
- scientific article; zbMATH DE number 5076264 (Why is no real title available?)
- scientific article; zbMATH DE number 2038718 (Why is no real title available?)
- Impossibility of a Quantum Speed-Up with a Faulty Oracle
- Multiple-particle interference and quantum error correction
- Quantum random access memory
- Quantum Walk Algorithm for Element Distinctness
- STACS 2005
- Universal quantum computation with ideal Clifford gates and noisy ancillas
Cited in
(17)- Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2
- Context-aware quantum simulation of a matrix stored in quantum memory
- Sample-size-reduction of quantum states for the noisy linear problem
- Estimating quantum speedups for lattice sieves
- On new PageRank computation methods using quantum computing
- Time-bin quantum RAM
- Quantum random access memory
- Quantum machine learning: a classical perspective
- Quantum Mathematics in Artificial Intelligence
- The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation
- On the robustness of bucket brigade quantum RAM
- Quantum discriminative canonical correlation analysis
- Lattice Sieving via Quantum Random Walks
- The quantum monadology
- Quantum advantage for multi-option portfolio pricing and valuation adjustments
- On the practicality of quantum sieving algorithms for the shortest vector problem
- Low-gate quantum golden collision finding
This page was built for publication: On the robustness of bucket brigade quantum RAM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5144324)
