Quantum Simulation of a Discrete-Time Quantum Stochastic Walk
- URL: http://arxiv.org/abs/2004.06151v1
- Date: Mon, 13 Apr 2020 18:44:59 GMT
- Title: Quantum Simulation of a Discrete-Time Quantum Stochastic Walk
- Authors: Peter K. Schuhmacher, Luke C. G. Govia, Bruno G. Taketani, Frank K.
Wilhelm
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum walks have been shown to have a wide range of applications, from
artificial intelligence, to photosynthesis, and quantum transport. Quantum
stochastic walks (QSWs) generalize this concept to additional non-unitary
evolution. In this paper, we propose a trajectory-based quantum simulation
protocol to effectively implement a family of discrete-time QSWs in a quantum
device. After deriving the protocol for a 2-vertex graph with a single edge, we
show how our protocol generalizes to a graph with arbitrary topology and
connectivity. The straight-forward generalization leads to simple scaling of
the protocol to complex graphs. Finally, we show how to simulate a restricted
class of continuous-time QSWs by a discrete-time QSW, and how this is amenable
to our simulation protocol for discrete-time QSWs.
Related papers
- Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties?
We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.
We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - Simulating non-unitary dynamics using quantum signal processing with
unitary block encoding [0.0]
We adapt a recent advance in resource-frugal quantum signal processing to explore non-unitary imaginary time evolution on quantum computers.
We test strategies for optimising the circuit depth and the probability of successfully preparing the desired imaginary-time evolved states.
We find that QET-U for non-unitary dynamics is flexible, intuitive and straightforward to use, and suggest ways for delivering quantum advantage in simulation tasks.
arXiv Detail & Related papers (2023-03-10T19:00:33Z) - Realization of quantum signal processing on a noisy quantum computer [0.4593579891394288]
We propose a strategy to run an entire QSP protocol on noisy quantum hardware by carefully reducing overhead costs at each step.
We test the protocol by running the algorithm on the Quantinuum H1-1 trapped-ion quantum computer powered by Honeywell.
Our results are the first step in the experimental realization of QSP-based quantum algorithms.
arXiv Detail & Related papers (2023-03-09T19:00:17Z) - Quantum process tomography of continuous-variable gates using coherent
states [49.299443295581064]
We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit.
We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
arXiv Detail & Related papers (2023-03-02T18:08:08Z) - 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) - Quantifying protocol efficiency: a thermodynamic figure of merit for
classical and quantum state-transfer protocols [0.0]
We focus on classical and quantum protocols transferring a state across a double-well potential.
The classical protocols are achieved by deforming the potential, while the quantum ones are assisted by a counter-diabatic driving.
We show that quantum protocols perform more quickly and accurately.
arXiv Detail & Related papers (2022-12-20T09:19:51Z) - Implementation of Continuous-Time Quantum Walks on Quantum Computers [0.0]
Quantum walks are interesting candidates to be implemented on quantum computers.
We describe efficient circuits that implement the evolution operator of continuous-time quantum-walk-based search algorithms on three graph classes.
arXiv Detail & Related papers (2022-12-17T14:59:21Z) - From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions.
For its practicability and wide-applicability, we give a brief review of typical graph learning techniques.
We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
arXiv Detail & Related papers (2022-02-19T02:56:47Z) - 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 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)
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.