Quantum random access memory via quantum walk

• URL: http://arxiv.org/abs/2008.13365v3
• Date: Wed, 12 May 2021 10:52:25 GMT
• Title: Quantum random access memory via quantum walk
• Authors: Ryo Asaka, Kazumitsu Sakai, Ryoko Yahagi
• Abstract summary: A novel concept of quantum random access memory (qRAM) employing a quantum walk is provided. Our scheme is fully parallelized. Consequently, only O(n) steps are required to access and retrieve O(2n) data in the form of quantum superposition states.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A novel concept of quantum random access memory (qRAM) employing a quantum walk is provided. Our qRAM relies on a bucket brigade scheme to access the memory cells. Introducing a bucket with chirality left and right as a quantum walker, and considering its quantum motion on a full binary tree, we can efficiently deliver the bucket to the designated memory cells, and fill the bucket with the desired information in the form of quantum superposition states. Our procedure has several advantages. First, we do not need to place any quantum devices at the nodes of the binary tree, and hence in our qRAM architecture, the cost to maintain the coherence can be significantly reduced. Second, our scheme is fully parallelized. Consequently, only O(n) steps are required to access and retrieve O(2n) data in the form of quantum superposition states. Finally, the simplicity of our procedure may allow the design of qRAM with simpler structures.

Related papers

• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Towards Distributed Quantum Computing by Qubit and Gate Graph Partitioning Techniques [1.211184870567714]
  We propose two techniques for partitioning large quantum circuits and for distribution to small quantum computers. Our techniques map a quantum circuit to a graph representation. We use the SeQUeNCe quantum communication simulator to measure the time required for generating all the entanglements required to execute the distributed circuit.
  arXiv  Detail & Related papers  (2023-10-05T23:21:18Z)
• Quantum Memory: A Missing Piece in Quantum Computing Units [23.256454991183702]
  We provide a full design stack view of quantum memory devices. We review two types of quantum memory devices: random access quantum memory (RAQM) and quantum random access memory (QRAM) Building on top of these devices, quantum memory units in the computing architecture, including building a quantum memory unit, quantum cache, quantum buffer, and using QRAM for the quantum input-output module, are discussed.
  arXiv  Detail & Related papers  (2023-09-25T18:00:08Z)
• A vertical gate-defined double quantum dot in a strained germanium double quantum well [48.7576911714538]
  Gate-defined quantum dots in silicon-germanium heterostructures have become a compelling platform for quantum computation and simulation. We demonstrate the operation of a gate-defined vertical double quantum dot in a strained germanium double quantum well. We discuss challenges and opportunities and outline potential applications in quantum computing and quantum simulation.
  arXiv  Detail & Related papers  (2023-05-23T13:42:36Z)
• Quantum Optical Memory for Entanglement Distribution [52.77024349608834]
  Entanglement of quantum states over long distances can empower quantum computing, quantum communications, and quantum sensing. Over the past two decades, quantum optical memories with high fidelity, high efficiencies, long storage times, and promising multiplexing capabilities have been developed.
  arXiv  Detail & Related papers  (2023-04-19T03:18:51Z)
• Approximate Quantum Random Access Memory Architectures [7.509129971169722]
  Quantum supremacy in many applications using well-known quantum algorithms rely on availability of data in quantum format. We propose an approximate Parametric Quantum Circuit (PQC) based QRAM which takes address lines as input and gives out the corresponding data in these address lines as the output. We present two applications of the proposed PQC-based QRAM namely, storage of binary data and storage of machine learning (ML) dataset for classification.
  arXiv  Detail & Related papers  (2022-10-24T19:53:28Z)
• Field-deployable Quantum Memory for Quantum Networking [62.72060057360206]
  We present a quantum memory engineered to meet real-world deployment and scaling challenges. The memory technology utilizes a warm rubidium vapor as the storage medium, and operates at room temperature. We demonstrate performance specifications of high-fidelity retrieval (95%) and low operation error $(10-2)$ at a storage time of 160 $mu s$ for single-photon level quantum memory operations.
  arXiv  Detail & Related papers  (2022-05-26T00:33:13Z)
• Quantum thermodynamic methods to purify a qubit on a quantum processing unit [68.8204255655161]
  We report on a quantum thermodynamic method to purify a qubit on a quantum processing unit equipped with identical qubits. Our starting point is a three qubit design that emulates the well known two qubit swap engine. We implement it on a publicly available superconducting qubit based QPU, and observe a purification capability down to 200 mK.
  arXiv  Detail & Related papers  (2022-01-31T16:13:57Z)
• Scalable and High-Fidelity Quantum Random Access Memory in Spin-Photon Networks [6.540771405203322]
  A quantum random access memory (qRAM) is considered an essential computing unit to enable speedups in quantum information processing. Here, we propose a photonic integrated circuit (PIC) architecture integrated with solid-state memories as a viable platform for constructing a qRAM. We also present an alternative scheme based on quantum teleportation and extend it to the context of quantum networks.
  arXiv  Detail & Related papers  (2021-03-13T05:39:03Z)
• Quantum walk processes in quantum devices [55.41644538483948]
  We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
  arXiv  Detail & Related papers  (2020-12-28T18:04:16Z)
• Quantum Search for Scaled Hash Function Preimages [1.3299507495084417]
  We present the implementation of Grover's algorithm in a quantum simulator to perform a quantum search for preimages of two scaled hash functions. We show that strategies that suggest a shortcut based on sampling the quantum register after a few steps of Grover's algorithm can only provide some marginal practical advantage in terms of error mitigation.
  arXiv  Detail & Related papers  (2020-09-01T18:00:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.