Two-level Quantum Walkers on Directed Graphs II: An Application to qRAM

• URL: http://arxiv.org/abs/2204.08709v3
• Date: Tue, 13 Dec 2022 08:12:27 GMT
• Title: Two-level Quantum Walkers on Directed Graphs II: An Application to qRAM
• Authors: Ryo Asaka, Kazumitsu Sakai, Ryoko Yahagi
• Abstract summary: We physically implement a quantum random access memory (qRAM) Data with address information are dual-rail encoded into quantum walkers. Walkers pass through perfect binary trees to access memory cells and copy the data stored in the cells.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This is the second paper in a series of two. Using a multi-particle continuous-time quantum walk with two internal states, which has been formulated in the first paper (arXiv:2112.08119), we physically implement a quantum random access memory (qRAM). Data with address information are dual-rail encoded into quantum walkers. The walkers pass through perfect binary trees to access the designated memory cells and copy the data stored in the cells. A roundabout gate allocated at each node serves as a router to move the walker from the parent node to one of two child nodes, depending on the internal state of the walker. In this process, the address information is sequentially encoded into the internal states so that the walkers are adequately delivered to the target cells. The present qRAM, which processes $2^n$ $m$-qubit data, is implemented in a quantum circuit of depth $O(n\log(n+m))$ and requires $O(n+m)$ qubit resources. This is more efficient than the conventional bucket-brigade qRAM that requires $O(n^2+nm)$ steps and $O(2^{n}+m)$ qubit resources for processing. Moreover, since the walkers are not entangled with any device on the binary trees, the cost of maintaining coherence can be reduced. Notably, by simply passing quantum walkers through binary trees, data can be automatically extracted in a quantum superposition state. In other words, any time-dependent control is not required.

Related papers

• Cat-qubit-inspired gate on cos($2\theta$) qubits [77.34726150561087]
  We introduce a single-qubit $Z$ gate inspired by the noise-bias preserving gate of the Kerr-cat qubit. This scheme relies on a $pi$ rotation in phase space via a beamsplitter-like transformation between a qubit and ancilla qubit.
  arXiv  Detail & Related papers  (2023-04-04T23:06:22Z)
• Efficient parallelization of quantum basis state shift [0.0]
  We optimize the state shift algorithm by incorporating the shift in different directions in parallel. This provides a significant reduction in the depth of the quantum circuit in comparison to the currently known methods. We focus on the one-dimensional and periodic shift, but note that the method can be extended to more complex cases.
  arXiv  Detail & Related papers  (2023-04-04T11:01:08Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• Tuning for Quantum Speedup in Directed Lackadaisical Quantum Walks [0.0]
  Quantum walks constitute an important tool for designing quantum algorithms and information processing tasks. In a lackadaisical walk, the walker can remain on the same node with some probability. Surprisingly, a significant quantum-induced speedup is realized for large $l$.
  arXiv  Detail & Related papers  (2022-11-11T12:38:11Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Two-level Quantum Walkers on Directed Graphs I: Universal Quantum Computing [0.0]
  We propose a model of universal quantum computation using a fermionic/bosonic multi-particle continuous-time quantum walk with two internal states. A single-qubit is represented by the presence of a single quantum walker in either of the two parallel paths. A physical implementation of quantum random access memory compatible with the present model will be considered in the second paper.
  arXiv  Detail & Related papers  (2021-12-15T13:38:18Z)
• Generalized quantum teleportation of shared quantum secret with quantum walks [6.236377496735381]
  We present a novel secure (n,m) quantum teleportation of shared quantum secret between n senders and $m$ receivers. Neither any single nor subparties of senders and receivers can fully access the secret quantum information. This work provides an additional relevant instance of the richness of quantum walks for quantum information processing tasks.
  arXiv  Detail & Related papers  (2020-12-05T13:23:19Z)
• Quantum random access memory via quantum walk [0.0]
  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.
  arXiv  Detail & Related papers  (2020-08-31T04:54:12Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)
• Parallelising the Queries in Bucket Brigade Quantum RAM [69.43216268165402]
  Quantum algorithms often use quantum RAMs (QRAM) for accessing information stored in a database-like manner. We show a systematic method to significantly reduce the effective query time by using Clifford+T gate parallelism. We conclude that, in theory, fault-tolerant bucket brigade quantum RAM queries can be performed approximately with the speed of classical RAM.
  arXiv  Detail & Related papers  (2020-02-21T14:50:03Z)
• Communication Cost of Quantum Processes [49.281159740373326]
  A common scenario in distributed computing involves a client who asks a server to perform a computation on a remote computer. An important problem is to determine the minimum amount of communication needed to specify the desired computation. We analyze the total amount of (classical and quantum) communication needed by a server in order to accurately execute a quantum process chosen by a client.
  arXiv  Detail & Related papers  (2020-02-17T08:51:42Z)

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.