Related papers: Accelerating quantum Gibbs sampling without quantu…
Quantum computation using continuous-time evolution under a natural hardware Hamiltonian is a promising near- and mid-term direction toward powerful quantum computing hardware. We investigate the performance of continuous-time quantum walks…
The computational cost of preparing a quantum state can be substantial depending on the structure of data to be encoded. Many quantum algorithms require repeated sampling to find the answer, mandating reconstruction of the same input state…
Quantum walks (QWs) are of interest as examples of uniquely quantum behavior and are applicable in a variety of quantum search and simulation models. Implementing QWs on quantum devices is useful from both points of view. We describe a…
In recent years, there has been an emerging trend of combining two innovations in computer science and physics to achieve better computation capability. Exploring the potential of quantum computation to achieve highly efficient performance…
We provide a noisy intermediate-scale quantum framework for simulating the dynamics of open quantum systems, generalized time evolution, non-linear differential equations and Gibbs state preparation. Our algorithm does not require any…
This work introduces a graph-phased Szegedy's quantum walk, which incorporates link phases and local arbitrary phase rotations (APR), unlocking new possibilities for quantum algorithm efficiency. We demonstrate how to adapt quantum circuits…
A central task in many applications is reasoning about processes that change over continuous time. Continuous-Time Bayesian Networks is a general compact representation language for multi-component continuous-time processes. However, exact…
We develop a quantum algorithm for estimating the free energy as well as the total Gibbs state of interacting quantum Coulomb gases and molecular systems in dimensions $d \in \{2,3\}$ at finite temperature. These systems lie beyond the…
In a recent work [10], Poulin and one of us presented a quantum algorithm for preparing thermal Gibbs states of interacting quantum systems. This algorithm is based on Grovers's technique for quantum state engineering, and its running time…
The experimental realization of increasingly complex quantum states underscores the pressing need for new methods of state learning and verification. In one such framework, quantum state tomography, the aim is to learn the full quantum…
Designing quantum algorithms with a speedup over their classical analogs is a central challenge in quantum information science. Motivated by recent experimental observations of a superlinear quantum speedup in solving the Maximum…
One of the significant breakthroughs in quantum computation is Grover's algorithm for unsorted database search. Recently, the applications of Grover's algorithm to solve global optimization problems have been demonstrated, where unknown…
We introduce quantized bipartite walks, compute their spectra, generalize the algorithms of Grover \cite{g} and Ambainis \cite{amb03} and interpret them as quantum walks with memory. We compare the performance of walk based classical and…
We establish a systematic framework of unbiased quantum sampling and estimation protocols for the classical Gibbs expectation. This framework generalizes existing approaches to the partition function estimation and has broader applications…
We analyze the strengths and limitations of steered discrete time quantum walks in generating quantum states of bipartite quantum systems comprising of a qubit coupled to a qudit system. We demonstrate that not all quantum states in the…
In a recent work we presented a recursive algorithm to compute the matrix elements of a generic Gaussian transformation in the photon-number basis. Its purpose was to evolve a quantum state by building the transformation matrix and…
Quantum walks, both discrete and continuous, serve as fundamental tools in quantum information processing with diverse applications. This work introduces a hybrid quantum walk model that integrates the coin mechanism of discrete walks with…
It is not a general opinion that that a quantum system could be purified into a target eigenstate via repeated measurements on a coupled qubit rather than direct transitions in the Hamiltonian. The projective measurement on the ancillary…
We present classical and quantum algorithms for approximating partition functions of classical Hamiltonians at a given temperature. Our work has two main contributions: first, we modify the classical algorithm of \v{S}tefankovi\v{c},…
A computation in adiabatic quantum computing is implemented by traversing a path of nondegenerate eigenstates of a continuous family of Hamiltonians. We introduce a method that traverses a discretized form of the path: At each step we apply…