Related papers: Does QRAT simulate IR-calc? QRAT simulation algori…
Emerging quantum applications such as error mitigation, system characterization, and hybrid protocols often require running large families of related quantum circuits. Existing intermediate representations (IRs) and frameworks such as…
The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the…
This study proposes a Quantum Fourier Transform (QFT)-enhanced quantum kernel for short-term time-series forecasting. Each signal is windowed, amplitude-encoded, transformed by a QFT, then passed through a protective rotation layer to avoid…
Withdrawn by arXiv administration because authors have forged affiliations and acknowledgements, and have not adequately responded to charges [hep-th/9912039] of unattributed use of verbatim material.
In "Cut Elimination for Gentzen's Sequent Calculus with Equality and Logic of Partial Terms" LNCS 7750,161-172(2013), we have shown that the cut rule is eliminable in two ground equational sequent calculi, to be denoted by EQ_M and EQ'. In…
Notwithstanding interest and excitement building around quantum computing in the last decades, a concise statement saying where this computing can truly help is still missing. As it is shown in the present paper, equal cost of computation…
Some aspects of the ELectrical EXplicit (ELEX) scheme for using explicit integration schemes in circuit simulation are discussed. It is pointed out that the parallel resistor approach, presented earlier to address singular matrix issues…
It is known that that the endpoint mixed norm estimate $|| \, ||Tf(x,y)||_{L_{x}^{p}}||_{L_{y}^{\infty}} \lesssim || \, ||f(x,y)||_{L_{x}^{p}}||_{L_{y}^{\infty}}$ in general does not hold for Calder\'on-Zygmund operator $T$. In this…
Sums-of-squares formulas over the integers have been studied extensively using their equivalence to consistently signed intercalate matrices. This representation, combined with combinatorial arguments, has been used to produce…
The reduction algorithm is used to compute reduced ideals of a number field. However, there are reduced ideals that can never be obtained from this algorithm. In this paper, we will show that these ideals have inverses of larger norms among…
We use the class of commuting quantum computations known as IQP (Instantaneous Quantum Polynomial time) to strengthen the conjecture that quantum computers are hard to simulate classically. We show that, if either of two plausible…
In this paper, we revisit the D-iteration algorithm in order to better explain its connection to the Gauss-Seidel method and different performance results that were observed. In particular, we study here the practical computation cost based…
We show that there exist non-Koszul graded algebras that appear to be Koszul up to any given cohomological degree. For any integer m>2 we exhibit a non-commutative quadratic algebra for which the corresponding bigraded Yoneda algebra is…
We investigate quantum computational complexity of calculating partition functions of Ising models. We construct a quantum algorithm for an additive approximation of Ising partition functions on square lattices. To this end, we utilize the…
As contemporary quantum computers do not possess error correction, any calculation performed by these devices can be considered an involuntary approximation. To solve a problem on a quantum annealer, it has to be expressed as an instance of…
Motivated by my work on enumerative invariants for Quot schemes, I related two power series obtained by two different means. One of them was computed using geometric arguments via virtual localization methods and the other one came from…
The two regular super-exponentials to base exp(1/e) are constructed. An efficient algorithm for the evaluation of these super-exponentials and their inverse functions is suggested and compared to the already published results.
In this paper, we introduce a quantum-enhanced algorithm for simulation-based optimization. Simulation-based optimization seeks to optimize an objective function that is computationally expensive to evaluate exactly, and thus, is…
This work is equivalent to that in {\em Phys. Rev. Lett.} {\bf 123}, 259401 (2019), however, Physical Review Letters prohibited reference to the additional two points in the analysis published by Zhu et al., in {\em Phys. Rev. Lett.} {\bf…
We introduce the notion of a lowering-raising (or LR) triple of linear transformations on a nonzero finite-dimensional vector space. We show how to normalize an LR triple, and classify up to isomorphism the normalized LR triples. We…