BP is superior to MP with respect to complete remission rate, TTF, cycles needed to achieve maximum remission and quality of life and should be considered the new standard in first-line treatment of MM patients not eligible for transplantation.
Most approximation algorithms for #P-complete problems (e.g., evaluating the
permanent of a matrix or the volume of a polytope) work by reduction to the
problem of approximate sampling from a distribution $\pi$ over a large set
$\S$. This problem is solved using the {\em Markov chain Monte Carlo} method: a
sparse, reversible Markov chain $P$ on $\S$ with stationary distribution $\pi$
is run to near equilibrium. The running time of this random walk algorithm, the
so-called {\em mixing time} of $P$, is $O(\delta^{-1} \log 1/\pi_*)$ as shown
by Aldous, where $\delta$ is the spectral gap of $P$ and $\pi_*$ is the minimum
value of $\pi$. A natural question is whether a speedup of this classical
method to $O(\sqrt{\delta^{-1}} \log 1/\pi_*)$, the diameter of the graph
underlying $P$, is possible using {\em quantum walks}.
We provide evidence for this possibility using quantum walks that {\em
decohere} under repeated randomized measurements. We show: (a) decoherent
quantum walks always mix, just like their classical counterparts, (b) the
mixing time is a robust quantity, essentially invariant under any smooth form
of decoherence, and (c) the mixing time of the decoherent quantum walk on a
periodic lattice $\Z_n^d$ is $O(n d \log d)$, which is indeed
$O(\sqrt{\delta^{-1}} \log 1/\pi_*)$ and is asymptotically no worse than the
diameter of $\Z_n^d$ (the obvious lower bound) up to at most a logarithmic
factor.Comment: 13 pages; v2 revised several part
The hitting time of a classical random walk (Markov chain) is the time required to detect the presence of-or equivalently, to find-a marked state. The hitting time of a quantum walk is subtler to define; in particular, it is unknown whether the detection and finding problems have the same time complexity. In this paper we define new Monte Carlo type classical and quantum hitting times, and we prove several relationships among these and the already existing Las Vegas type definitions. In particular, we show that for some marked state the two types of hitting time are of the same order in both the classical and the quantum case.Then, we present new quantum algorithms for the detection and finding problems. The complexities of both algorithms are related to the new, potentially smaller, A preliminary version of this article appeared in 92 Algorithmica (2012) 63:91-116 quantum hitting times. The detection algorithm is based on phase estimation and is particularly simple. The finding algorithm combines a similar phase estimation based procedure with ideas of Tulsi from his recent theorem (Tulsi A.: Phys. Rev. A 78:012310 2008) for the 2D grid. Extending his result, we show that we can find a unique marked element with constant probability and with the same complexity as detection for a large class of quantum walks-the quantum analogue of state-transitive reversible ergodic Markov chains.Further, we prove that for any reversible ergodic Markov chain P , the quantum hitting time of the quantum analogue of P has the same order as the square root of the classical hitting time of P . We also investigate the (im)possibility of achieving a gap greater than quadratic using an alternative quantum walk. In doing so, we define a notion of reversibility for a broad class of quantum walks and show how to derive from any such quantum walk a classical analogue. For the special case of quantum walks built on reflections, we show that the hitting time of the classical analogue is exactly the square of the quantum walk.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.