Related papers: Exact QSP angles for odd monomials
Quantum annealing is a promising method for solving combinational optimization problems and performing quantum chemical calculations. The main sources of errors in quantum annealing are the effects of decoherence and non-adiabatic…
The application of quantum computation to accelerate machine learning algorithms is one of the most promising areas of research in quantum algorithms. In this paper, we explore the power of quantum learning algorithms in solving an…
Solving a quadratic nonlinear system of equations (QNSE) is a fundamental, but important, task in nonlinear science. We propose an efficient quantum algorithm for solving $n$-dimensional QNSE. Our algorithm embeds QNSE into a…
Quantum annealers offer an efficient way to compute high quality solutions of NP-hard problems when expressed in a QUBO (quadratic unconstrained binary optimization) or an Ising form. This is done by mapping a problem onto the physical…
We study the problems of state preparation, ground state preparation and quantum state preparation. We propose an analytic approach to a stochastic quantum algorithm which prepares the ground state for $n$-qubit Hamiltonian that is…
We discuss ways that the ring of coefficients for a TQFT can be reduced if one restricts somewhat the allowed cobordisms. When we apply these methods to a TQFT associated to SO(3) at an odd prime p, we obtain a functor from a somewhat…
We consider a protocol to perform the optimal quantum state discrimination of $N$ linearly independent non-orthogonal pure quantum states and present a computational code. Through the extension of the original Hilbert space, it is possible…
In classical case there is simplest method of error correction with using three equal bits instead of one. In the paper is shown, how the scheme fails for quantum error correction with complex vector spaces of usual quantum mechanics, but…
The quantum marginal problem consists in deciding whether a given set of marginal reductions is compatible with the existence of a global quantum state or not. In this work, we formulate the problem from the perspective of dynamical systems…
Quantum Signal Processing (QSP) has emerged as a promising framework to manipulate and determine properties of quantum systems. QSP not only unifies most existing quantum algorithms but also provides tools to discover new ones. Quantum…
We determine the squarefree part of the scalar factor that arises when the quartic invariant of the generic binary form $F$ of odd degree $2n+1$ is expressed as the discriminant of the unique quadratic covariant $(F,F)_{2n}$. This…
Quantum Singular Value Transformation (QSVT) provides a unified framework for applying polynomial functions to the singular values of a block-encoded matrix. QSVT prepares a state proportional to $\bA^{-1}\bb$ with circuit depth…
An operator theoretic approach to orthogonal rational functions on the unit circle with poles in its exterior is presented in this paper. This approach is based on the identification of a suitable matrix representation of the multiplication…
Quantum Sobel edge detection (QSED) is a kind of algorithm for image edge detection using quantum mechanism, which can solve the real-time problem encountered by classical algorithms. However, the existing QSED algorithms only consider two-…
We extend the recently introduced phaseless auxiliary-field quantum Monte Carlo (QMC) approach to any single-particle basis, and apply it to molecular systems with Gaussian basis sets. QMC methods in general scale favorably with system…
Unlike the p = 2 case, the universal Steenrod Algebra Q(p) at odd primes does not have a fractal structure that preserves the length of monomials. Nevertheless, when p is odd we detect inside Q(p) two different families of nested…
The decades-long search for a shape that tiles the plane only aperiodically under translations and rotations recently ended with the discovery of the `spectre' aperiodic monotile. In this setting we study the dimer model, in which dimers…
While Quantum phase estimation (QPE) is at the core of many quantum algorithms known to date, its physical implementation (algorithms based on quantum Fourier transform (QFT)) is highly constrained by the requirement of high-precision…
We show that supersymmetry is a simple but powerful tool to exactly solve quantum mechanics problems. Here, the supersymmetric approach is used to analyse a quantum system with periodic P\"oschl-Teller potential, and to find out the exact…
We analyze relationships between quantum computation and a family of generalizations of the Jones polynomial. Extending recent work by Aharonov et al., we give efficient quantum circuits for implementing the unitary Jones-Wenzl…