相关论文: Quantum Algorithm for Generalized Deutsch-Jozsa Pr…
In this paper, we propose a quantum algorithm that combines the momentum accelerated gradient method with Schr\"odingerization [S. Jin, N. Liu and Y. Yu, Phys. Rev. Lett, 133 (2024), 230602][S. Jin, N. Liu and Y. Yu, Phys. Rev. A, 108…
Solving linear systems and computing eigenvalues are two fundamental problems in linear algebra. For solving linear systems, many efficient quantum algorithms have been discovered. For computing eigenvalues, currently, we have efficient…
Quantum algorithm involves the manipulation of amplitudes and computational basis, of which manipulating basis is largely a quantum analogue of classical computing that is always a major contributor to the complexity. In order to make full…
We provide a noisy intermediate-scale quantum framework for simulating the dynamics of open quantum systems, generalized time evolution, non-linear differential equations and Gibbs state preparation. Our algorithm does not require any…
We introduce a quantum decomposition algorithm (QDA) that decomposes the problem $\frac{\partial \rho}{\partial t}=\mathcal{L}\rho=\lambda \rho$ into a summation of eigenvalues times phase-space variables. One interesting feature of QDA…
Quantum cooling, a deterministic process that drives any state to the lowest eigenstate, has been widely used from studying ground state properties of chemistry and condensed matter quantum physics, to general optimization problems.…
Quantum algorithms are known for providing more efficient solutions to certain computational tasks than any corresponding classical algorithm. Here we show that a single qudit is sufficient to implement an oracle based quantum algorithm,…
A central goal in quantum computing is the development of quantum hardware and quantum algorithms in order to analyse challenging scientific and engineering problems. Research in quantum computation involves contributions from both physics…
According to the theoretical results, the quantum searching algorithm can be generalized by replacing the Walsh-Hadamard(W-H) transform by almost any quantum mechanical operation. We have implemented the generalized algorithm using nuclear…
We propose a hybrid quantum-classical algorithm for approximating the ground state and ground state energy of a Hamiltonian. Once the Ansatz has been decided, the quantum part of the algorithm involves the calculation of two overlap…
Consider the following generalized hidden shift problem: given a function f on {0,...,M-1} x Z_N satisfying f(b,x)=f(b+1,x+s) for b=0,1,...,M-2, find the unknown shift s in Z_N. For M=N, this problem is an instance of the abelian hidden…
We report an alternative scheme for implementing generalized quantum measurements that does not require the usage of auxiliary system. Our method utilizes solely: (a) classical randomness and post-processing, (b) projective measurements on…
Quantum algorithms offer significant speedups over their classical counterparts for a variety of problems. The strongest arguments for this advantage are borne by algorithms for quantum search, quantum phase estimation, and Hamiltonian…
Discretizing Helmholtz problems via finite elements yields linear systems whose efficient solution remains a major challenge for classical computation. In this paper, we investigate how variational quantum algorithms could address this…
In the era of noisy-intermediate-scale quantum computers, we expect to see quantum devices with increasing numbers of qubits emerge in the foreseeable future. To practically run quantum programs, logical qubits have to be mapped to the…
The working of a quantum computer is described in the concrete example of a quantum simulator of the single-particle Schrodinger equation. We show that a register of 6-10 qubits is sufficient to realize a useful quantum simulator capable of…
While quantum computers promise significant advantages, the complexity of quantum algorithms remains a major technological obstacle. We have developed and demonstrated an architecture-independent technique that simplifies adding control…
A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum…
The simplest technique for simulating a quantum algorithm - QA described based on the direct matrix representation of the quantum operators. Using this approach, it is relatively simple to simulate the operation of a QA and to perform…
The general principle for a quantum signature scheme is proposed and investigated based on ideas from classical signature schemes and quantum cryptography. The suggested algorithm is implemented by a symmetrical quantum key cryptosystem and…