相关论文: An efficient and accurate quantum algorithm for th…
Superconducting quantum circuits are promising candidate for building scalable quantum computers. Here, we use a four-qubit superconducting quantum processor to solve a two-dimensional system of linear equations based on a quantum algorithm…
Dirac-Coulomb type differential equation and its solution relativistic exponential-type spinor orbitals are introduced. They provide a revised form for operator invariants, namely Dirac invariants, simplifying the treatment of the angular…
An effective approach for solving the three-dimensional Dirac equation for spherically symmetric local interactions, which we have introduced recently, is reviewed and consolidated. The merit of the approach is in producing Schrodinger-like…
Quantum computers could potentially simulate the dynamics of systems such as polyatomic molecules on a much larger scale than classical computers. We investigate a general quantum computational algorithm that simulates the time evolution of…
Quadratic Unconstrained Binary Optimization (QUBO) is a broad class of optimization problems with many practical applications. To solve its hard instances in an exact way, known classical algorithms require exponential time and several…
Dipolar coupled homonuclear spins present challenging, yet useful systems for quantum information processing. In such systems, eigenbasis of the system Hamiltonian is the appropriate computational basis and coherent control can be achieved…
Quaternion Dirac equation has been analyzed and its supersymetrization has been discussed consistently. It has been shown that the quaternion Dirac equation automatically describes the spin structure with its spin up and spin down…
The partition function is an essential quantity in statistical mechanics, and its accurate computation is a key component of any statistical analysis of quantum system and phenomenon. However, for interacting many-body quantum systems, its…
Properties of the Cauchy-Riemann-Fueter equation for maps between quaternionic manifolds are studied. Spaces of solutions in case of maps from a K3-surface to the cotangent bundle of a complex projective space are computed. A relationship…
Quantum computers are known to be qualitatively more powerful than classical computers, but so far only a small number of different algorithms have been discovered that actually use this potential. It would therefore be highly desirable to…
To address the issue of excessive quantum resource requirements in Kuperberg's algorithm for the dihedral hidden subgroup problem, this paper proposes a distributed algorithm based on the function decomposition. By splitting the original…
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 quantum algorithm is proposed to solve the Satisfiability problems by the ground-state quantum computer. The scale of the energy gap of the ground-state quantum computer is analyzed for the 3-bit Exact Cover problem. The time cost of this…
We show explicitly that high harmonics of the classical Liouville density distribution in the chaotic regime can be obtained efficiently on a quantum computer [1,2]. As was stated in [1], this provides information unaccessible for classical…
Using a separable many-body variational wavefunction, we formulate a self-consistent effective Hamiltonian theory for fermionic many-body system. The theory is applied to the two-dimensional Hubbard model as an example to demonstrate its…
The one-particle three-dimensional Dirac equation with spherical symmetry is solved for the Hulthen potential. The s-wave relativistic energy spectrum and two-component spinor wavefunctions are obtained analytically. Conforming to the…
We develop an algorithm for the computation of general Fourier integral operators associated with canonical graphs. The algorithm is based on dyadic parabolic decomposition using wave packets and enables the discrete approximate evaluation…
We present an algorithm to compute the number of solutions of the (constrained) number partitioning problem. A concrete implementation of the algorithm on an Ising-type quantum computer is given.
A principally novel approach towards solving the few-particle (many-dimensional) quantum scattering problems is described. The approach is based on a complete discretization of few-particle continuum and usage of massively parallel…
The equation of the spin-$\frac{1}{2}$ particles in the Friedmann-Lema\^itre-Robertson-Walker spacetime is investigated. The retarded and advanced fundamental solutions to the Dirac operator and generalized Dirac operator as well as the…