The variational-relaxation algorithm for finding quantum bound states
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA Quantum Algorithm for finding the Maximum
This paper describes a quantum algorithm for finding the maximum among N items. The classical method for the same problem takes O(N) steps because we need to compare two numbers in one step. This algorithm takes O( √ N) steps by exploiting the property of quantum states to exist in a superposition of states and hence performing an operation on a number of elements in one go. A tight upper bound...
متن کاملA Quantum Algorithm for Finding the Minimum
Let T [0..N −1] be an unsorted table of N items, each holding a value from an ordered set. For simplicity, assume that all values are distinct. The minimum searching problem is to find the index y such that T [y] is minimum. This clearly requires a linear number of probes on a classical probabilistic Turing machine. Here, we give a simple quantum algorithm which solves the problem using O( √ N)...
متن کاملVariational bound for the energy of two- dimensional quantum antiferromagnet
We obtain the variational upper bound for the groundstate energy of twodimensional antiferromagnetic Heisenberg model on a square lattice at arbitrary value of the anisotropy parameter using the two-dimensional generalization of Jordan-Wigner transformation. Our result can be considered as an upper bound for the perturbation theory series about the Ising limit. At present time two dimensional q...
متن کاملQuantum Multicollision-Finding Algorithm
The current paper presents a new quantum algorithm for finding multicollisions, often denoted by l-collisions, where an l-collision for a function is a set of l distinct inputs having the same output value. Although it is fundamental in cryptography, the problem of finding multicollisions has not received much attention in a quantum setting. The tight bound of quantum query complexity for findi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Physics
سال: 2017
ISSN: 0002-9505,1943-2909
DOI: 10.1119/1.4997165