相关论文: Exact QSP angles for odd monomials

We present efficient quantum algorithms for the hidden subgroup problem (HSP) on the semidirect product of cyclic groups $\Z_{p^r}\rtimes_{\phi}\Z_{p^2}$, where $p$ is any odd prime number and $r$ is any integer such that $r>4$. We also…

Quantum state preparation (QSP) is a fundamental task in quantum computation to prepare a quantum state for a given classical description of the quantum state. The classical description of an $n$-qubit quantum state may have $\exp(O(n))$…

We consider various approaches to treat the phases of a qutrit. Although it is possible to represent qutrits in a convenient geometrical manner by resorting to a generalization of the Poincare sphere, we argue that the appropriate way of…

We numerically investigate quantum circuit elementary-gate level instantiations of the standard Quantum Phase Estimation (QPE) algorithm for the task of computing the ground-state energy of a quantum magnet; the disordered fully-connected…

The complexity of the following numerical problem is studied in the quantum model of computation: Consider a general elliptic partial differential equation of order 2m in a smooth, bounded domain Q\subset \R^d with smooth coefficients and…

Accurately solving the Schr\"odinger equation remains a central challenge in computational physics, chemistry, and materials science. Here, we propose an alternative eigenvalue problem based on a system's autocorrelation function, avoiding…

We study permutation groups of given minimal degree without the classical primitivity assumption. We provide sharp upper bounds on the order of a permutation group of minimal degree m and on the number of its elements of any given support.…

We present two new quantum algorithms that either find a triangle (a copy of $K_{3}$) in an undirected graph $G$ on $n$ nodes, or reject if $G$ is triangle free. The first algorithm uses combinatorial ideas with Grover Search and makes…

We present a method to calculate integrals over monomials of matrix elements with invariant measures in terms of Wick contractions. The method gives exact results for monomials of low order. For higher--order monomials, it leads to an error…

The proposal for quantum computing with rare-earth-ion qubits in inorganic crystals makes use of the inhomogeneous broadening of optical transitions in the ions to associate individual qubits with ions responding to radiation in selected…

Recently developed quantum algorithms address computational challenges in numerical analysis by performing linear algebra in Hilbert space. Such algorithms can produce a quantum state proportional to the solution of a $d$-dimensional system…

We make use of supersymmetric quantum mechanics (SUSY QM) to find three sets of conditions under which the problem of a planar quantum pendulum becomes analytically solvable. The analytic forms of the pendulum's eigenfuntions make it…

We propose new approach to numerical study of quantum spin systems. Our method is based on a fact that one can use any set of states for the path integral as long as it is complete. We apply our method to one-dimensional quantum spin system…

This paper summarizes a quantum algorithm of [R.D. Somma, et.al., Phys. Rev. Lett. 101, 130504 (2008)] that simulates a classical annealing process for solving discrete optimization problems. The complexity of the quantum algorithm scales…

We develop several algorithms for performing quantum phase estimation based on basic measurements and classical post-processing. We present a pedagogical review of quantum phase estimation and simulate the algorithm to numerically determine…

We apply the method of simplest equation for obtaining exact solitary traveling-wave solutions of nonlinear partial differential equations that contain monomials of odd and even grade with respect to participating derivatives. We consider…

Encoding hard-constrained optimization problems into a variational quantum algorithm often turns out to be a challenging task. In this work, we provide a solution for the class of open-shop scheduling problems (OSSPs), which we achieve by…

A very simple procedure to calculate eigenenergies of quantum anharmonic oscillators is presented. The method, exact but for numerical computations, consists merely in requiring the vanishing of the Wronskian of two solutions which are…

We consider quantum interpolation of polynomials. We imagine a quantum computer with black-box access to input/output pairs (x_i, f(x_i)), where f is a degree-d polynomial, and we wish to compute f(0). We give asymptotically tight quantum…

This paper is concerned with quantum cohomology and Fukaya categories of a closed monotone symplectic manifold X, where we use coefficients in a field k of characteristic p > 0. The main result of this paper is that the quantum Steenrod…