QSW_MPI: a framework for parallel simulation of quantum stochastic walks

• URL: http://arxiv.org/abs/2003.02450v2
• Date: Wed, 8 Jul 2020 05:05:15 GMT
• Title: QSW_MPI: a framework for parallel simulation of quantum stochastic walks
• Authors: Edric Matwiejew and Jingbo Wang
• Abstract summary: QSW_MPI is a python package developed for time-series simulation of quantum walks. It allows for the study of Markovian open quantum systems in the Lindblad formalism.
• Score: 6.656454497798153
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: QSW_MPI is a python package developed for time-series simulation of continuous-time quantum stochastic walks. This model allows for the study of Markovian open quantum systems in the Lindblad formalism, including a generalisation of the continuous-time random walk and continuous-time quantum walk. Consisting of a python interface accessing parallelised Fortran libraries utilising sparse data structures, QSW_MPI is scalable to massively parallel computers, which makes possible the simulation of a wide range of walk dynamics on directed and undirected graphs of arbitrary complexity.

Related papers

• Hiperwalk: Simulation of Quantum Walks with Heterogeneous High-Performance Computing [0.0]
  Hiperwalk is designed to facilitate the simulation of quantum walks using heterogeneous high-performance computing. This package enables the simulation of both the continuous-time and discrete-time quantum walk models.
  arXiv  Detail & Related papers  (2024-06-12T13:17:05Z)
• TeD-Q: a tensor network enhanced distributed hybrid quantum machine learning framework [59.07246314484875]
  TeD-Q is an open-source software framework for quantum machine learning. It seamlessly integrates classical machine learning libraries with quantum simulators. It provides a graphical mode in which the quantum circuit and the training progress can be visualized in real-time.
  arXiv  Detail & Related papers  (2023-01-13T09:35:05Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• TensorCircuit: a Quantum Software Framework for the NISQ Era [18.7784080447382]
  Written purely in Python,Circuit supports automatic differentiation, just-in-time compilation, vectorized parallelism and hardware acceleration. Circuit can simulate up to 600 qubits with moderate depth and low-dimensional connectivity.
  arXiv  Detail & Related papers  (2022-05-20T11:23:30Z)
• A Quantum Dot Plot Generation Algorithm for Pairwise Sequence Alignment [0.0]
  Quantum Pairwise Sequence Alignment (QPSA) algorithm offers exponential speedups in data alignment tasks. It relies on an open problem of efficiently encoding the classical data being aligned into quantum superposition. We provide an alternative, explicit construction of this oracle called the Quantum Dot Plot (QDP) We evaluate QDP's operational complexity via analysis of the quantum machine instructions generated by the Q# and Qiskit software frameworks.
  arXiv  Detail & Related papers  (2021-07-23T16:48:29Z)
• QuaSiMo: A Composable Library to Program Hybrid Workflows for Quantum Simulation [48.341084094844746]
  We present a composable design scheme for the development of hybrid quantum/classical algorithms and for applications of quantum simulation. We implement our design scheme using the hardware-agnostic programming language QCOR into the QuaSiMo library.
  arXiv  Detail & Related papers  (2021-05-17T16:17:57Z)
• Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale [57.84751206630535]
  We present a modernized version of the Quantum Virtual Machine (TNQVM) which serves as a quantum circuit simulation backend in the e-scale ACCelerator (XACC) framework. The new version is based on the general purpose, scalable network processing library, ExaTN, and provides multiple quantum circuit simulators. By combining the portable XACC quantum processors and the scalable ExaTN backend we introduce an end-to-end virtual development environment which can scale from laptops to future exascale platforms.
  arXiv  Detail & Related papers  (2021-04-21T13:26:42Z)
• Quantum Markov Chain Monte Carlo with Digital Dissipative Dynamics on Quantum Computers [52.77024349608834]
  We develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits. We evaluate the algorithm by simulating thermal states of the transverse Ising model.
  arXiv  Detail & Related papers  (2021-03-04T18:21: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)
• Quantum Simulation of a Discrete-Time Quantum Stochastic Walk [0.0]
  We propose a trajectory-based quantum simulation protocol to implement a family of discrete-time QSWs in a quantum device. We show how our protocol generalizes to a graph with arbitrary topology and connectivity.
  arXiv  Detail & Related papers  (2020-04-13T18:44:59Z)

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.