On the robustness of bucket brigade quantum RAM

DOI10.1088/1367-2630/17/12/123010zbMath1452.81061OpenAlexW3104450852MaRDI QIDQ5144324

Michele Mosca, Vlad Gheorghiu, Srinivasan Arunachalam, Priyaa Varshinee Srinivasan, Tomas Jochym-O'Connor

Publication date: 15 January 2021

Published in: New Journal of Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/1367-2630/17/12/123010

zbMATH Keywords

quantum algorithmsquantum error correctionquantum memories

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum gates (81P65)

Related Items (11)

Low-gate quantum golden collision finding ⋮ Quantum machine learning: a classical perspective ⋮ Quantum discriminative canonical correlation analysis ⋮ Lattice Sieving via Quantum Random Walks ⋮ 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-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 ⋮ Unnamed Item ⋮ Quantum Mathematics in Artificial Intelligence

Cites Work

• Unnamed Item
• Unnamed Item
• Universal quantum computation with ideal Clifford gates and noisy ancillas
• Quantum Random Access Memory
• Multiple-particle interference and quantum error correction
• Impossibility of a Quantum Speed-Up with a Faulty Oracle
• Exponential algorithmic speedup by a quantum walk
• Error Correcting Codes in Quantum Theory
• Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes
• Quantum Walk Algorithm for Element Distinctness
• A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• STACS 2005

This page was built for publication: On the robustness of bucket brigade quantum RAM