Related papers: Exact QSP angles for odd monomials
Pricing financial derivatives on quantum computers typically includes quantum arithmetic components which contribute heavily to the quantum resources required by the corresponding circuits. In this manuscript, we introduce a method based on…
We propose an approach to measure the quantum phase of an electron in a non-Abelian system using the algorithm of Quantum Phase Estimation (QPE). The discrete-path systems were previously studied in the context of square or rectangular…
The iterative quasi-particle-random-phase approximation (QRPA) method we previously developed to accurately calculate properties of individual nuclear states is extended so that it can be applied for nuclei with odd numbers of neutrons and…
Quantum process tomography (QPT) methods aim at identifying a given quantum process. The present paper focuses on the estimation of a unitary process. This class is of particular interest because quantum mechanics postulates that the…
We find a parametric solution of an arbitrary symmetric homogeneous diophantine equation of 5th degree in 6 variables using two primitive solutions. We then generalize this approach to symmetric forms of any odd degree by proving the…
Despite rapid advances in quantum hardware, noise remains a central obstacle to deploying quantum algorithms on near-term devices. In particular, random coherent errors that accumulate during circuit execution constitute a dominant and…
Quantum signal processing (QSP) relies on a historically costly pre-processing step, "QSP-processing/phase-factor finding." QSP-processing is now a developed topic within quantum algorithms literature, and a beginner accessible review of…
The initialization of quantum states or Quantum State Preparation (QSP) is a basic subroutine in quantum algorithms. In the worst case, general QSP algorithms are expensive due to the application of multi-controlled gates required to build…
The study of classical algorithms is supported by an immense understructure, founded in logic, type, and category theory, that allows an algorithmist to reason about the sequential manipulation of data irrespective of a computation's…
We show that in the quantum query model the complexity of detecting a triangle in an undirected graph on $n$ nodes can be done using $O(n^{1+{3\over 7}}\log^{2}n)$ quantum queries. The same complexity bound applies for outputting the…
We study the phase discrimination problem, in which we want to decide whether the eigenphase $\theta\in(-\pi,\pi]$ of a given eigenstate $|\psi\rangle$ with eigenvalue $e^{i\theta}$ is zero or not, using applications of the unitary $U$…
The quantum singular value transformation has revolutionised quantum algorithms. By applying a polynomial to an arbitrary matrix, it provides a unifying picture of quantum algorithms. However, polynomials are restricted to definite parity…
The Quantum Approximate Optimisation Algorithm is a $p$ layer, time-variable split operator method executed on a quantum processor and driven to convergence by classical outer loop optimisation. The classical co-processor varies individual…
Modern quantum annealers can find high-quality solutions to combinatorial optimisation objectives given as quadratic unconstrained binary optimisation (QUBO) problems. Unfortunately, obtaining suitable QUBO forms in computer vision remains…
Block-encodings have become one of the most common oracle assumptions in the circuit model. I present an algorithm that uses von Neumann's measurement procedure to measure a phase, using time evolution on a block-encoded Hamiltonian as a…
In this talk we present the result for the $n_f$ dependent piece of the three-loop cusp anomalous dimension in QCD. Remarkably, it is parametrized by the same simple functions appearing in analogous anomalous dimensions in ${\mathcal N}=4$…
Properties of the $q$-ultraspherical polynomials for $q$ being a primitive root of unity are derived using a formalism of the $so_q(3)$ algebra. The orthogonality condition for these polynomials provides a new class of trigonometric…
Let ${\mathbf U}_q^-$ be the negative half of a quantum group of finite type. Let $P$ be the transition matrix between the canonical basis and a PBW basis of ${\mathbf U}_q^-$. In the case ${\mathbf U}_q^-$ is symmetric, Antor gave a simple…
Non-Gaussian operations are essential for most bosonic quantum technologies. Yet, realizable non-Gaussian gates are rather limited in type and generally suffer from accuracy-duration trade-offs. In this work, we propose to use quantum…
Robust quantum control is crucial for achieving operations below the quantum error correction threshold. Quantum Signal Processing (QSP) transforms a unitary parameterized by $\theta$ into one governed by a polynomial function $f(\theta)$,…