Theoretical Studies on Quantum Walks with a Time-varying Coin

• URL: http://arxiv.org/abs/2004.01333v1
• Date: Fri, 3 Apr 2020 01:52:26 GMT
• Title: Theoretical Studies on Quantum Walks with a Time-varying Coin
• Authors: Haruna Katayama (Hiroshima University), Noriyuki Hatakenaka (Hiroshima University), Toshiyuki Fujii (Asahikawa Medical University)
• Abstract summary: Quantum walks can reconstruct quantum algorithms for quantum computation, where the precise controls of quantum state transfers are required. We investigate quantum walks using a periodically time-varying coin both numerically and analytically, in order to explore the controllability of quantum walks while preserving its random nature.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum walks can reconstruct quantum algorithms for quantum computation, where the precise controls of quantum state transfers between arbitrary distant sites are required. Here, we investigate quantum walks using a periodically time-varying coin both numerically and analytically, in order to explore the controllability of quantum walks while preserving its random nature.

Related papers

• Phase transition of a continuous-time quantum walk on the half line [0.0]
  Quantum walks are referred to as quantum analogs to random walks in mathematics. We study a continuous-time quantum walk on the half line and challenge to find a limit theorem for it in this paper.
  arXiv  Detail & Related papers  (2024-03-20T13:21:29Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Quantum walks on random lattices: Diffusion, localization and the absence of parametric quantum speed-up [0.0]
  We study propagation of quantum walks on percolation-generated two-dimensional random lattices. We show that even arbitrarily weak concentrations of randomly removed lattice sites give rise to a complete breakdown of the superdiffusive quantum speed-up. The fragility of quantum speed-up implies dramatic limitations for quantum information applications of quantum walks on random geometries and graphs.
  arXiv  Detail & Related papers  (2022-10-11T10:07:52Z)
• Time-inhomogeneous Quantum Walks with Decoherence on Discrete Infinite Spaces [0.2538209532048866]
  Recently, a unified time-inhomogeneous coin-turning random walk with rescaled limiting distributions, Bernoulli, uniform, arcsine and semicircle laws as parameter varies have been obtained. We obtained a representation theorem for time-inhomogeneous quantum walk on discrete infinite state space. The convergence of the distributions of the decoherent quantum walks are numerically estimated.
  arXiv  Detail & Related papers  (2021-04-19T07:50:52Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• 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)
• Floquet engineering of continuous-time quantum walks: towards the simulation of complex and next-to-nearest neighbor couplings [0.0]
  We apply the idea of Floquet engineering in the context of continuous-time quantum walks on graphs. We define periodically-driven Hamiltonians which can be used to simulate the dynamics of certain target quantum walks. Our work provides explicit simulation protocols that may be used for directing quantum transport, engineering the dispersion relation of one-dimensional quantum walks or investigating quantum dynamics in highly connected structures.
  arXiv  Detail & Related papers  (2020-12-01T12:46:56Z)
• 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)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)
• Multi-qubit quantum computing using discrete-time quantum walks on closed graphs [2.781051183509143]
  Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks.
  arXiv  Detail & Related papers  (2020-04-13T14:12:05Z)

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.