Szegedy Walk Unitaries for Quantum Maps
- URL: http://arxiv.org/abs/2107.07365v1
- Date: Thu, 15 Jul 2021 14:44:35 GMT
- Title: Szegedy Walk Unitaries for Quantum Maps
- Authors: Pawel Wocjan and Kristan Temme
- Abstract summary: Szegedy developed a generic method for quantizing classical algorithms based on random walks.
We present an explicit construction of a Szegedy walk unitary for detailed balanced Lindbladians.
We also explain how the quantization method for Lindbladians can be applied to quantum channels.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Szegedy developed a generic method for quantizing classical algorithms based
on random walks [Proceedings of FOCS, 2004, pp. 32-41]. A major contribution of
his work was the construction of a walk unitary for any reversible random walk.
Such unitary posses two crucial properties: its eigenvector with eigenphase $0$
is a quantum sample of the limiting distribution of the random walk and its
eigenphase gap is quadratically larger than the spectral gap of the random
walk. It was an open question if it is possible to generalize Szegedy's
quantization method for stochastic maps to quantum maps. We answer this in the
affirmative by presenting an explicit construction of a Szegedy walk unitary
for detailed balanced Lindbladians -- generators of quantum Markov semigroups
-- and detailed balanced quantum channels. We prove that our Szegedy walk
unitary has a purification of the fixed point of the Lindbladian as eigenvector
with eigenphase $0$ and that its eigenphase gap is quadratically larger than
the spectral gap of the Lindbladian. To construct the walk unitary we leverage
a canonical form for detailed balanced Lindbladians showing that they are
structurally related to Davies generators. We also explain how the quantization
method for Lindbladians can be applied to quantum channels. We give an
efficient quantum algorithm for quantizing Davies generators that describe many
important open-system dynamics, for instance, the relaxation of a quantum
system coupled to a bath. Our algorithm extends known techniques for simulating
quantum systems on a quantum computer.
Related papers
- Quantum Dissipative Search via Lindbladians [0.0]
We analyze the convergence criteria and the convergence speed of a Markovian, purely dissipative quantum random walk on an unstructured search space.
We map the results onto an actual implementation to correctly estimate the potential and show that it is no more efficient than classical search.
arXiv Detail & Related papers (2024-07-16T14:39:18Z) - Quantum walks, the discrete wave equation and Chebyshev polynomials [1.0878040851638]
A quantum walk is the quantum analogue of a random walk.
We show that quantum walks can speed up the spreading or mixing rate of random walks on graphs.
arXiv Detail & Related papers (2024-02-12T17:15:19Z) - Normal quantum channels and Markovian correlated two-qubit quantum
errors [77.34726150561087]
We study general normally'' distributed random unitary transformations.
On the one hand, a normal distribution induces a unital quantum channel.
On the other hand, the diffusive random walk defines a unital quantum process.
arXiv Detail & Related papers (2023-07-25T15:33:28Z) - A vertical gate-defined double quantum dot in a strained germanium
double quantum well [48.7576911714538]
Gate-defined quantum dots in silicon-germanium heterostructures have become a compelling platform for quantum computation and simulation.
We demonstrate the operation of a gate-defined vertical double quantum dot in a strained germanium double quantum well.
We discuss challenges and opportunities and outline potential applications in quantum computing and quantum simulation.
arXiv Detail & Related papers (2023-05-23T13:42:36Z) - Completely Positive Map for Noisy Driven Quantum Systems Derived by
Keldysh Expansion [39.58317527488534]
We introduce a decoherence model based on the Keldysh formalism.
This formalism allows us to include non-periodic drives and correlated quantum noise in our model.
We demonstrate that this strategy generates pulses that mitigate correlated quantum noise in qubit state-transfer and gate operations.
arXiv Detail & Related papers (2023-03-20T23:05:24Z) - Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent
and Incoherent Photons Found with Gradient Search [77.34726150561087]
We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control.
We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
arXiv Detail & Related papers (2023-02-28T07:36:02Z) - Entanglement measures for two-particle quantum histories [0.0]
We prove that bipartite quantum histories are entangled if and only if the Schmidt rank of this matrix is larger than 1.
We then illustrate the non-classical nature of entangled histories with the use of Hardy's overlapping interferometers.
arXiv Detail & Related papers (2022-12-14T20:48:36Z) - 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) - Stochastic emulation of quantum algorithms [0.0]
We introduce higher-order partial derivatives of a probability distribution of particle positions as a new object that shares basic properties of quantum mechanical states needed for a quantum algorithm.
We prove that the propagation via the map built from those universal maps reproduces up to a prefactor exactly the evolution of the quantum mechanical state.
We implement several well-known quantum algorithms, analyse the scaling of the needed number of realizations with the number of qubits, and highlight the role of destructive interference for the cost of emulation.
arXiv Detail & Related papers (2021-09-16T07:54:31Z) - Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware.
We present an algorithm that compresses the Trotter steps into a single block of quantum gates.
This results in a fixed depth time evolution for certain classes of Hamiltonians.
arXiv Detail & Related papers (2021-08-06T19:38:01Z) - Bernstein-Greene-Kruskal approach for the quantum Vlasov equation [91.3755431537592]
The one-dimensional stationary quantum Vlasov equation is analyzed using the energy as one of the dynamical variables.
In the semiclassical case where quantum tunneling effects are small, an infinite series solution is developed.
arXiv Detail & Related papers (2021-02-18T20:55:04Z)
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.