One-dimensional discrete-time quantum walks with general coin

• URL: http://arxiv.org/abs/2102.07207v1
• Date: Sun, 14 Feb 2021 17:42:43 GMT
• Title: One-dimensional discrete-time quantum walks with general coin
• Authors: Mahesh N. Jayakody, Chandrakala Meena and Priodyuti Pradhan
• Abstract summary: We provide an algorithm for the one-dimensional quantum walk driven by the general coin operator. The study conducted on general coin operator also includes the popular coins -- Hadamard, Grover, and Fourier coins.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum walk (QW) is the quantum analog of the random walk. QW is an integral part of the development of numerous quantum algorithms. Hence, an in-depth understanding of QW helps us to grasp the quantum algorithms. We revisit the one-dimensional discrete-time QW and discuss basic steps in detail by incorporating the most general coin operator. We investigate the impact of each parameter of the general coin operator on the probability distribution of the quantum walker. We show that by tuning the parameters of the general coin, one can regulate the probability distribution of the walker. We provide an algorithm for the one-dimensional quantum walk driven by the general coin operator. The study conducted on general coin operator also includes the popular coins -- Hadamard, Grover, and Fourier coins.

Related papers

• Quantum channels, complex Stiefel manifolds, and optimization [45.9982965995401]
  We establish a continuity relation between the topological space of quantum channels and the quotient of the complex Stiefel manifold. The established relation can be applied to various quantum optimization problems.
  arXiv  Detail & Related papers  (2024-08-19T09:15:54Z)
• Scouring Parrondo's Paradox in Discrete-Time Quantum Walks [0.0]
  Parrondo's paradox is a phenomenon where a combination of losing strategies becomes a winning strategy. Unlike traditional quantum steps that allow for equal magnitude forward and backward strides based on the outcome of the coin-toss, the steps employed here permit the strides to be of unequal magnitude.
  arXiv  Detail & Related papers  (2024-01-17T05:31:02Z)
• Polyander visualization of quantum walks [0.0]
  We investigate quantum walks which play an important role in the modelling of many phenomena. The detailed and thorough description is given to the discrete quantum walks on a line, where the total quantum state consists of quantum states of the walker and the coin.
  arXiv  Detail & Related papers  (2023-11-01T10:01:08Z)
• Maximal entanglement between a quantum walker and her quantum coin for the third step and beyond regardless of the initial state [0.0]
  We study maximal entanglement generation between a walker and her coin via a discrete-time quantum walk. We solve maximal-entanglement generation as an optimization problem with quantum process fidelity as the cost function. We demonstrate a ten-step quantum walk with such coin sequences and thereby show the desired high-dimensional bipartite entanglement.
  arXiv  Detail & Related papers  (2022-09-05T02:24:29Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• High robustness quantum walk search algorithm with qudit Householder traversing coin, machine learning study [0.0]
  In this work the quantum random walk search algorithm with walk coin constructed by generalized Householder reflection and phase multiplier has been studied. The coin register is one qudit with arbitrary dimension. Monte Carlo simulations, in combination with supervised machine learning, are used to find walk coins making the quantum algorithm more robust to deviations in the coin's parameters.
  arXiv  Detail & Related papers  (2021-11-21T23:58:17Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• 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)
• 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 information spreading in a disordered quantum walk [50.591267188664666]
  We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern. We focus on the coherent static and dynamic disorder to investigate anomalous and classical transport. Our results show that a Quantum Walk can be considered as a readout device of information about defects and perturbations occurring in complex networks.
  arXiv  Detail & Related papers  (2020-10-20T20:03:19Z)

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.