相关论文: A Lower Bound for the Sturm-Liouville Eigenvalue P…
A new symbolic algorithmic implementation of the general scheme of the exponentially convergent functional-discrete (FD-) method is developed and justified for the Sturm-Liouville problem on a finite interval for the Schr\"odinger equation…
Current gate-based quantum computers have the potential to provide a computational advantage if algorithms use quantum hardware efficiently. To make combinatorial optimization more efficient, we introduce the Filtering Variational Quantum…
The Quantum Approximate Optimization Algorithm (QAOA), which is a variational quantum algorithm, aims to give sub-optimal solutions of combinatorial optimization problems. It is widely believed that QAOA has the potential to demonstrate…
Recently Brakerski, Christiano, Mahadev, Vazirani and Vidick (FOCS 2018) have shown how to construct a test of quantumness based on the learning with errors (LWE) assumption: a test that can be solved efficiently by a quantum computer but…
In this paper, we consider the wave equation for the fractional Sturm-Liouville operator with lower order terms and singular coefficients and data. We prove that the problem has a very weak solution. Furthermore, we prove the uniqueness in…
Quantum simulation has emerged as a key application of quantum computing, with significant progress made in algorithms for simulating both closed and open quantum systems. The simulation of open quantum systems, particularly those governed…
We show that Durr-Hoyer's quantum algorithm of searching for extreme point of integer function can not be sped up for functions chosen randomly. Any other algorithm acting in substantially shorter time $o(\sqrt{2^n})$ gives incorrect answer…
Variational quantum eigensolver(VQE) typically minimizes energy with hybrid quantum-classical optimization, which aims to find the ground state. Here, we propose a VQE by minimizing energy variance, which is called as variance-VQE(VVQE).…
An interesting inverse optimization spectral problem, with important applications in structural health monitoring and damage detection, material design, seismic wave analysis, sonar detection, and related fields, involves reconstructing a…
We revisit the Schr\"{o}dinger equation of a quantum particle that is confined on a curved surface. Inspired by the novel work of R. C. T. da Costa [1] we find the field equation in a more convenient notation. The contribution of the…
The capacity of quantum computation exceeds that of classical computers. A revolutionary step in computation is driven by quantumness or quantum correlations, which are permanent in entanglements but often in separable states; therefore,…
Quantum $k$-minimum finding is a fundamental subroutine with numerous applications in combinatorial problems and machine learning. Previous approaches typically assume oracle access to exact function values, making it challenging to…
A de Broglie-Bohm like model of Klein-Gordon equation, that leads to the correct Schrodinger equation in the low-speed limit, is presented. Under this theoretical framework, that affords an interpretation of the quantum potential, the main…
Recent advances in quantum computing devices have brought attention to hybrid quantum-classical algorithms like the Variational Quantum Eigensolver (VQE) as a potential route to practical quantum advantage in chemistry. However, it is not…
The Quantum Approximate Optimization Algorithm (QAOA) is a promising approach for programming a near-term gate-based hybrid quantum computer to find good approximate solutions of hard combinatorial problems. However, little is currently…
We discuss a new relation between the low lying Schroedinger wave function of a particle in a one-dimentional potential V and the solution of the corresponding Hamilton-Jacobi equation with -V as its potential. The function V is $\geq 0$,…
Quantum computers promise a great computational advantage over classical computers, yet currently available quantum devices have only a limited amount of qubits and a high level of noise, limiting the size of problems that can be solved…
In this paper, we model and solve a fundamental power system problem, i.e., DC power flow, using a practical quantum computer. The Harrow-Hassidim-Lloyd (HHL) quantum algorithm is used to solve the DC power flow problem. The HHL algorithm…
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolmogorov complexity to query complexity. Our technique…
In this work, we study the projective quantum eigensolver (PQE) approach to optimizing unitary coupled cluster wave functions on quantum hardware, as introduced in arXiv:2102.00345. The projective quantum eigensolver is a hybrid…