Related papers: Further Applications of the Generalised Phase Kick…
Programming by demonstration has recently gained much attention due to its user-friendly and natural way to transfer human skills to robots. In order to facilitate the learning of multiple demonstrations and meanwhile generalize to new…
The Gell-Mann & Low theorem is a cornerstone of Quantum Field Theory (QFT) and condensed matter physics, and many-body perturbation theory is a foundational tool for treating interactions. However, their integration into quantum algorithms…
Ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is known that this approach is not powerful enough to solve NP-complete problems. In this paper we study a new approach to quantum algorithm…
Non-Hermitian generalized eigenvalue problems (GEPs) play a significant role in many practical applications, such as mechanical engineering. Based on the generalized Schur decomposition, we propose a variational quantum algorithm for…
Early in 1992, Deutsch-Jozsa algorithm computed a symmetric partial Boolean function with a single quantum query, and thus achieved the best separation between classical deterministic and exact quantum query complexity. Until recent years,…
Understanding fundamental kinetic processes is important for many problems, from plasma physics to gas dynamics. A first-principles approach to these problems requires a statistical description via the Boltzmann equation, coupled to…
Quantum parallelism is the main feature of quantum computation. In 1985 D. Deutsch showed that a single quantum computation may be sufficient to state whether a two-valued function of a two-valued variable is constant or not. Though the…
A series of hybrid quantum-classical generalized Benders decomposition (GBD) algorithms are proposed to address unit commitment (UC) problems under centralized, distributed, and partially distributed frameworks. In the centralized approach,…
We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}^N in the black-box model. We show that, in the black-box model, the exponential quantum speed-up obtained for partial functions…
The problem of geometric phase for an open quantum system is reinvestigated in a unifying approach. Two of existing methods to define geometric phase, one by Uhlmann's approach and the other by kinematic approach, which have been considered…
For chaotic classical systems, the distribution of return times to a small region of phase space is universal. We propose a simple tool to investigate multiple returns in quantum systems. Numerical evidence for the baker map and kicked top…
In this paper we outline the computation of the partition function for the generalized Kodama states (GKod) of quantum gravity using the background field method. We show that the coupling constant for GKod is the same dimensionless coupling…
A many-body Hamiltonian can be block-diagonalized by expressing it in terms of symmetry-adapted basis states. Finding the group orbit representatives of these basis states and their corresponding symmetries is currently a…
Quantum computing takes fully advantage of the superposition principle to increase greatly (even exponentially) the speed of calculations, relative to the classical approach. The Deutsch-Jozsa algorithm is the simplest quantum algorithm…
We present a detailed discussion of a general theory of phase-space distributions, introduced recently by the authors [J. Phys. A {\bf 31}, L9 (1998)]. This theory provides a unified phase-space formulation of quantum mechanics for physical…
Quantum computing is evolving so rapidly that it forces us to revisit, rewrite, and update the foundations of the theory. \emph{Basic Quantum Algorithms} revisits the earliest quantum algorithms. The journey began in 1985 with Deutsch…
The first optical proposal for the realization of the two-bit version of the Deutsch-Jozsa algorithm [D. Deutsch and R. Jozsa, Proc. R. Soc. London A {\bf 493}, 553 (1992)] is presented. The proposal uses Stark shifts in an ensemble of…
The design of optical systems capable of processing and manipulating ultra-short pulses and ultra-focused beams is highly challenging with far reaching fundamental technological applications. One key obstacle routinely encountered while…
A 3-D inverse medium problem in the frequency domain is considered. Another name for this problem is Coefficient Inverse Problem. The goal is to reconstruct spatially distributed dielectric constants from scattering data. Potential…
We consider whether trainable quantum unitaries can be used to discover quantum speed-ups for classical problems. Using methods recently developed for training quantum neural nets, we consider Simon's problem, for which there is a known…