Related papers: Partial Quantifier Elimination
We introduce the generative quantum eigensolver (GQE), a new quantum computational framework that operates outside the variational quantum algorithm paradigm by applying classical generative models to quantum simulation. The GQE algorithm…
As shown in our publications, quantum theory based on a finite ring of characteristic $p$ (FQT) is more general than standard quantum theory (SQT) because the latter is a degenerate case of the former in the formal limit $p\to\infty$. One…
We show that Pinney's equation [2] with a constant coefficient can be reduced to its linear part by a simple change of variables. Also, Pinney's original solution is simplified slightly.
The article investigates classes of queries maintainable by conjunctive queries (CQs) and their extensions and restrictions in the dynamic complexity framework of Patnaik and Immerman. Starting from the basic language of quantifier-free…
The combination of machine learning and physical laws has shown immense potential for solving scientific problems driven by partial differential equations (PDEs) with the promise of fast inference, zero-shot generalisation, and the ability…
The concept of the quantum Pfaffian is rigorously examined and refurbished using the new method of quantum exterior algebras. We derive a complete family of Pl\"ucker relations for the quantum linear transformations, and then use them to…
The Cylindrical Algebraic Decomposition (CAD) algorithm is a comprehensive tool to perform quantifier elimination over real closed fields. CAD has doubly exponential running time, making it infeasible for practical purposes. We propose to…
An essential element of classical computation is the "if-then" construct, that accepts a control bit and an arbitrary gate, and provides conditional execution of the gate depending on the value of the controlling bit. On the other hand,…
The current state of the art for large-scale quantum-mechanical simulations is the planewave (PW) pseudopotential method, as implemented in codes such as VASP, ABINIT, and many others. However, since the PW method uses a global Fourier…
Quantum query complexity is typically characterized in terms of XOR queries |x,y> to |x,y+f(x)> or phase queries, which ensure that even queries to non-invertible functions are unitary. When querying a permutation, another natural model is…
Current quantum computers are limited in the number of qubits and coherence time, constraining the algorithms executable with sufficient fidelity. The variational quantum eigensolver (VQE) is an algorithm to find an approximate ground state…
Generalized quantum master equations (GQMEs) are an important tool in modeling chemical and physical processes. For a large number of problems it has been shown that exact and approximate quantum dynamics methods can be made dramatically…
Although classical mechanics and quantum mechanics are separate disciplines, we live in a world where Planck's constant \hbar>0, meaning that the classical and quantum world views must actually {\it coexist}. Traditionally, canonical…
Today's quantum field theory (QFT) relies heavenly on canonical quantization (CQ), which fails for $\varphi^4_4$ leading only to a "free" result. Affine quantization (AQ), an alternative quantization procedure, leads to a "non-free" result…
Functional data such as curves and surfaces have become more and more common with modern technological advancements. The use of functional predictors remains challenging due to its inherent infinite-dimensionality. The common practice is to…
Assume that $\Phi:\mathbb{M}_{n}(\mathbb{C})\rightarrow\mathbb{M}_{n}(\mathbb{C})$ is a superoperator which preserves hermiticity. We give an algorithm determining whether $\Phi$ preserves semipositivity (we call $\Phi$ positive in this…
The object of this paper is a one-dimensional generalized porous media equation (PDE) with possibly discontinuous coefficient $\beta$, which is well-posed as an evolution problem in $L^1(\mathbb{R})$. In some recent papers of Blanchard et…
We argue that to solve the foundational problems of quantum theory one has to first understand what it means to quantize a classical system. We then propose a quantization method based on replacement of deterministic c-numbers by…
Probably the simplest and most frequently used way to illustrate the power of quantum computing is to solve the so-called {\it Deutsch's problem}. Consider a Boolean function $f: \{0,1\} \to \{0,1\}$ and suppose that we have a (classical)…
This manuscript is an extended abstract version of the paper entitled ``Quantum Deletion Codes derived from Classical Deletion Codes.'' The paper contributes to the fundamental theory for quantum deletion error-correcting codes. The paper…