Time-inhomogeneous Quantum Walks with Decoherence on Discrete Infinite Spaces

• URL: http://arxiv.org/abs/2104.09104v1
• Date: Mon, 19 Apr 2021 07:50:52 GMT
• Title: Time-inhomogeneous Quantum Walks with Decoherence on Discrete Infinite Spaces
• Authors: Chia-Han Chou and Wei-Shih Yang
• Abstract summary: 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.
• Score: 0.2538209532048866
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In quantum computation theory, quantum random walks have been utilized by many quantum search algorithms which provide improved performance over their classical counterparts. However, due to the importance of the quantum decoherence phenomenon, decoherent quantum walks and their applications have been studied on a wide variety of structures. Recently, a unified time-inhomogeneous coin-turning random walk with rescaled limiting distributions, Bernoulli, uniform, arcsine and semi-circle laws as parameter varies have been obtained. In this paper we study the quantum analogue of these models. We obtained a representation theorem for time-inhomogeneous quantum walk on discrete infinite state space. Additionally, the convergence of the distributions of the decoherent quantum walks are numerically estimated as an application of the representation theorem, and the convergence in distribution of the quantum analogues of Bernoulli, uniform, arcsine and semicircle laws are statistically analyzed.

Related papers

• Quantum quench dynamics as a shortcut to adiabaticity [31.114245664719455]
  We develop and test a quantum algorithm in which the incorporation of a quench step serves as a remedy to the diverging adiabatic timescale. Our experiments show that this approach significantly outperforms the adiabatic algorithm.
  arXiv  Detail & Related papers  (2024-05-31T17:07:43Z)
• 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)
• Law of large numbers and central limit theorem for ergodic quantum processes [0.0]
  A discrete quantum process is represented by a sequence of quantum operations. We consider quantum processes that are obtained by repeated iterations of a quantum operation with noise.
  arXiv  Detail & Related papers  (2023-03-15T23:49:56Z)
• Twisted quantum walks, generalised Dirac equation and Fermion doubling [0.0]
  We introduce a new family of quantum walks, said twisted, which admits as continuous limit, a generalized Dirac operator equipped with a dispersion term. This quadratic term in the energy spectrum acts as an effective mass, leading to a regularization of the well known Fermion doubling problem.
  arXiv  Detail & Related papers  (2022-12-28T15:22:16Z)
• 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)
• Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
  We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
  arXiv  Detail & Related papers  (2021-03-05T08:32:43Z)
• 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)
• 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)
• 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)
• Theoretical Studies on Quantum Walks with a Time-varying Coin [0.0]
  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.
  arXiv  Detail & Related papers  (2020-04-03T01:52:26Z)
• Quantum Statistical Complexity Measure as a Signalling of Correlation Transitions [55.41644538483948]
  We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions. We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain. We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
  arXiv  Detail & Related papers  (2020-02-05T00:45:21Z)

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.