Related papers: Exact QSP angles for odd monomials
We present an example of quantum process tomography (QPT) performed on a single solid state qubit. The qubit used is two energy levels of the triplet state in the Nitrogen-Vacancy defect in Diamond. Quantum process tomography is applied to…
We propose a quantum analogue of Bluestein's algorithm (QBA) that implements an exact $N$-point Quantum Fourier Transform (QFT) for arbitrary $N$. Our construction factors the $N$-dimensional QFT unitary into three diagonal quadratic-phase…
We consider an approach to deciding isomorphism of rigid n-vertex graphs (and related isomorphism problems) by solving a nonabelian hidden shift problem on a quantum computer using the standard method. Such an approach is arguably more…
An efficient quantum algorithm is proposed to solve in polynomial time the parity problem, one of the hardest problems both in conventional quantum computation and in classical computation, on NMR quantum computers. It is based on the…
This research extends quantum singular value transformation (QSVT) for general bounded operators embedded in unitary operators on possibly infinite-dimensional Hilbert spaces. Through in-depth mathematical exploration, we have achieved a…
We describe a strategy to solve differential equations for Feynman integrals by powers series expansions near singular points and to obtain high precision results for the corresponding master integrals. We consider Feynman integrals with…
The quantum search problem is an important problem due to the fact that a general NP problem can be solved efficiently by an unsorted quantum search algorithm. Here it has been shown that the quantum search problem could be solved in…
Multivariable Quantum Signal Processing (M-QSP) [1] is expected to provide an efficient means to handle polynomial transformations of multiple variables simultaneously. However, we noticed several inconsistencies in the main Theorem 2.3 and…
This paper introduces a new algorithm for solving a sub-class of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified inequalities on continuous domains. This class of QCSPs has…
Entanglement of a quantum system depends upon relative phase in complicated ways, which no single measurement can reflect. Because of this, entanglement witnesses are necessarily limited in applicability and/or utility. We propose here a…
This paper presents new formulary solutions for quantic polynomial equations in general forms, where we present five solutions for any fifth degree polynomial equation with real coefficients, and thereby having the possibility to calculate…
We prove that quantum computation is polynomially equivalent to classical probabilistic computation with an oracle for estimating the value of simple sums, quadratically signed weight enumerators. The problem of estimating these sums can be…
The preparation of the ground state of a Hamiltonian $H$ with a large spectral radius has applications in many areas such as electronic structure theory and quantum field theory. Given an initial state with a constant overlap with the…
Quantum algorithms are still challenging to solve linear systems of equations on real devices. This challenge arises from the need for deep circuits and numerous ancilla qubits. We introduce the quantum conjugate gradient (QCG) method using…
A class of non-linear eigenvalue problems defined in the form of operator polynomials is investigated. The problems are related to wave equations which appear in a relativistic quantum field theory. Spectral asymptotics for this class are…
Quantum Singular Value Transformation (QSVT) is a state-of-the-art, near-optimal quantum algorithm that can be used for matrix inversion. The QSVT circuit is parameterized by a sequence of angles that must be pre-calculated classically,…
We develop a simple method for constructing polynomial invariants of degree 4 for even-$n$ qubits and give explicit expressions for these polynomial invariants. We demonstrate the invariance of the polynomials under stochastic local…
We study the quadratic penalty method (QPM) for smooth nonconvex optimization problems with equality constraints. Assuming the constraint violation satisfies the PL condition near the feasible set, we derive sharper worst-case complexity…
Quantum algorithms for scientific computing require modules implementing fundamental functions, such as the square root, the logarithm, and others. We require algorithms that have a well-controlled numerical error, that are uniformly…
Quantum ground-state problems are computationally hard problems; for general many-body Hamiltonians, there is no classical or quantum algorithm known to be able to solve them efficiently. Nevertheless, if a trial wavefunction approximating…