Related papers: Exact QSP angles for odd monomials
In this article it will be presented the first attempt made in order to perform gauge invariant calculations of eigenstates of a quantum body in its condensed phase, the latter reacting to an external uniform magnetic field. The target is…
The problem of Phase Estimation (or Amplitude Estimation) admits a quadratic quantum speedup. Wang, Higgott and Brierley [2019, Phys. Rev. Lett. 122 140504] have shown that there is a continuous trade-off between quantum speedup and circuit…
Many eigenvalue problems arising in practice are often of the generalized form $A\x=\lambda B\x$. One particularly important case is symmetric, namely $A, B$ are Hermitian and $B$ is positive definite. The standard algorithm for solving…
The study of solutions to polynomial equations over finite fields has a long history in mathematics and is an interesting area of contemporary research. In recent years the subject has found important applications in the modelling of…
We compute the number of F_q-points on M_{4,n}, for n less than or equal to 3, and show that it is a polynomial in q, using a sieve based on Hasse-Weil zeta functions. As an application, we prove that the rational singular cohomology groups…
In modern quantum field theory, one of the most important tasks is the calculation of loop integrals. Loop integrals appear when evaluating the Feynman diagrams with one or more loops by integrating over the internal momenta. Even though…
This paper deals with quon algebras or deformed oscillator algebras, for which the deformation parameter is a root of unity. We show the interest of such algebras for fractional supersymmetric quantum mechanics, angular momentum theory and…
Equational reasoning about circuits is central in quantum software for validation, optimisation, and verification. For qubits, the CNOT-dihedral fragment supports efficient rewriting via phase polynomials and layered normal forms, yielding…
Quantum effects like entanglement and coherent amplification can be used to drastically enhance the accuracy of quantum parameter estimation beyond classical limits. However, challenges such as decoherence and time-dependent errors hinder…
How to implement multi-qubit gates is an important problem in quantum information processing. Based on cross phase modulation, we present an approach to realizing a family of multi-qubit gates that deterministically operate on single…
To evaluate a quantum circuit on a quantum processor, one must find a mapping from circuit qubits to processor qubits and plan the instruction execution while satisfying the processor's constraints. This is known as the qubit mapping and…
We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric problem defined on functions $f:\{1, ..., N\}\to\{1, ..., M\}$, its polynomial degree is the same for all…
Quantum finite automata (QFA) are basic computational devices that make binary decisions using quantum operations. They are known to be exponentially memory efficient compared to their classical counterparts. Here, we demonstrate an…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
We describe a quantum algorithm for preparing states that encode solutions of non-homogeneous linear partial differential equations. The algorithm is a continuous-variable version of matrix inversion: it efficiently inverts differential…
Optimal parameter setting for applications problems embedded into hardware graphs is key to practical quantum annealers (QA). Embedding chains typically crop up as harmful Griffiths phases, but can be used as a resource as we show here: to…
In this paper, we present a new method to solve a certain type of Semidefinite Programming (SDP) problems. These types of SDPs naturally arise in the Quadratic Convex Reformulation (QCR) method and can be used to obtain dual bounds of…
Classical sensors for spectrum analysis are widely used but lack micro- or nanoscale spatial resolution. On the other hand, quantum sensors, capable of working with nanoscale precision, do not provide precise frequency resolution over a…
The conventional second-order Path Integral Monte Carlo method is plagued with the sign problem in solving many-fermion systems. This is due to the large number of anti-symmetric free fermion propagators that are needed to extract the…
The Quantum Pairwise Sequence Alignment (QPSA) algorithm offers exponential speedups in data alignment tasks. However, it relies on an open problem of efficiently encoding the classical data being aligned into quantum superposition.…